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.r458-smll-167912650200406.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 marciexred
Input is StigmergyCommit-PT-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650200406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 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 231K 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-02b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679442372880

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 23:46:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:46:17] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-03-21 23:46:17] [INFO ] Transformed 928 places.
[2023-03-21 23:46:17] [INFO ] Transformed 1040 transitions.
[2023-03-21 23:46:17] [INFO ] Found NUPN structural information;
[2023-03-21 23:46:17] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 163 resets, run finished after 1178 ms. (steps per millisecond=8 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1040 rows 928 cols
[2023-03-21 23:46:20] [INFO ] Computed 4 place invariants in 27 ms
[2023-03-21 23:46:21] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 23:46:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-21 23:46:23] [INFO ] After 1261ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-21 23:46:24] [INFO ] Deduced a trap composed of 401 places in 639 ms of which 14 ms to minimize.
[2023-03-21 23:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 770 ms
[2023-03-21 23:46:25] [INFO ] Deduced a trap composed of 396 places in 417 ms of which 2 ms to minimize.
[2023-03-21 23:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 554 ms
[2023-03-21 23:46:26] [INFO ] Deduced a trap composed of 397 places in 618 ms of which 2 ms to minimize.
[2023-03-21 23:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2023-03-21 23:46:26] [INFO ] After 4226ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-21 23:46:27] [INFO ] After 5828ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 81 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 750 edges and 928 vertex of which 36 / 928 are part of one of the 7 SCC in 7 ms
Free SCC test removed 29 places
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 1205 edges and 899 vertex of which 894 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 894 transition count 478
Reduce places removed 521 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 526 rules applied. Total rules applied 1051 place count 373 transition count 473
Reduce places removed 2 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 58 rules applied. Total rules applied 1109 place count 371 transition count 417
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 1165 place count 315 transition count 417
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1165 place count 315 transition count 379
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1241 place count 277 transition count 379
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1274 place count 244 transition count 346
Iterating global reduction 4 with 33 rules applied. Total rules applied 1307 place count 244 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1308 place count 244 transition count 345
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1308 place count 244 transition count 343
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1312 place count 242 transition count 343
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1321 place count 233 transition count 300
Iterating global reduction 5 with 9 rules applied. Total rules applied 1330 place count 233 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1331 place count 232 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 1332 place count 232 transition count 299
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1333 place count 231 transition count 298
Iterating global reduction 5 with 1 rules applied. Total rules applied 1334 place count 231 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1335 place count 231 transition count 297
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1363 place count 217 transition count 283
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1366 place count 214 transition count 280
Iterating global reduction 6 with 3 rules applied. Total rules applied 1369 place count 214 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
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 1381 place count 208 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1383 place count 208 transition count 303
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1386 place count 208 transition count 300
Free-agglomeration rule applied 22 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1408 place count 208 transition count 276
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1432 place count 186 transition count 274
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1433 place count 186 transition count 273
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1435 place count 186 transition count 273
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1436 place count 186 transition count 272
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1437 place count 186 transition count 272
Applied a total of 1437 rules in 272 ms. Remains 186 /928 variables (removed 742) and now considering 272/1040 (removed 768) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 186/928 places, 272/1040 transitions.
Incomplete random walk after 10000 steps, including 913 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 9) seen :3
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 272 rows 186 cols
[2023-03-21 23:46:28] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-21 23:46:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 23:46:28] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:46:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-21 23:46:29] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:46:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-21 23:46:29] [INFO ] After 87ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:46:29] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2023-03-21 23:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-21 23:46:29] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-21 23:46:29] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 12208 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyCommit_PT_02b
(NrP: 928 NrTr: 1040 NrArc: 2439)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.114sec

net check time: 0m 0.000sec

init dd package: 0m 3.727sec


RS generation: 1m 9.626sec


-> reachability set: #nodes 35376 (3.5e+04) #states 192,124,708 (8)



starting MCC model checker
--------------------------

checking: AG [p886<=0]
normalized: ~ [E [true U ~ [p886<=0]]]

abstracting: (p886<=0)
states: 191,834,390 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.676sec

