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.r459-smll-167912651200422.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 StigmergyCommit-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 359K 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 StigmergyCommit-PT-03b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679346888421

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=StigmergyCommit-PT-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 21:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:14:52] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2023-03-20 21:14:52] [INFO ] Transformed 1231 places.
[2023-03-20 21:14:52] [INFO ] Transformed 1476 transitions.
[2023-03-20 21:14:52] [INFO ] Found NUPN structural information;
[2023-03-20 21:14:52] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 125 resets, run finished after 1118 ms. (steps per millisecond=8 ) properties (out of 15) seen :2
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-20 21:14:55] [INFO ] Computed 5 place invariants in 45 ms
[2023-03-20 21:14:56] [INFO ] After 1481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 21:14:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-20 21:15:00] [INFO ] After 2426ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-03-20 21:15:01] [INFO ] Deduced a trap composed of 398 places in 809 ms of which 11 ms to minimize.
[2023-03-20 21:15:02] [INFO ] Deduced a trap composed of 398 places in 1045 ms of which 3 ms to minimize.
[2023-03-20 21:15:03] [INFO ] Deduced a trap composed of 398 places in 883 ms of which 2 ms to minimize.
[2023-03-20 21:15:04] [INFO ] Deduced a trap composed of 398 places in 874 ms of which 3 ms to minimize.
[2023-03-20 21:15:05] [INFO ] Deduced a trap composed of 397 places in 464 ms of which 2 ms to minimize.
[2023-03-20 21:15:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4633 ms
[2023-03-20 21:15:06] [INFO ] Deduced a trap composed of 396 places in 805 ms of which 2 ms to minimize.
[2023-03-20 21:15:07] [INFO ] Deduced a trap composed of 397 places in 470 ms of which 2 ms to minimize.
[2023-03-20 21:15:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1489 ms
[2023-03-20 21:15:08] [INFO ] Deduced a trap composed of 398 places in 958 ms of which 3 ms to minimize.
[2023-03-20 21:15:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1149 ms
[2023-03-20 21:15:09] [INFO ] Deduced a trap composed of 398 places in 873 ms of which 1 ms to minimize.
[2023-03-20 21:15:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1074 ms
[2023-03-20 21:15:11] [INFO ] Deduced a trap composed of 397 places in 1090 ms of which 4 ms to minimize.
[2023-03-20 21:15:11] [INFO ] Deduced a trap composed of 396 places in 749 ms of which 1 ms to minimize.
[2023-03-20 21:15:12] [INFO ] Deduced a trap composed of 398 places in 537 ms of which 1 ms to minimize.
[2023-03-20 21:15:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 2601 ms
[2023-03-20 21:15:13] [INFO ] Deduced a trap composed of 396 places in 920 ms of which 2 ms to minimize.
[2023-03-20 21:15:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1107 ms
[2023-03-20 21:15:13] [INFO ] After 15679ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 1057 ms.
[2023-03-20 21:15:14] [INFO ] After 17953ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 8 different solutions.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 214 ms.
Support contains 80 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1070 edges and 1231 vertex of which 79 / 1231 are part of one of the 12 SCC in 15 ms
Free SCC test removed 67 places
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Graph (complete) has 1652 edges and 1164 vertex of which 1156 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 741 transitions
Trivial Post-agglo rules discarded 741 transitions
Performed 741 trivial Post agglomeration. Transition count delta: 741
Iterating post reduction 0 with 745 rules applied. Total rules applied 747 place count 1156 transition count 642
Reduce places removed 741 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 752 rules applied. Total rules applied 1499 place count 415 transition count 631
Reduce places removed 5 places and 0 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Iterating post reduction 2 with 71 rules applied. Total rules applied 1570 place count 410 transition count 565
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 68 rules applied. Total rules applied 1638 place count 344 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1639 place count 343 transition count 563
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 43 Pre rules applied. Total rules applied 1639 place count 343 transition count 520
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1725 place count 300 transition count 520
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1762 place count 263 transition count 483
Iterating global reduction 5 with 37 rules applied. Total rules applied 1799 place count 263 transition count 483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1799 place count 263 transition count 482
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 1801 place count 262 transition count 482
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1814 place count 249 transition count 358
Iterating global reduction 5 with 13 rules applied. Total rules applied 1827 place count 249 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1828 place count 249 transition count 357
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1830 place count 247 transition count 355
Iterating global reduction 6 with 2 rules applied. Total rules applied 1832 place count 247 transition count 355
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1834 place count 245 transition count 353
Iterating global reduction 6 with 2 rules applied. Total rules applied 1836 place count 245 transition count 353
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1862 place count 232 transition count 340
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1863 place count 232 transition count 339
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1867 place count 228 transition count 335
Iterating global reduction 7 with 4 rules applied. Total rules applied 1871 place count 228 transition count 335
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1874 place count 225 transition count 332
Iterating global reduction 7 with 3 rules applied. Total rules applied 1877 place count 225 transition count 332
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1879 place count 223 transition count 330
Iterating global reduction 7 with 2 rules applied. Total rules applied 1881 place count 223 transition count 330
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1885 place count 221 transition count 329
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1889 place count 221 transition count 325
Free-agglomeration rule applied 35 times.
Iterating global reduction 7 with 35 rules applied. Total rules applied 1924 place count 221 transition count 290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1959 place count 186 transition count 290
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1977 place count 186 transition count 272
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1983 place count 186 transition count 272
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1986 place count 186 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1987 place count 185 transition count 268
Applied a total of 1987 rules in 474 ms. Remains 185 /1231 variables (removed 1046) and now considering 268/1476 (removed 1208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 185/1231 places, 268/1476 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 703473 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 703473 steps, saw 132745 distinct states, run finished after 3002 ms. (steps per millisecond=234 ) properties seen :2
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 268 rows 185 cols
[2023-03-20 21:15:19] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 21:15:19] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:15:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 21:15:19] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-20 21:15:19] [INFO ] After 63ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:19] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:15:19] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2023-03-20 21:15:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-20 21:15:20] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-20 21:15:20] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 46 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 268/268 transitions.
Graph (trivial) has 73 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 184 transition count 237
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 33 rules applied. Total rules applied 63 place count 155 transition count 233
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 70 place count 154 transition count 227
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 77 place count 148 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 77 place count 148 transition count 224
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 146 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 85 place count 142 transition count 220
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 142 transition count 220
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 103 place count 135 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 135 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 109 place count 131 transition count 207
Iterating global reduction 5 with 4 rules applied. Total rules applied 113 place count 131 transition count 207
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 115 place count 129 transition count 205
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 129 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 129 transition count 204
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 122 place count 129 transition count 200
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 127 place count 129 transition count 195
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 132 place count 124 transition count 195
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 134 place count 124 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 135 place count 124 transition count 193
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 136 place count 124 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 137 place count 123 transition count 191
Applied a total of 137 rules in 75 ms. Remains 123 /185 variables (removed 62) and now considering 191/268 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 123/185 places, 191/268 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 728049 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728049 steps, saw 143453 distinct states, run finished after 3002 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 191 rows 123 cols
[2023-03-20 21:15:23] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 21:15:23] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:15:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-20 21:15:23] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 21:15:24] [INFO ] After 83ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:24] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2023-03-20 21:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-20 21:15:24] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-20 21:15:24] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 46 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/123 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 191/191 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-20 21:15:24] [INFO ] Invariant cache hit.
[2023-03-20 21:15:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 21:15:24] [INFO ] Invariant cache hit.
[2023-03-20 21:15:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 21:15:24] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-20 21:15:24] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-20 21:15:24] [INFO ] Invariant cache hit.
[2023-03-20 21:15:24] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 123/123 places, 191/191 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 181
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 113 transition count 176
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 108 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 108 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 107 transition count 175
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 101 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 48 place count 101 transition count 165
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 101 transition count 162
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 101 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 59 place count 97 transition count 158
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 97 transition count 158
Applied a total of 60 rules in 53 ms. Remains 97 /123 variables (removed 26) and now considering 158/191 (removed 33) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 158 rows 97 cols
[2023-03-20 21:15:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 21:15:25] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:15:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 21:15:25] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:25] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-20 21:15:25] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:15:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-20 21:15:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 191 transitions and 810 arcs took 2 ms.
[2023-03-20 21:15:25] [INFO ] Flatten gal took : 65 ms
Total runtime 33446 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 03b
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: 123 places, 191 transitions, 810 arcs.
Final Score: 1950.719
Took : 15 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-03b-ReachabilityCardinality-00 (reachable & potential(( ( ( ( ( (tk(P111)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P111)) ) ) & ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) ) & ( ( ( (tk(P105)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P105)) ) ) & ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) | ( ( (tk(P11)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P11)) ) ) ) | ( ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) | ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) | ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) | ( ( (tk(P120)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P120)) ) ) ) & ( ( ( (tk(P84)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P84)) ) ) | ( ( ( (tk(P93)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P93)) ) ) | ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) ) ) ) ) ) ) ) ) ) | ( ( ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) & ( ( ( (tk(P47)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P47)) ) ) & ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) ) & ( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) & ( ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) & ( ( (tk(P26)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P26)) ) ) ) ) ) & ( ( ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) & ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) & ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) ) ) & ( ( ( ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) | ( ( (tk(P98)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P98)) ) ) ) & ( ( ( (tk(P32)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P32)) ) ) | ( ( (tk(P118)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P118)) ) ) ) ) | ( ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) & ( ( ( (tk(P79)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P79)) ) ) & ( ( ( (tk(P45)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P45)) ) ) | ( ( (tk(P22)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P22)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P96)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P96)) ) ) | ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) ) | ( ( ( ( (tk(P103)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P103)) ) ) & ( ( (tk(P116)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P116)) ) ) ) | ( ( ( (tk(P81)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P81)) ) ) & ( ( (tk(P107)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P107)) ) ) ) ) ) & ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) | ( ( (tk(P70)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P70)) ) ) ) ) ) ) ) )))
PROPERTY: StigmergyCommit-PT-03b-ReachabilityCardinality-08 (reachable & potential(( ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) ) | ( ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) & ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) )))
PROPERTY: StigmergyCommit-PT-03b-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) & ( ( ( (tk(P73)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P73)) ) ) | ( ( ( (tk(P68)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) | ( ( ( (tk(P123)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P123)) ) ) & ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) ) ) )))
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679346943150

--------------------
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

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="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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 r459-smll-167912651200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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