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-167912651300462.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-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 9.5K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 1.8M 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-06a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679358859721

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-06a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 00:34:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 00:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:34:24] [INFO ] Load time of PNML (sax parser for PT used): 573 ms
[2023-03-21 00:34:24] [INFO ] Transformed 256 places.
[2023-03-21 00:34:24] [INFO ] Transformed 2816 transitions.
[2023-03-21 00:34:24] [INFO ] Found NUPN structural information;
[2023-03-21 00:34:24] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 801 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 14) seen :5
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 00:34:25] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2023-03-21 00:34:25] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-21 00:34:26] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 00:34:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-21 00:34:27] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-21 00:34:27] [INFO ] State equation strengthened by 351 read => feed constraints.
[2023-03-21 00:34:27] [INFO ] After 536ms SMT Verify possible using 351 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-21 00:34:28] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 67 ms to minimize.
[2023-03-21 00:34:28] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 1 ms to minimize.
[2023-03-21 00:34:29] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 2 ms to minimize.
[2023-03-21 00:34:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1045 ms
[2023-03-21 00:34:29] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 2 ms to minimize.
[2023-03-21 00:34:29] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 2 ms to minimize.
[2023-03-21 00:34:30] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2023-03-21 00:34:30] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2023-03-21 00:34:30] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 2 ms to minimize.
[2023-03-21 00:34:30] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-21 00:34:30] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2296 ms
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 1 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-21 00:34:32] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-21 00:34:33] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-21 00:34:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1614 ms
[2023-03-21 00:34:33] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2023-03-21 00:34:33] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-21 00:34:33] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-21 00:34:33] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-21 00:34:34] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-21 00:34:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 805 ms
[2023-03-21 00:34:34] [INFO ] After 6723ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 368 ms.
[2023-03-21 00:34:34] [INFO ] After 8224ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 58 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 587/587 transitions.
Graph (complete) has 549 edges and 256 vertex of which 253 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 253 transition count 542
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 36 rules applied. Total rules applied 79 place count 233 transition count 526
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 91 place count 229 transition count 518
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 101 place count 221 transition count 516
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 101 place count 221 transition count 487
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 159 place count 192 transition count 487
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 186 place count 165 transition count 460
Iterating global reduction 4 with 27 rules applied. Total rules applied 213 place count 165 transition count 460
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 215 place count 165 transition count 458
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 232 place count 148 transition count 441
Iterating global reduction 5 with 17 rules applied. Total rules applied 249 place count 148 transition count 441
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 254 place count 148 transition count 436
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 256 place count 146 transition count 434
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 146 transition count 434
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 270 place count 140 transition count 428
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 273 place count 137 transition count 425
Iterating global reduction 6 with 3 rules applied. Total rules applied 276 place count 137 transition count 425
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 290 place count 137 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 291 place count 137 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 292 place count 136 transition count 410
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 304 place count 136 transition count 398
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 316 place count 124 transition count 398
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 321 place count 124 transition count 398
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 325 place count 124 transition count 394
Applied a total of 325 rules in 502 ms. Remains 124 /256 variables (removed 132) and now considering 394/587 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 124/256 places, 394/587 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 4) seen :3
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 394 rows 124 cols
[2023-03-21 00:34:35] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-21 00:34:35] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:34:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-21 00:34:35] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:34:35] [INFO ] State equation strengthened by 320 read => feed constraints.
[2023-03-21 00:34:35] [INFO ] After 199ms SMT Verify possible using 320 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:34:36] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-21 00:34:36] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-21 00:34:36] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-21 00:34:36] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-21 00:34:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-21 00:34:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-21 00:34:37] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-21 00:34:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1062 ms
[2023-03-21 00:34:37] [INFO ] After 1365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-21 00:34:37] [INFO ] After 1720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 31 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 394/394 transitions.
Graph (complete) has 340 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 123 transition count 391
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 121 transition count 389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 119 transition count 389
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 10 place count 119 transition count 376
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 36 place count 106 transition count 376
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 44 place count 98 transition count 368
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 98 transition count 368
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 94 transition count 364
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 94 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 94 transition count 363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 93 transition count 362
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 93 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 93 transition count 361
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 5 with 8 rules applied. Total rules applied 72 place count 89 transition count 357
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 76 place count 85 transition count 353
Iterating global reduction 5 with 4 rules applied. Total rules applied 80 place count 85 transition count 353
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 91 place count 85 transition count 342
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 93 place count 83 transition count 340
Iterating global reduction 6 with 2 rules applied. Total rules applied 95 place count 83 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 83 transition count 339
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 99 place count 83 transition count 336
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 83 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 101 place count 82 transition count 335
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 102 place count 82 transition count 334
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 103 place count 82 transition count 334
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 104 place count 82 transition count 333
Applied a total of 104 rules in 291 ms. Remains 82 /124 variables (removed 42) and now considering 333/394 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 82/124 places, 333/394 transitions.
Finished random walk after 416 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=37 )
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14223 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 06a
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: 256 places, 2816 transitions, 35321 arcs.
Final Score: 7658.282
Took : 199 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (! ( ( ( 1 ) <= (tk(P88)) ) | ( (tk(P50)) <= ( 0 ) ) )) | (! ( ( (! ( ( ( ( 1 ) <= (tk(P107)) ) & ( ( 1 ) <= (tk(P238)) ) ) | (! ( (tk(P33)) <= ( 1 ) )) )) | ( (! ( ( (tk(P251)) <= (tk(P54)) ) | ( (tk(P91)) <= (tk(P135)) ) )) & ( ( (tk(P58)) <= (tk(P245)) ) & ( ( ( 1 ) <= (tk(P161)) ) & ( ( 1 ) <= (tk(P10)) ) ) ) ) ) | ( (tk(P244)) <= ( 0 ) ) )) ) | ( ( (! ( ( (tk(P33)) <= (tk(P234)) ) | (! ( (tk(P13)) <= ( 0 ) )) )) & ( ( (tk(P36)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P49)) ) ) ) | ( (tk(P197)) <= (tk(P114)) ) ) ) | ( (tk(P86)) <= (tk(P65)) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-01 (reachable & potential(( ( (! ( (tk(P89)) <= ( 1 ) )) | ( ( ( (tk(P9)) <= ( 0 ) ) & ( ( ( ( ( ( (tk(P149)) <= (tk(P74)) ) & ( ( 1 ) <= (tk(P206)) ) ) & (! ( (tk(P202)) <= (tk(P200)) )) ) | (! ( (tk(P85)) <= (tk(P108)) )) ) & (! ( (tk(P66)) <= ( 0 ) )) ) & ( (! ( (tk(P175)) <= (tk(P8)) )) | ( (! ( ( ( 1 ) <= (tk(P217)) ) | ( (tk(P101)) <= (tk(P125)) ) )) & ( (tk(P25)) <= (tk(P134)) ) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P186)) ) | ( ( ( ( ( (tk(P130)) <= ( 0 ) ) & ( (tk(P59)) <= ( 0 ) ) ) & (! ( (tk(P122)) <= ( 1 ) )) ) & ( (tk(P110)) <= (tk(P111)) ) ) & (! ( ( 1 ) <= (tk(P126)) )) ) ) & (! ( ( 1 ) <= (tk(P61)) )) ) ) ) & ( ( 1 ) <= (tk(P174)) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-02 (reachable & potential(( ( ( ( (tk(P223)) <= ( 1 ) ) | ( (! ( (tk(P184)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P28)) ) & (! ( ( ( ( (tk(P42)) <= (tk(P88)) ) | ( (tk(P237)) <= (tk(P133)) ) ) & ( (tk(P1)) <= (tk(P82)) ) ) | ( (! ( (tk(P209)) <= (tk(P227)) )) & (! ( (tk(P104)) <= ( 1 ) )) ) )) ) ) ) & ( ( 1 ) <= (tk(P224)) ) ) | ( ( 1 ) <= (tk(P210)) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P130)) <= ( 1 ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P7)) <= (tk(P178)) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-05 (reachable &!potential( ( (! ( ( ( 1 ) <= (tk(P197)) ) | ( ( ( ( ( 1 ) <= (tk(P74)) ) & ( ( ( (tk(P49)) <= (tk(P170)) ) & ( ( (tk(P223)) <= (tk(P240)) ) & ( ( 1 ) <= (tk(P132)) ) ) ) | (! ( (tk(P41)) <= ( 1 ) )) ) ) | ( ( ( ( ( (tk(P201)) <= ( 1 ) ) & ( (tk(P139)) <= (tk(P144)) ) ) & ( ( 1 ) <= (tk(P57)) ) ) & ( (! ( (tk(P162)) <= (tk(P60)) )) & (! ( (tk(P158)) <= ( 0 ) )) ) ) & (! ( (tk(P172)) <= ( 1 ) )) ) ) & ( ( 1 ) <= (tk(P184)) ) ) )) | ( ( (! ( ( ( 1 ) <= (tk(P176)) ) | ( ( 1 ) <= (tk(P186)) ) )) | ( (tk(P49)) <= (tk(P231)) ) ) & ( (! ( ( ( ( ( ( 1 ) <= (tk(P46)) ) | ( ( (tk(P190)) <= (tk(P36)) ) & ( (tk(P211)) <= ( 0 ) ) ) ) & ( (! ( (tk(P199)) <= (tk(P216)) )) | (! ( ( 1 ) <= (tk(P105)) )) ) ) | ( (! ( ( ( 1 ) <= (tk(P116)) ) | ( (tk(P174)) <= ( 1 ) ) )) & ( ( 1 ) <= (tk(P107)) ) ) ) | ( (tk(P15)) <= ( 0 ) ) )) & (! ( ( 1 ) <= (tk(P137)) )) ) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( ( (tk(P41)) <= (tk(P240)) ) | ( ( 1 ) <= (tk(P88)) ) ) | (! ( (! ( ( (tk(P5)) <= (tk(P3)) ) & ( ( ( 1 ) <= (tk(P107)) ) & ( (tk(P130)) <= (tk(P197)) ) ) )) | (! ( ( (! ( (tk(P79)) <= (tk(P214)) )) & (! ( (tk(P66)) <= (tk(P223)) )) ) & ( ( ( ( 1 ) <= (tk(P19)) ) & ( (tk(P232)) <= (tk(P5)) ) ) & ( ( ( 1 ) <= (tk(P141)) ) & ( (tk(P93)) <= (tk(P209)) ) ) ) )) )) ) | ( ( 1 ) <= (tk(P253)) ) ) & ( ( ( ( (tk(P232)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P158)) ) ) | (! ( ( ( ( 1 ) <= (tk(P126)) ) | (! ( ( ( 1 ) <= (tk(P20)) ) | ( ( 1 ) <= (tk(P36)) ) )) ) | (! ( ( 1 ) <= (tk(P167)) )) )) ) & ( (tk(P166)) <= ( 1 ) ) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-07 (reachable &!potential( (! ( ( (! ( ( ( (tk(P247)) <= (tk(P83)) ) | ( ( 1 ) <= (tk(P103)) ) ) | (! ( (tk(P50)) <= (tk(P96)) )) )) | ( ( ( ( (tk(P99)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P202)) ) | ( (tk(P140)) <= ( 0 ) ) ) ) | ( (tk(P218)) <= (tk(P219)) ) ) & (! ( ( (tk(P78)) <= ( 1 ) ) | (! ( (tk(P21)) <= ( 1 ) )) )) ) ) & ( ( 1 ) <= (tk(P254)) ) ))))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P4)) <= (tk(P28)) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( ( ( ( 1 ) <= (tk(P144)) ) & ( ( ( ( (tk(P116)) <= ( 1 ) ) | ( (tk(P255)) <= (tk(P81)) ) ) | ( ( ( 1 ) <= (tk(P125)) ) | ( ( 1 ) <= (tk(P168)) ) ) ) & ( ( ( (tk(P223)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P128)) ) ) & ( ( ( 1 ) <= (tk(P41)) ) | ( (tk(P31)) <= (tk(P196)) ) ) ) ) ) | ( (! ( ( (tk(P123)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P200)) ) )) | ( ( (! ( (tk(P187)) <= (tk(P122)) )) & ( ( (tk(P102)) <= (tk(P239)) ) & ( (tk(P134)) <= (tk(P186)) ) ) ) & (! ( (tk(P3)) <= (tk(P148)) )) ) ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P42)) ) | ( (tk(P48)) <= (tk(P4)) ) ) | (! ( (tk(P124)) <= ( 1 ) )) ) | ( ( ( 1 ) <= (tk(P152)) ) & (! ( ( 1 ) <= (tk(P187)) )) ) ) | ( ( ( ( (tk(P23)) <= (tk(P59)) ) | ( ( 1 ) <= (tk(P243)) ) ) | ( ( ( 1 ) <= (tk(P192)) ) | ( (tk(P217)) <= ( 1 ) ) ) ) | ( ( ( (tk(P114)) <= (tk(P61)) ) | ( (tk(P242)) <= (tk(P31)) ) ) | ( (tk(P28)) <= ( 1 ) ) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P113)) ) | ( (tk(P71)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P147)) ) | ( (tk(P108)) <= (tk(P203)) ) ) ) & (! ( ( 1 ) <= (tk(P137)) )) ) | ( ( 1 ) <= (tk(P195)) ) ) ) ) & ( (! ( (tk(P169)) <= (tk(P221)) )) | (! ( (tk(P234)) <= (tk(P153)) )) ) ))))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P23)) <= (tk(P17)) ) | ( (tk(P32)) <= (tk(P136)) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-11 (reachable &!potential( ( ( (tk(P16)) <= ( 0 ) ) & ( ( (! ( ( ( ( (! ( (tk(P203)) <= ( 0 ) )) & ( ( (tk(P254)) <= ( 0 ) ) | ( (tk(P70)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P176)) ) ) & ( (tk(P32)) <= (tk(P9)) ) ) | ( ( ( 1 ) <= (tk(P186)) ) & (! ( ( 1 ) <= (tk(P242)) )) ) )) | (! ( (tk(P184)) <= ( 1 ) )) ) | (! ( ( ( 1 ) <= (tk(P94)) ) & ( (tk(P166)) <= ( 0 ) ) )) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P19)) <= (tk(P149)) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( ( ( (! ( ( ( (tk(P115)) <= ( 0 ) ) & ( (tk(P174)) <= ( 0 ) ) ) | ( ( (tk(P118)) <= (tk(P243)) ) & ( (tk(P253)) <= (tk(P170)) ) ) )) | ( (tk(P202)) <= ( 1 ) ) ) | ( (! ( ( ( 1 ) <= (tk(P247)) ) | ( (tk(P230)) <= ( 0 ) ) )) & (! ( ( ( (tk(P196)) <= ( 1 ) ) | ( (tk(P44)) <= ( 1 ) ) ) & ( ( (tk(P167)) <= ( 1 ) ) & ( (tk(P176)) <= ( 1 ) ) ) )) ) ) | ( ( ( ( ( ( (tk(P34)) <= (tk(P140)) ) | ( (tk(P217)) <= (tk(P81)) ) ) | ( ( (tk(P169)) <= (tk(P243)) ) & ( (tk(P248)) <= (tk(P157)) ) ) ) | ( ( 1 ) <= (tk(P203)) ) ) & ( ( ( (tk(P229)) <= ( 0 ) ) & ( ( (tk(P70)) <= ( 1 ) ) & ( (tk(P243)) <= ( 1 ) ) ) ) | ( ( 1 ) <= (tk(P118)) ) ) ) | ( (! ( ( (tk(P198)) <= (tk(P71)) ) & ( ( (tk(P208)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P54)) ) ) )) | ( (tk(P199)) <= ( 1 ) ) ) ) ) | ( ( ( (! ( (tk(P45)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P152)) ) ) | ( (! ( ( (tk(P11)) <= ( 0 ) ) | ( (tk(P236)) <= ( 1 ) ) )) & ( ( (tk(P136)) <= ( 0 ) ) & ( (tk(P186)) <= ( 0 ) ) ) ) ) & ( (! ( (tk(P112)) <= ( 0 ) )) & ( ( ( ( ( 1 ) <= (tk(P86)) ) | (! ( ( 1 ) <= (tk(P247)) )) ) & ( (! ( (tk(P233)) <= (tk(P242)) )) & ( ( (tk(P41)) <= (tk(P58)) ) | ( ( 1 ) <= (tk(P237)) ) ) ) ) & ( ( 1 ) <= (tk(P18)) ) ) ) ) ) | ( (tk(P136)) <= ( 1 ) ) ) | ( ( (! ( (tk(P89)) <= ( 1 ) )) | ( (tk(P126)) <= (tk(P100)) ) ) & ( (! ( ( (tk(P67)) <= (tk(P118)) ) | (! ( (tk(P83)) <= ( 0 ) )) )) | ( (tk(P30)) <= (tk(P188)) ) ) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( ( ( 1 ) <= (tk(P19)) ) | ( ( (tk(P190)) <= (tk(P170)) ) & ( ( (! ( (tk(P126)) <= (tk(P149)) )) | ( ( ( 1 ) <= (tk(P219)) ) & ( (tk(P212)) <= ( 1 ) ) ) ) | ( ( (tk(P171)) <= (tk(P66)) ) | ( ( (tk(P51)) <= (tk(P202)) ) & ( (tk(P218)) <= (tk(P165)) ) ) ) ) ) ) | (! ( (tk(P200)) <= (tk(P130)) )) ) | ( ( (tk(P97)) <= (tk(P126)) ) & ( ( ( (! ( ( (tk(P256)) <= (tk(P176)) ) | ( ( 1 ) <= (tk(P194)) ) )) | ( (tk(P129)) <= ( 0 ) ) ) & (! ( ( (tk(P127)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P244)) ) & ( (tk(P193)) <= ( 0 ) ) ) )) ) & ( (tk(P80)) <= (tk(P238)) ) ) ) ) & ( (tk(P148)) <= ( 1 ) ) ) & ( ( ( (tk(P164)) <= (tk(P190)) ) | (! ( ( (! ( (tk(P235)) <= (tk(P110)) )) | ( (tk(P24)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P100)) ) )) ) | (! ( (tk(P252)) <= ( 1 ) )) ) )))
PROPERTY: StigmergyCommit-PT-06a-ReachabilityCardinality-15 (reachable & potential(( ( (! ( ( 1 ) <= (tk(P229)) )) | ( ( ( ( ( (! ( ( 1 ) <= (tk(P43)) )) | ( (! ( (tk(P154)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P142)) ) ) ) & (! ( (! ( (tk(P13)) <= (tk(P225)) )) | (! ( (tk(P81)) <= (tk(P157)) )) )) ) | ( ( ( ( (tk(P92)) <= (tk(P132)) ) | ( ( (tk(P222)) <= (tk(P46)) ) | ( (tk(P117)) <= (tk(P167)) ) ) ) & ( ( ( 1 ) <= (tk(P181)) ) | (! ( (tk(P15)) <= (tk(P138)) )) ) ) & ( ( ( ( (tk(P129)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P212)) ) ) & ( (tk(P102)) <= ( 0 ) ) ) & ( ( ( ( 1 ) <= (tk(P64)) ) & ( ( 1 ) <= (tk(P48)) ) ) & (! ( (tk(P252)) <= ( 0 ) )) ) ) ) ) | ( (tk(P222)) <= (tk(P251)) ) ) | (! ( ( (tk(P132)) <= ( 1 ) ) & ( ( ( ( (tk(P162)) <= (tk(P211)) ) | ( (tk(P101)) <= (tk(P124)) ) ) | ( ( (tk(P148)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P195)) ) ) ) & ( (tk(P152)) <= (tk(P13)) ) ) )) ) ) & ( ( 1 ) <= (tk(P101)) ) )))

BK_STOP 1679359081970

--------------------
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
terminate called after throwing an instance of 'sv_encoder::error'
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 611 Aborted ${SMART}/smart ${INPUT_SM}

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-06a"
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-06a, 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-167912651300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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