checking: EF [1<=p531]
normalized: E [true U 1<=p531]

abstracting: (1<=p531)
states: 576,926 (5)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.949sec

checking: EF [1<=p735]
normalized: E [true U 1<=p735]

abstracting: (1<=p735)
states: 1,031,865 (6)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.876sec

checking: AG [p749<=0]
normalized: ~ [E [true U ~ [p749<=0]]]

abstracting: (p749<=0)
states: 191,547,782 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.965sec

checking: AG [p894<=p826]
normalized: ~ [E [true U ~ [p894<=p826]]]

abstracting: (p894<=p826)
states: 191,834,390 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.461sec

checking: EF [~ [[p273<=1 | ~ [1<=p907]]]]
normalized: E [true U ~ [[p273<=1 | ~ [1<=p907]]]]

abstracting: (1<=p907)
states: 315,428 (5)
abstracting: (p273<=1)
states: 192,124,708 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AG [[p839<=0 | p137<=1]]
normalized: ~ [E [true U ~ [[p839<=0 | p137<=1]]]]

abstracting: (p137<=1)
states: 192,124,708 (8)
abstracting: (p839<=0)
states: 191,426,102 (8)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [~ [p527<=p420]]
normalized: E [true U ~ [p527<=p420]]

abstracting: (p527<=p420)
states: 191,547,782 (8)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.374sec

checking: EF [~ [[p796<=p750 | p747<=1]]]
normalized: E [true U ~ [[p796<=p750 | p747<=1]]]

abstracting: (p747<=1)
states: 192,124,708 (8)
abstracting: (p796<=p750)
states: 191,547,782 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [~ [[[[[1<=p881 & ~ [1<=p338]] | 1<=p647] | ~ [[[1<=p856 | [p218<=0 & p583<=1]] | [~ [1<=p832] | ~ [p71<=1]]]]] & 1<=p292]]]
normalized: ~ [E [true U [1<=p292 & [~ [[[~ [p71<=1] | ~ [1<=p832]] | [1<=p856 | [p218<=0 & p583<=1]]]] | [1<=p647 | [1<=p881 & ~ [1<=p338]]]]]]]

abstracting: (1<=p338)
states: 1,031,849 (6)
abstracting: (1<=p881)
states: 290,318 (5)
abstracting: (1<=p647)
states: 1,031,865 (6)
abstracting: (p583<=1)
states: 192,124,708 (8)
abstracting: (p218<=0)
states: 191,547,782 (8)
abstracting: (1<=p856)
states: 698,606 (5)
abstracting: (1<=p832)
states: 576,926 (5)
abstracting: (p71<=1)
states: 192,124,708 (8)
abstracting: (1<=p292)
states: 315,414 (5)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.570sec

checking: EF [[1<=p417 & [[1<=p352 & 1<=p5] & [[~ [[p765<=p584 & ~ [[[1<=p481 | 1<=p313] | ~ [p648<=p793]]]]] | p224<=p380] | ~ [1<=p392]]]]]
normalized: E [true U [1<=p417 & [[~ [1<=p392] | [p224<=p380 | ~ [[p765<=p584 & ~ [[~ [p648<=p793] | [1<=p481 | 1<=p313]]]]]]] & [1<=p352 & 1<=p5]]]]

abstracting: (1<=p5)
states: 205,335 (5)
abstracting: (1<=p352)
states: 1,031,849 (6)
abstracting: (1<=p313)
states: 205,335 (5)
abstracting: (1<=p481)
states: 576,926 (5)
abstracting: (p648<=p793)
states: 191,092,843 (8)
abstracting: (p765<=p584)
states: 191,426,102 (8)
abstracting: (p224<=p380)
states: 191,547,782 (8)
abstracting: (1<=p392)
states: 194,940 (5)
abstracting: (1<=p417)
states: 1,031,849 (6)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

