Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900526.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678731004711

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=BusinessProcesses-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:10:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:10:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:10:06] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-13 18:10:06] [INFO ] Transformed 518 places.
[2023-03-13 18:10:06] [INFO ] Transformed 471 transitions.
[2023-03-13 18:10:06] [INFO ] Found NUPN structural information;
[2023-03-13 18:10:06] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 11) seen :5
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-13 18:10:07] [INFO ] Computed 85 place invariants in 24 ms
[2023-03-13 18:10:07] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 18:10:07] [INFO ] [Nat]Absence check using 48 positive place invariants in 12 ms returned sat
[2023-03-13 18:10:07] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-13 18:10:07] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 8 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:10:08] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1614 ms
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-13 18:10:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-03-13 18:10:09] [INFO ] After 2298ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-13 18:10:10] [INFO ] After 2628ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 37 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 269 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 512 transition count 370
Reduce places removed 93 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 105 rules applied. Total rules applied 199 place count 419 transition count 358
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 211 place count 407 transition count 358
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 211 place count 407 transition count 290
Deduced a syphon composed of 68 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 357 place count 329 transition count 290
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 415 place count 271 transition count 232
Iterating global reduction 3 with 58 rules applied. Total rules applied 473 place count 271 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 473 place count 271 transition count 226
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 486 place count 264 transition count 226
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 614 place count 200 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 616 place count 199 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 618 place count 199 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 620 place count 197 transition count 163
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 623 place count 197 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 196 transition count 162
Applied a total of 624 rules in 147 ms. Remains 196 /518 variables (removed 322) and now considering 162/471 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 196/518 places, 162/471 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 196 cols
[2023-03-13 18:10:10] [INFO ] Computed 74 place invariants in 11 ms
[2023-03-13 18:10:10] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:10:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-13 18:10:10] [INFO ] [Nat]Absence check using 48 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-13 18:10:10] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:10:10] [INFO ] After 115ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 395 ms
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-13 18:10:11] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2023-03-13 18:10:12] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:10:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 676 ms
[2023-03-13 18:10:12] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-13 18:10:12] [INFO ] After 1574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 36 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 162/162 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 196 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 161
Applied a total of 2 rules in 23 ms. Remains 195 /196 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 195/196 places, 161/162 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 789423 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 789423 steps, saw 159170 distinct states, run finished after 3003 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 161 rows 195 cols
[2023-03-13 18:10:15] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-13 18:10:15] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:10:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2023-03-13 18:10:15] [INFO ] [Nat]Absence check using 46 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-13 18:10:15] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:10:15] [INFO ] After 64ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:15] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-13 18:10:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-13 18:10:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-13 18:10:16] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-13 18:10:16] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 36 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Applied a total of 0 rules in 18 ms. Remains 195 /195 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 195/195 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Applied a total of 0 rules in 16 ms. Remains 195 /195 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2023-03-13 18:10:16] [INFO ] Invariant cache hit.
[2023-03-13 18:10:16] [INFO ] Implicit Places using invariants in 172 ms returned [14, 16, 18, 33, 51, 53, 55, 62, 64, 66, 68, 141]
Discarding 12 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 174 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/195 places, 159/161 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 179 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 179 transition count 143
Applied a total of 8 rules in 12 ms. Remains 179 /183 variables (removed 4) and now considering 143/159 (removed 16) transitions.
// Phase 1: matrix 143 rows 179 cols
[2023-03-13 18:10:16] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-13 18:10:16] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-13 18:10:16] [INFO ] Invariant cache hit.
[2023-03-13 18:10:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:10:16] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [112, 118, 120]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 346 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/195 places, 143/161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 142
Applied a total of 2 rules in 12 ms. Remains 175 /176 variables (removed 1) and now considering 142/143 (removed 1) transitions.
// Phase 1: matrix 142 rows 175 cols
[2023-03-13 18:10:16] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-13 18:10:16] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-13 18:10:16] [INFO ] Invariant cache hit.
[2023-03-13 18:10:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:10:17] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 175/195 places, 142/161 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 859 ms. Remains : 175/195 places, 142/161 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 916564 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916564 steps, saw 193639 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 18:10:20] [INFO ] Invariant cache hit.
[2023-03-13 18:10:20] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:10:20] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-13 18:10:20] [INFO ] [Nat]Absence check using 41 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-13 18:10:20] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:10:20] [INFO ] After 60ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:20] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-13 18:10:20] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-13 18:10:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-13 18:10:20] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-13 18:10:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2023-03-13 18:10:20] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 18:10:20] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 36 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 142/142 transitions.
Applied a total of 0 rules in 13 ms. Remains 175 /175 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 175/175 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 175 /175 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-13 18:10:20] [INFO ] Invariant cache hit.
[2023-03-13 18:10:21] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-13 18:10:21] [INFO ] Invariant cache hit.
[2023-03-13 18:10:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:10:21] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-13 18:10:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 18:10:21] [INFO ] Invariant cache hit.
[2023-03-13 18:10:21] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 175/175 places, 142/142 transitions.
Graph (complete) has 506 edges and 175 vertex of which 173 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 170 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 170 transition count 138
Applied a total of 9 rules in 18 ms. Remains 170 /175 variables (removed 5) and now considering 138/142 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 138 rows 170 cols
[2023-03-13 18:10:21] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-13 18:10:21] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:10:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-13 18:10:21] [INFO ] [Nat]Absence check using 41 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 18:10:21] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 18:10:21] [INFO ] After 54ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-13 18:10:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-13 18:10:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-13 18:10:21] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-13 18:10:22] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-13 18:10:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-03-13 18:10:22] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-13 18:10:22] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:10:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 18:10:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 142 transitions and 645 arcs took 2 ms.
[2023-03-13 18:10:22] [INFO ] Flatten gal took : 45 ms
Total runtime 15976 ms.
There are residual formulas that ITS could not solve within timeout
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: BusinessProcesses_PT_10
(NrP: 175 NrTr: 142 NrArc: 645)

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