checking: EF [[1<=p915 & ~ [[[[[~ [[[p920<=p76 & 1<=p812] | [1<=p177 & 1<=p699]]] | ~ [[p726<=p709 & p313<=p614]]] | [1<=p655 | p715<=p531]] | p358<=p394] | ~ [[1<=p787 | [p501<=p311 | p752<=p598]]]]]]]
normalized: E [true U [1<=p915 & ~ [[~ [[1<=p787 | [p501<=p311 | p752<=p598]]] | [p358<=p394 | [[1<=p655 | p715<=p531] | [~ [[p726<=p709 & p313<=p614]] | ~ [[[1<=p177 & 1<=p699] | [p920<=p76 & 1<=p812]]]]]]]]]]

abstracting: (1<=p812)
states: 698,606 (5)
abstracting: (p920<=p76)
states: 180,039,055 (8)
abstracting: (1<=p699)
states: 1,031,865 (6)
abstracting: (1<=p177)
states: 576,926 (5)
abstracting: (p313<=p614)
states: 191,921,128 (8)
abstracting: (p726<=p709)
states: 191,092,843 (8)
abstracting: (p715<=p531)
states: 191,095,685 (8)
abstracting: (1<=p655)
states: 1,031,865 (6)
abstracting: (p358<=p394)
states: 191,092,859 (8)
abstracting: (p752<=p598)
states: 191,547,782 (8)
abstracting: (p501<=p311)
states: 191,547,782 (8)
abstracting: (1<=p787)
states: 698,606 (5)
abstracting: (1<=p915)
states: 12,098,649 (7)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.241sec

checking: EF [~ [[~ [[[[p84<=1 | 1<=p820] | [1<=p823 | p53<=0]] & [[1<=p712 | 1<=p282] | p537<=p352]]] | ~ [[[~ [[p457<=p748 | [p66<=p486 & 1<=p687]]] & [p836<=p689 | [[p791<=p259 | p611<=p386] & [1<=p839 & p637<=0]]]] & ~ [[p423<=0 & [~ [p539<=0] & 1<=p434]]]]]]]]
normalized: E [true U ~ [[~ [[~ [[p423<=0 & [1<=p434 & ~ [p539<=0]]]] & [[p836<=p689 | [[1<=p839 & p637<=0] & [p791<=p259 | p611<=p386]]] & ~ [[p457<=p748 | [p66<=p486 & 1<=p687]]]]]] | ~ [[[p537<=p352 | [1<=p712 | 1<=p282]] & [[1<=p823 | p53<=0] | [p84<=1 | 1<=p820]]]]]]]

abstracting: (1<=p820)
states: 698,606 (5)
abstracting: (p84<=1)
states: 192,124,708 (8)
abstracting: (p53<=0)
states: 191,092,859 (8)
abstracting: (1<=p823)
states: 576,926 (5)
abstracting: (1<=p282)
states: 290,304 (5)
abstracting: (1<=p712)
states: 1,031,865 (6)
abstracting: (p537<=p352)
states: 191,426,102 (8)
abstracting: (1<=p687)
states: 194,940 (5)
abstracting: (p66<=p486)
states: 191,096,481 (8)
abstracting: (p457<=p748)
states: 191,429,724 (8)
abstracting: (p611<=p386)
states: 191,919,373 (8)
abstracting: (p791<=p259)
states: 191,547,782 (8)
abstracting: (p637<=0)
states: 191,092,843 (8)
abstracting: (1<=p839)
states: 698,606 (5)
abstracting: (p836<=p689)
states: 191,426,102 (8)
abstracting: (p539<=0)
states: 191,426,102 (8)
abstracting: (1<=p434)
states: 1,031,849 (6)
abstracting: (p423<=0)
states: 191,092,859 (8)
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.682sec

checking: AG [[[~ [[1<=p625 | [~ [[1<=p465 & p13<=p650]] | [[[[p884<=p857 & p487<=1] & p319<=p916] | [[p883<=p230 & 1<=p460] & [p328<=p870 | p137<=0]]] | ~ [[p209<=0 | p855<=1]]]]]] & [p207<=p128 & p243<=1]] | [[~ [p262<=0] | p363<=0] | [p79<=p824 & [p355<=0 & p636<=1]]]]]
normalized: ~ [E [true U ~ [[[[p79<=p824 & [p355<=0 & p636<=1]] | [p363<=0 | ~ [p262<=0]]] | [[p207<=p128 & p243<=1] & ~ [[1<=p625 | [[~ [[p209<=0 | p855<=1]] | [[[p328<=p870 | p137<=0] & [p883<=p230 & 1<=p460]] | [p319<=p916 & [p884<=p857 & p487<=1]]]] | ~ [[1<=p465 & p13<=p650]]]]]]]]]]

abstracting: (p13<=p650)
states: 191,921,128 (8)
abstracting: (1<=p465)
states: 698,606 (5)
abstracting: (p487<=1)
states: 192,124,708 (8)
abstracting: (p884<=p857)
states: 191,834,390 (8)
abstracting: (p319<=p916)
states: 191,933,062 (8)
abstracting: (1<=p460)
states: 698,606 (5)
abstracting: (p883<=p230)
states: 191,834,390 (8)
abstracting: (p137<=0)
states: 191,892,904 (8)
abstracting: (p328<=p870)
states: 191,094,875 (8)
abstracting: (p855<=1)
states: 192,124,708 (8)
abstracting: (p209<=0)
states: 191,426,102 (8)
abstracting: (1<=p625)
states: 205,335 (5)
abstracting: (p243<=1)
states: 192,124,708 (8)
abstracting: (p207<=p128)
states: 191,426,102 (8)
abstracting: (p262<=0)
states: 191,834,404 (8)
abstracting: (p363<=0)
states: 191,092,859 (8)
abstracting: (p636<=1)
states: 192,124,708 (8)
abstracting: (p355<=0)
states: 191,092,859 (8)
abstracting: (p79<=p824)
states: 191,929,768 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.397sec

checking: AG [[[[~ [[[~ [[[p367<=p698 & p187<=p641] | [p390<=p815 | 1<=p658]]] & ~ [[~ [p312<=p847] & p553<=1]]] | [p40<=p105 | [1<=p759 & p478<=1]]]] | ~ [1<=p313]] | [[[~ [[[~ [p404<=1] & p440<=1] | [[p117<=0 | p293<=1] | ~ [p516<=p476]]]] | [~ [p206<=1] & [[p709<=p276 | ~ [1<=p866]] | [[p806<=0 | p375<=1] & ~ [1<=p727]]]]] | ~ [p732<=0]] & ~ [[p894<=p730 & [[~ [1<=p541] | p90<=0] & ~ [[p0<=p662 | p399<=0]]]]]]] & p841<=0]]
normalized: ~ [E [true U ~ [[p841<=0 & [[~ [[p894<=p730 & [~ [[p0<=p662 | p399<=0]] & [p90<=0 | ~ [1<=p541]]]]] & [~ [p732<=0] | [[[[~ [1<=p727] & [p806<=0 | p375<=1]] | [p709<=p276 | ~ [1<=p866]]] & ~ [p206<=1]] | ~ [[[~ [p516<=p476] | [p117<=0 | p293<=1]] | [p440<=1 & ~ [p404<=1]]]]]]] | [~ [1<=p313] | ~ [[[p40<=p105 | [1<=p759 & p478<=1]] | [~ [[p553<=1 & ~ [p312<=p847]]] & ~ [[[p390<=p815 | 1<=p658] | [p367<=p698 & p187<=p641]]]]]]]]]]]]