net check time: 0m 0.000sec

init dd package: 0m 2.945sec


RS generation: 0m 4.155sec


-> reachability set: #nodes 20806 (2.1e+04) #states 35,713,264,004 (10)



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

checking: AG [[[[[p85<=0 & 0<=p85] | [p1<=1 & 1<=p1]] | [[p54<=0 & 0<=p54] | [p128<=1 & 1<=p128]]] | [[[p69<=0 & 0<=p69] | [p6<=1 & 1<=p6]] | [[p32<=0 & 0<=p32] | [p117<=1 & 1<=p117]]]]]
normalized: ~ [E [true U ~ [[[[[p1<=1 & 1<=p1] | [p85<=0 & 0<=p85]] | [[p54<=0 & 0<=p54] | [p128<=1 & 1<=p128]]] | [[[p69<=0 & 0<=p69] | [p6<=1 & 1<=p6]] | [[p32<=0 & 0<=p32] | [p117<=1 & 1<=p117]]]]]]]

abstracting: (1<=p117)
states: 273,615,652 (8)
abstracting: (p117<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p32)
states: 35,713,264,004 (10)
abstracting: (p32<=0)
states: 34,342,993,673 (10)
abstracting: (1<=p6)
states: 953,302,931 (8)
abstracting: (p6<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p69)
states: 35,713,264,004 (10)
abstracting: (p69<=0)
states: 29,227,686,242 (10)
abstracting: (1<=p128)
states: 530,280,960 (8)
abstracting: (p128<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p54)
states: 35,713,264,004 (10)
abstracting: (p54<=0)
states: 17,760,050,267 (10)
abstracting: (0<=p85)
states: 35,713,264,004 (10)
abstracting: (p85<=0)
states: 18,818,434,052 (10)
abstracting: (1<=p1)
states: 95
abstracting: (p1<=1)
states: 35,713,264,004 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.830sec

checking: AG [[[p12<=1 & 1<=p12] | [[[[p151<=0 & 0<=p151] & [p138<=0 & 0<=p138]] & [[p159<=1 & 1<=p159] & [[[p27<=0 & 0<=p27] | [p141<=0 & 0<=p141]] | [[p61<=1 & 1<=p61] | [[[p126<=0 & 0<=p126] & [p167<=1 & 1<=p167]] | [[[p109<=0 & 0<=p109] | [p99<=1 & 1<=p99]] & [[[p63<=0 & 0<=p63] | [p79<=1 & 1<=p79]] & [[p43<=0 & 0<=p43] | [[p153<=0 & 0<=p153] & [p165<=1 & 1<=p165]]]]]]]]]] | [[[[p50<=1 & 1<=p50] | [p132<=0 & 0<=p132]] | [[p32<=1 & 1<=p32] | [p28<=0 & 0<=p28]]] & [[[p52<=0 & 0<=p52] | [[p139<=1 & 1<=p139] | [p91<=0 & 0<=p91]]] | [[[p58<=1 & 1<=p58] | [p4<=1 & 1<=p4]] | [[[p39<=0 & 0<=p39] & [[p129<=0 & 0<=p129] & [p123<=1 & 1<=p123]]] | [[p16<=0 & 0<=p16] & [p85<=0 & 0<=p85]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p123<=1 & 1<=p123] & [p129<=0 & 0<=p129]] & [p39<=0 & 0<=p39]] | [[p85<=0 & 0<=p85] & [p16<=0 & 0<=p16]]] | [[p4<=1 & 1<=p4] | [p58<=1 & 1<=p58]]] | [[[p91<=0 & 0<=p91] | [p139<=1 & 1<=p139]] | [p52<=0 & 0<=p52]]] & [[[p28<=0 & 0<=p28] | [p32<=1 & 1<=p32]] | [[p132<=0 & 0<=p132] | [p50<=1 & 1<=p50]]]] | [[[[[[[[[[p165<=1 & 1<=p165] & [p153<=0 & 0<=p153]] | [p43<=0 & 0<=p43]] & [[p79<=1 & 1<=p79] | [p63<=0 & 0<=p63]]] & [[p99<=1 & 1<=p99] | [p109<=0 & 0<=p109]]] | [[p167<=1 & 1<=p167] & [p126<=0 & 0<=p126]]] | [p61<=1 & 1<=p61]] | [[p141<=0 & 0<=p141] | [p27<=0 & 0<=p27]]] & [p159<=1 & 1<=p159]] & [[p138<=0 & 0<=p138] & [p151<=0 & 0<=p151]]]] | [p12<=1 & 1<=p12]]]]]