abstracting: (p187<=p641)
states: 191,550,624 (8)
abstracting: (p367<=p698)
states: 191,097,990 (8)
abstracting: (1<=p658)
states: 1,031,865 (6)
abstracting: (p390<=p815)
states: 191,929,768 (8)
abstracting: (p312<=p847)
states: 191,919,373 (8)
abstracting: (p553<=1)
states: 192,124,708 (8)
abstracting: (p478<=1)
states: 192,124,708 (8)
abstracting: (1<=p759)
states: 698,606 (5)
abstracting: (p40<=p105)
states: 191,092,859 (8)
abstracting: (1<=p313)
states: 205,335 (5)
abstracting: (p404<=1)
states: 192,124,708 (8)
abstracting: (p440<=1)
states: 192,124,708 (8)
abstracting: (p293<=1)
states: 192,124,708 (8)
abstracting: (p117<=0)
states: 191,092,859 (8)
abstracting: (p516<=p476)
states: 191,426,102 (8)
abstracting: (p206<=1)
states: 192,124,708 (8)
abstracting: (1<=p866)
states: 290,318 (5)
abstracting: (p709<=p276)
states: 191,094,859 (8)
abstracting: (p375<=1)
states: 192,124,708 (8)
abstracting: (p806<=0)
states: 191,426,102 (8)
abstracting: (1<=p727)
states: 1,031,865 (6)
abstracting: (p732<=0)
states: 191,092,843 (8)
abstracting: (1<=p541)
states: 698,606 (5)
abstracting: (p90<=0)
states: 191,929,768 (8)
abstracting: (p399<=0)
states: 191,092,859 (8)
abstracting: (p0<=p662)
states: 192,124,707 (8)
abstracting: (p894<=p730)
states: 191,834,390 (8)
abstracting: (p841<=0)
states: 191,426,102 (8)
-> the formula is FALSE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 6.153sec

checking: EF [[~ [[[~ [1<=p512] | [~ [p488<=0] & [~ [[~ [p475<=1] | [p320<=1 & p391<=0]]] & [[1<=p30 & [p867<=1 & p82<=p843]] | [~ [1<=p834] | ~ [1<=p493]]]]]] | ~ [[~ [p707<=p147] | [p51<=0 | [p644<=1 & [[1<=p469 & 1<=p658] | ~ [1<=p363]]]]]]]] & [[[[[~ [[[p620<=p171 | p543<=1] & [p848<=p846 | 1<=p273]]] & p535<=0] | ~ [p145<=0]] | [p432<=1 & [~ [1<=p692] | p563<=0]]] | [[1<=p921 & [p855<=0 | [1<=p430 | p670<=p256]]] & ~ [[[~ [[1<=p678 | 1<=p170]] & [~ [p252<=p6] & ~ [1<=p657]]] | ~ [[~ [p443<=p255] & [p240<=p23 | p873<=p587]]]]]]] | ~ [[[1<=p19 & ~ [[~ [[1<=p570 & p399<=0]] | p227<=1]]] & ~ [1<=p837]]]]]]
normalized: E [true U [[~ [[~ [1<=p837] & [1<=p19 & ~ [[p227<=1 | ~ [[1<=p570 & p399<=0]]]]]]] | [[~ [[~ [[[p240<=p23 | p873<=p587] & ~ [p443<=p255]]] | [[~ [1<=p657] & ~ [p252<=p6]] & ~ [[1<=p678 | 1<=p170]]]]] & [1<=p921 & [p855<=0 | [1<=p430 | p670<=p256]]]] | [[p432<=1 & [p563<=0 | ~ [1<=p692]]] | [~ [p145<=0] | [p535<=0 & ~ [[[p848<=p846 | 1<=p273] & [p620<=p171 | p543<=1]]]]]]]] & ~ [[~ [[[p51<=0 | [p644<=1 & [~ [1<=p363] | [1<=p469 & 1<=p658]]]] | ~ [p707<=p147]]] | [[[[[~ [1<=p493] | ~ [1<=p834]] | [1<=p30 & [p867<=1 & p82<=p843]]] & ~ [[[p320<=1 & p391<=0] | ~ [p475<=1]]]] & ~ [p488<=0]] | ~ [1<=p512]]]]]]

abstracting: (1<=p512)
states: 698,606 (5)
abstracting: (p488<=0)
states: 191,547,782 (8)
abstracting: (p475<=1)
states: 192,124,708 (8)
abstracting: (p391<=0)
states: 191,929,768 (8)
abstracting: (p320<=1)
states: 192,124,708 (8)
abstracting: (p82<=p843)
states: 191,929,768 (8)
abstracting: (p867<=1)
states: 192,124,708 (8)
abstracting: (1<=p30)
states: 1,031,849 (6)
abstracting: (1<=p834)
states: 576,926 (5)
abstracting: (1<=p493)
states: 576,926 (5)
abstracting: (p707<=p147)
states: 191,095,685 (8)
abstracting: (1<=p658)
states: 1,031,865 (6)
abstracting: (1<=p469)
states: 698,606 (5)
abstracting: (1<=p363)
states: 1,031,849 (6)
abstracting: (p644<=1)
states: 192,124,708 (8)
abstracting: (p51<=0)
states: 191,092,859 (8)
abstracting: (p543<=1)
states: 192,124,708 (8)
abstracting: (p620<=p171)
states: 191,919,373 (8)
abstracting: (1<=p273)
states: 290,304 (5)
abstracting: (p848<=p846)
states: 191,426,102 (8)
abstracting: (p535<=0)
states: 191,426,102 (8)
abstracting: (p145<=0)
states: 191,547,782 (8)
abstracting: (1<=p692)
states: 194,940 (5)
abstracting: (p563<=0)
states: 191,834,404 (8)
abstracting: (p432<=1)
states: 192,124,708 (8)
abstracting: (p670<=p256)
states: 191,094,859 (8)
abstracting: (1<=p430)
states: 1,031,849 (6)
abstracting: (p855<=0)
states: 191,092,843 (8)
abstracting: (1<=p921)
states: 12,098,649 (7)
abstracting: (1<=p170)
states: 698,606 (5)
abstracting: (1<=p678)
states: 194,940 (5)
abstracting: (p252<=p6)
states: 191,426,102 (8)
abstracting: (1<=p657)
states: 1,031,865 (6)
abstracting: (p443<=p255)
states: 191,426,102 (8)
abstracting: (p873<=p587)
states: 191,811,296 (8)
abstracting: (p240<=p23)
states: 191,426,102 (8)
abstracting: (p399<=0)
states: 191,092,859 (8)
abstracting: (1<=p570)
states: 315,414 (5)
abstracting: (p227<=1)
states: 192,124,708 (8)
abstracting: (1<=p19)
states: 205,335 (5)
abstracting: (1<=p837)
states: 698,606 (5)

before gc: list nodes free: 1532581

after gc: idd nodes used:566924, unused:63433076; list nodes free:284642520
-> the formula is TRUE

FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.292sec

totally nodes used: 72191294 (7.2e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 448134263 1365828938 1813963201
used/not used/entry size/cache size: 60439411 6669453 16 1024MB
basic ops cache: hits/miss/sum: 32684255 73919839 106604094
used/not used/entry size/cache size: 9701260 7075956 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 213914 519147 733061
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 59977073
1 5816671
2 1053768
3 217868
4 37712
5 5129
6 590
7 50
8 3
9 0
>= 10 0

Total processing time: 10m 9.148sec


BK_STOP 1679442999912

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.010sec

34755 32914 33989 32189 35877 38794 40091
iterations count:762012 (732), effective:22552 (21)

initing FirstDep: 0m 0.006sec


iterations count:1654 (1), effective:31 (0)
38901 41827 40242 47090 49156 46207 48133
iterations count:751311 (722), effective:18871 (18)
44364 44569 46833 46843 48104
iterations count:516215 (496), effective:13720 (13)
39627 41225 41183 46338 48627 47278 49724
iterations count:743415 (714), effective:18651 (17)

iterations count:1468 (1), effective:21 (0)
38903 41833 41081 46391 49291 49725 47704
iterations count:745517 (716), effective:18758 (18)

iterations count:3884 (3), effective:97 (0)
39262 41982 40559 49208 48355 48664 48657
iterations count:738180 (709), effective:18651 (17)
40423 43130 42648 43171 46320 46532 44292
iterations count:750243 (721), effective:18830 (18)
41936 43689 42211 49595 50957 48236
iterations count:680152 (653), effective:17749 (17)
39124 41740 40875 49670 48217 48526 48518
iterations count:737906 (709), effective:18568 (17)

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-02b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is StigmergyCommit-PT-02b, 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 r458-smll-167912650200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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