abstracting: (1<=p12)
states: 861,020,160 (8)
abstracting: (p12<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p151)
states: 35,713,264,004 (10)
abstracting: (p151<=0)
states: 34,488,258,404 (10)
abstracting: (0<=p138)
states: 35,713,264,004 (10)
abstracting: (p138<=0)
states: 35,665,072,452 (10)
abstracting: (1<=p159)
states: 192,766,208 (8)
abstracting: (p159<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p27)
states: 35,713,264,004 (10)
abstracting: (p27<=0)
states: 34,206,871,844 (10)
abstracting: (0<=p141)
states: 35,713,264,004 (10)
abstracting: (p141<=0)
states: 35,665,072,452 (10)
abstracting: (1<=p61)
states: 12,506 (4)
abstracting: (p61<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p126)
states: 35,713,264,004 (10)
abstracting: (p126<=0)
states: 34,421,733,764 (10)
abstracting: (1<=p167)
states: 96,383,104 (7)
abstracting: (p167<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p109)
states: 35,713,264,004 (10)
abstracting: (p109<=0)
states: 18,541,828,877 (10)
abstracting: (1<=p99)
states: 10,326,906 (7)
abstracting: (p99<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p63)
states: 35,713,264,004 (10)
abstracting: (p63<=0)
states: 35,692,810,790 (10)
abstracting: (1<=p79)
states: 5,862,164,602 (9)
abstracting: (p79<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p43)
states: 35,713,264,004 (10)
abstracting: (p43<=0)
states: 35,665,072,452 (10)
abstracting: (0<=p153)
states: 35,713,264,004 (10)
abstracting: (p153<=0)
states: 33,123,389,444 (10)
abstracting: (1<=p165)
states: 192,766,208 (8)
abstracting: (p165<=1)
states: 35,713,264,004 (10)
abstracting: (1<=p50)
states: 6,098,582,368 (9)
abstracting: (p50<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p132)
states: 35,713,264,004 (10)
abstracting: (p132<=0)
states: 34,388,171,828 (10)
abstracting: (1<=p32)
states: 1,370,270,331 (9)
abstracting: (p32<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p28)
states: 35,713,264,004 (10)
abstracting: (p28<=0)
states: 24,370,341,788 (10)
abstracting: (0<=p52)
states: 35,713,264,004 (10)
abstracting: (p52<=0)
states: 35,568,689,348 (10)
abstracting: (1<=p139)
states: 48,191,552 (7)
abstracting: (p139<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p91)
states: 35,713,264,004 (10)
abstracting: (p91<=0)
states: 35,602,892,240 (10)
abstracting: (1<=p58)
states: 17,822,429,950 (10)
abstracting: (p58<=1)
states: 35,713,264,004 (10)
abstracting: (1<=p4)
states: 59,119 (4)
abstracting: (p4<=1)
states: 35,713,264,004 (10)
abstracting: (0<=p16)
states: 35,713,264,004 (10)
abstracting: (p16<=0)
states: 18,598,854,524 (10)
abstracting: (0<=p85)
states: 35,713,264,004 (10)
abstracting: (p85<=0)
states: 18,818,434,052 (10)
abstracting: (0<=p39)
states: 35,713,264,004 (10)
abstracting: (p39<=0)
states: 22,747,079,012 (10)
abstracting: (0<=p129)
states: 35,713,264,004 (10)
abstracting: (p129<=0)
states: 34,833,461,444 (10)
abstracting: (1<=p123)
states: 1,335,559,680 (9)
abstracting: (p123<=1)
states: 35,713,264,004 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.099sec

totally nodes used: 4090876 (4.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5514183 26510510 32024693
used/not used/entry size/cache size: 24348138 42760726 16 1024MB
basic ops cache: hits/miss/sum: 679668 4305206 4984874
used/not used/entry size/cache size: 6112427 10664789 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: 18239 128156 146395
used/not used/entry size/cache size: 127410 8261198 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 63768614
1 2741091
2 472838
3 104678
4 18538
5 2744
6 326
7 33
8 2
9 0
>= 10 0

Total processing time: 0m13.470sec


BK_STOP 1678731036042

--------------------
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.000sec

18632
iterations count:135770 (956), effective:6969 (49)

initing FirstDep: 0m 0.000sec


iterations count:6105 (42), effective:300 (2)

iterations count:11272 (79), effective:584 (4)

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="BusinessProcesses-PT-10"
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 BusinessProcesses-PT-10, 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 r042-tajo-167813695900526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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