fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482400178
Last Updated
May 14, 2023

About the Execution of Marcie+red for DBSingleClientW-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5483.771 13711.00 21174.00 359.50 FFFFTTFTTTTFTTFF normal

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.r106-tall-167814482400178.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 DBSingleClientW-PT-d0m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m04-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678348957978

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:02:39] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-09 08:02:39] [INFO ] Transformed 553 places.
[2023-03-09 08:02:39] [INFO ] Transformed 150 transitions.
[2023-03-09 08:02:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
Support contains 60 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 94 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 94 transition count 131
Applied a total of 34 rules in 17 ms. Remains 94 /109 variables (removed 15) and now considering 131/150 (removed 19) transitions.
// Phase 1: matrix 131 rows 94 cols
[2023-03-09 08:02:39] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-09 08:02:40] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 08:02:40] [INFO ] Invariant cache hit.
[2023-03-09 08:02:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:02:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-09 08:02:40] [INFO ] Invariant cache hit.
[2023-03-09 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/109 places, 131/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 94/109 places, 131/150 transitions.
Support contains 60 out of 94 places after structural reductions.
[2023-03-09 08:02:40] [INFO ] Flatten gal took : 30 ms
[2023-03-09 08:02:40] [INFO ] Flatten gal took : 12 ms
[2023-03-09 08:02:40] [INFO ] Input system was already deterministic with 131 transitions.
Support contains 59 out of 94 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 50) seen :22
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-09 08:02:41] [INFO ] Invariant cache hit.
[2023-03-09 08:02:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:02:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 08:02:41] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:25
[2023-03-09 08:02:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:02:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:02:41] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :24
[2023-03-09 08:02:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 08:02:42] [INFO ] After 358ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :2 sat :24
[2023-03-09 08:02:42] [INFO ] After 821ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :24
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-09 08:02:43] [INFO ] After 1592ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :24
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 33 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 128
Applied a total of 6 rules in 14 ms. Remains 91 /94 variables (removed 3) and now considering 128/131 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 91/94 places, 128/131 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 119 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Probably explored full state space saw : 9758 states, properties seen :19
Probabilistic random walk after 23391 steps, saw 9758 distinct states, run finished after 157 ms. (steps per millisecond=148 ) properties seen :19
Explored full state space saw : 9846 states, properties seen :0
Exhaustive walk after 23479 steps, saw 9846 distinct states, run finished after 124 ms. (steps per millisecond=189 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 08:02:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-09 08:02:43] [INFO ] Flatten gal took : 9 ms
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 08:02:43] [INFO ] Flatten gal took : 8 ms
[2023-03-09 08:02:43] [INFO ] Input system was already deterministic with 131 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 315 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 77 transition count 96
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 77 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 77 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 67 transition count 81
Applied a total of 58 rules in 14 ms. Remains 67 /94 variables (removed 27) and now considering 81/131 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 67/94 places, 81/131 transitions.
[2023-03-09 08:02:43] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:43] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 81 transition count 108
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 81 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 74 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 74 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 73 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 73 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 73 transition count 98
Applied a total of 43 rules in 8 ms. Remains 73 /94 variables (removed 21) and now considering 98/131 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 73/94 places, 98/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 100
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 78 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 70 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 70 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 68 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 67 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 65 transition count 79
Applied a total of 64 rules in 15 ms. Remains 65 /94 variables (removed 29) and now considering 79/131 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 65/94 places, 79/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 77 transition count 97
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 60 transition count 68
Applied a total of 76 rules in 24 ms. Remains 60 /94 variables (removed 34) and now considering 68/131 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 60/94 places, 68/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2760 steps, run visited all 1 properties in 6 ms. (steps per millisecond=460 )
Probabilistic random walk after 2760 steps, saw 1296 distinct states, run finished after 6 ms. (steps per millisecond=460 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 96
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 63 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 60 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 60 transition count 68
Applied a total of 74 rules in 19 ms. Remains 60 /94 variables (removed 34) and now considering 68/131 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 60/94 places, 68/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 98
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 78 transition count 97
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 70 transition count 89
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 69 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 69 transition count 88
Applied a total of 51 rules in 7 ms. Remains 69 /94 variables (removed 25) and now considering 88/131 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 69/94 places, 88/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 79 transition count 101
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 79 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 79 transition count 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 72 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 72 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 71 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 71 transition count 90
Applied a total of 48 rules in 12 ms. Remains 71 /94 variables (removed 23) and now considering 90/131 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 71/94 places, 90/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 76 transition count 94
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 76 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 66 transition count 83
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 58 transition count 64
Applied a total of 80 rules in 18 ms. Remains 58 /94 variables (removed 36) and now considering 64/131 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 58/94 places, 64/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 77 transition count 96
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 68 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 66 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 64 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 63 transition count 75
Applied a total of 66 rules in 6 ms. Remains 63 /94 variables (removed 31) and now considering 75/131 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 63/94 places, 75/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 98
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 78 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 69 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 66 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 65 transition count 77
Applied a total of 63 rules in 16 ms. Remains 65 /94 variables (removed 29) and now considering 77/131 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 65/94 places, 77/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 77 transition count 97
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 77 transition count 96
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 67 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 63 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 63 transition count 74
Applied a total of 68 rules in 8 ms. Remains 63 /94 variables (removed 31) and now considering 74/131 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 63/94 places, 74/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 83 transition count 112
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 83 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 83 transition count 110
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 77 transition count 104
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 77 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 77 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 75 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 75 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 73 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 72 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 72 transition count 92
Applied a total of 50 rules in 8 ms. Remains 72 /94 variables (removed 22) and now considering 92/131 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 72/94 places, 92/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 77 transition count 95
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 77 transition count 94
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 68 transition count 85
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 63 transition count 73
Applied a total of 67 rules in 8 ms. Remains 63 /94 variables (removed 31) and now considering 73/131 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 63/94 places, 73/131 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:02:44] [INFO ] Input system was already deterministic with 73 transitions.
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:02:44] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:02:44] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-09 08:02:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 131 transitions and 512 arcs took 1 ms.
Total runtime 5017 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 94 NrTr: 131 NrArc: 512)

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

net check time: 0m 0.000sec

init dd package: 0m 2.733sec


RS generation: 0m 0.445sec


-> reachability set: #nodes 3701 (3.7e+03) #states 9,846 (3)



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

checking: EG [EF [AG [EF [[p8<=0 | p60<=0]]]]]
normalized: EG [E [true U ~ [E [true U ~ [E [true U [p8<=0 | p60<=0]]]]]]]

abstracting: (p60<=0)
states: 9,018 (3)
abstracting: (p8<=0)
states: 9,460 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.080sec

checking: EG [[EG [AF [[p21<=0 | p36<=0]]] | [p26<=0 | p36<=0]]]
normalized: EG [[[p26<=0 | p36<=0] | EG [~ [EG [~ [[p21<=0 | p36<=0]]]]]]]

abstracting: (p36<=0)
states: 5,392 (3)
abstracting: (p21<=0)
states: 9,519 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (p36<=0)
states: 5,392 (3)
abstracting: (p26<=0)
states: 9,519 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AG [[AF [[p1<=0 | p90<=0]] | [p25<=0 | p36<=0]]]
normalized: ~ [E [true U ~ [[[p25<=0 | p36<=0] | ~ [EG [~ [[p1<=0 | p90<=0]]]]]]]]

abstracting: (p90<=0)
states: 9,692 (3)
abstracting: (p1<=0)
states: 7,878 (3)
.....
EG iterations: 5
abstracting: (p36<=0)
states: 5,392 (3)
abstracting: (p25<=0)
states: 9,519 (3)
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [AF [[1<=p1 & 1<=p89]] U EX [[1<=p3 & 1<=p36]]]
normalized: E [~ [EG [~ [[1<=p1 & 1<=p89]]]] U EX [[1<=p3 & 1<=p36]]]

abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p3)
states: 1
.abstracting: (1<=p89)
states: 154
abstracting: (1<=p1)
states: 1,968 (3)
..
EG iterations: 2
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AX [[AF [EX [[1<=p1 & 1<=p85]]] & [AG [EX [[p1<=0 | p44<=0]]] | AF [[1<=p17 & 1<=p49]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[1<=p17 & 1<=p49]]]] | ~ [E [true U ~ [EX [[p1<=0 | p44<=0]]]]]] & ~ [EG [~ [EX [[1<=p1 & 1<=p85]]]]]]]]]

abstracting: (1<=p85)
states: 124
abstracting: (1<=p1)
states: 1,968 (3)
...
EG iterations: 2
abstracting: (p44<=0)
states: 9,243 (3)
abstracting: (p1<=0)
states: 7,878 (3)
.abstracting: (1<=p49)
states: 387
abstracting: (1<=p17)
states: 138
.
EG iterations: 1
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.194sec

checking: ~ [A [~ [[EX [AG [[1<=p1 & 1<=p41]]] | EG [[1<=p1 & 1<=p73]]]] U AG [AX [AG [[1<=p15 & 1<=p49]]]]]]
normalized: ~ [[~ [EG [E [true U EX [E [true U ~ [[1<=p15 & 1<=p49]]]]]]] & ~ [E [E [true U EX [E [true U ~ [[1<=p15 & 1<=p49]]]]] U [[EG [[1<=p1 & 1<=p73]] | EX [~ [E [true U ~ [[1<=p1 & 1<=p41]]]]]] & E [true U EX [E [true U ~ [[1<=p15 & 1<=p49]]]]]]]]]]

abstracting: (1<=p49)
states: 387
abstracting: (1<=p15)
states: 138
.abstracting: (1<=p41)
states: 1,658 (3)
abstracting: (1<=p1)
states: 1,968 (3)
.abstracting: (1<=p73)
states: 1,144 (3)
abstracting: (1<=p1)
states: 1,968 (3)
......
EG iterations: 6
abstracting: (1<=p49)
states: 387
abstracting: (1<=p15)
states: 138
.abstracting: (1<=p49)
states: 387
abstracting: (1<=p15)
states: 138
............
EG iterations: 11
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.246sec

checking: AX [EG [[EG [EF [[p1<=0 | p57<=0]]] & [[EF [[p10<=0 | p62<=0]] | p1<=0] | [p84<=0 | [1<=p1 & 1<=p58]]]]]]
normalized: ~ [EX [~ [EG [[[[p84<=0 | [1<=p1 & 1<=p58]] | [p1<=0 | E [true U [p10<=0 | p62<=0]]]] & EG [E [true U [p1<=0 | p57<=0]]]]]]]]

abstracting: (p57<=0)
states: 9,568 (3)
abstracting: (p1<=0)
states: 7,878 (3)

EG iterations: 0
abstracting: (p62<=0)
states: 9,042 (3)
abstracting: (p10<=0)
states: 9,460 (3)
abstracting: (p1<=0)
states: 7,878 (3)
abstracting: (1<=p58)
states: 325
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (p84<=0)
states: 9,692 (3)

EG iterations: 0
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [AG [[A [[AX [[1<=p1 & 1<=p92]] | AF [[1<=p55 & 1<=p31]]] U AG [[1<=p1 & 1<=p79]]] & [E [~ [[1<=p1 & 1<=p69]] U EF [[1<=p4 & 1<=p36]]] | AX [[p1<=0 | p53<=0]]]]]]
normalized: ~ [EG [E [true U ~ [[[~ [EX [~ [[p1<=0 | p53<=0]]]] | E [~ [[1<=p1 & 1<=p69]] U E [true U [1<=p4 & 1<=p36]]]] & [~ [EG [E [true U ~ [[1<=p1 & 1<=p79]]]]] & ~ [E [E [true U ~ [[1<=p1 & 1<=p79]]] U [~ [[~ [EG [~ [[1<=p55 & 1<=p31]]]] | ~ [EX [~ [[1<=p1 & 1<=p92]]]]]] & E [true U ~ [[1<=p1 & 1<=p79]]]]]]]]]]]]

abstracting: (1<=p79)
states: 124
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p92)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
.abstracting: (1<=p31)
states: 138
abstracting: (1<=p55)
states: 387
.
EG iterations: 1
abstracting: (1<=p79)
states: 124
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p79)
states: 124
abstracting: (1<=p1)
states: 1,968 (3)

EG iterations: 0
abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p4)
states: 656
abstracting: (1<=p69)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (p53<=0)
states: 9,243 (3)
abstracting: (p1<=0)
states: 7,878 (3)
.
EG iterations: 0
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.183sec

checking: [EF [EG [[[[EX [[1<=p33 & 1<=p50]] & EF [[1<=p1 & 1<=p46]]] & [1<=p16 & 1<=p54]] | [p1<=0 | p75<=0]]]] & EF [~ [A [AX [[1<=p1 & 1<=p37]] U [1<=p1 & 1<=p69]]]]]
normalized: [E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p69]]]] & ~ [E [~ [[1<=p1 & 1<=p69]] U [EX [~ [[1<=p1 & 1<=p37]]] & ~ [[1<=p1 & 1<=p69]]]]]]]] & E [true U EG [[[p1<=0 | p75<=0] | [[1<=p16 & 1<=p54] & [E [true U [1<=p1 & 1<=p46]] & EX [[1<=p33 & 1<=p50]]]]]]]]

abstracting: (1<=p50)
states: 387
abstracting: (1<=p33)
states: 138
.abstracting: (1<=p46)
states: 1,189 (3)
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p54)
states: 333
abstracting: (1<=p16)
states: 138
abstracting: (p75<=0)
states: 9,664 (3)
abstracting: (p1<=0)
states: 7,878 (3)
..
EG iterations: 2
abstracting: (1<=p69)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p37)
states: 2
abstracting: (1<=p1)
states: 1,968 (3)
.abstracting: (1<=p69)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p69)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: AG [[~ [A [[1<=p1 & 1<=p93] U [1<=p27 & 1<=p36]]] | [[[1<=p1 & 1<=p74] & [1<=p32 & 1<=p56]] | [[p1<=0 | p88<=0] & [p13<=0 | p64<=0]]]]]
normalized: ~ [E [true U ~ [[[[[p13<=0 | p64<=0] & [p1<=0 | p88<=0]] | [[1<=p32 & 1<=p56] & [1<=p1 & 1<=p74]]] | ~ [[~ [EG [~ [[1<=p27 & 1<=p36]]]] & ~ [E [~ [[1<=p27 & 1<=p36]] U [~ [[1<=p1 & 1<=p93]] & ~ [[1<=p27 & 1<=p36]]]]]]]]]]]

abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p27)
states: 327
abstracting: (1<=p93)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p27)
states: 327
abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p27)
states: 327
.
EG iterations: 1
abstracting: (1<=p74)
states: 182
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p56)
states: 387
abstracting: (1<=p32)
states: 138
abstracting: (p88<=0)
states: 9,692 (3)
abstracting: (p1<=0)
states: 7,878 (3)
abstracting: (p64<=0)
states: 9,668 (3)
abstracting: (p13<=0)
states: 9,699 (3)
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [[E [~ [[1<=p34 & 1<=p55]] U AF [[1<=p1 & 1<=p90]]] & AF [EX [[[p1<=0 | p58<=0] & [p33<=0 | p50<=0]]]]] & [AF [[1<=p1 & 1<=p75]] & EF [EX [~ [A [[1<=p1 & 1<=p57] U [1<=p2 & 1<=p86]]]]]]]
normalized: [[E [true U EX [~ [[~ [EG [~ [[1<=p2 & 1<=p86]]]] & ~ [E [~ [[1<=p2 & 1<=p86]] U [~ [[1<=p1 & 1<=p57]] & ~ [[1<=p2 & 1<=p86]]]]]]]]] & ~ [EG [~ [[1<=p1 & 1<=p75]]]]] & [~ [EG [~ [EX [[[p33<=0 | p50<=0] & [p1<=0 | p58<=0]]]]]] & E [~ [[1<=p34 & 1<=p55]] U ~ [EG [~ [[1<=p1 & 1<=p90]]]]]]]

abstracting: (1<=p90)
states: 154
abstracting: (1<=p1)
states: 1,968 (3)
..
EG iterations: 2
abstracting: (1<=p55)
states: 387
abstracting: (1<=p34)
states: 138
abstracting: (p58<=0)
states: 9,521 (3)
abstracting: (p1<=0)
states: 7,878 (3)
abstracting: (p50<=0)
states: 9,459 (3)
abstracting: (p33<=0)
states: 9,708 (3)
...
EG iterations: 2
abstracting: (1<=p75)
states: 182
abstracting: (1<=p1)
states: 1,968 (3)
..
EG iterations: 2
abstracting: (1<=p86)
states: 124
abstracting: (1<=p2)
states: 315
abstracting: (1<=p57)
states: 278
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p86)
states: 124
abstracting: (1<=p2)
states: 315
abstracting: (1<=p86)
states: 124
abstracting: (1<=p2)
states: 315
.
EG iterations: 1
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.209sec

checking: AX [[[E [AG [[[1<=p1 & 1<=p41] | [1<=p1 & 1<=p58]]] U [~ [EG [[1<=p1 & 1<=p78]]] | [1<=p5 & 1<=p36]]] & [p1<=0 | p48<=0]] & [[AX [AG [[1<=p1 & 1<=p47]]] | [AF [[1<=p1 & 1<=p83]] | [1<=p1 & 1<=p68]]] & [EF [EG [[1<=p1 & 1<=p81]]] | [1<=p1 & 1<=p57]]]]]
normalized: ~ [EX [~ [[[[[1<=p1 & 1<=p57] | E [true U EG [[1<=p1 & 1<=p81]]]] & [[[1<=p1 & 1<=p68] | ~ [EG [~ [[1<=p1 & 1<=p83]]]]] | ~ [EX [E [true U ~ [[1<=p1 & 1<=p47]]]]]]] & [[p1<=0 | p48<=0] & E [~ [E [true U ~ [[[1<=p1 & 1<=p58] | [1<=p1 & 1<=p41]]]]] U [[1<=p5 & 1<=p36] | ~ [EG [[1<=p1 & 1<=p78]]]]]]]]]]

abstracting: (1<=p78)
states: 124
abstracting: (1<=p1)
states: 1,968 (3)
.....
EG iterations: 5
abstracting: (1<=p36)
states: 4,454 (3)
abstracting: (1<=p5)
states: 135
abstracting: (1<=p41)
states: 1,658 (3)
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p58)
states: 325
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (p48<=0)
states: 9,243 (3)
abstracting: (p1<=0)
states: 7,878 (3)
abstracting: (1<=p47)
states: 628
abstracting: (1<=p1)
states: 1,968 (3)
.abstracting: (1<=p83)
states: 154
abstracting: (1<=p1)
states: 1,968 (3)
..
EG iterations: 2
abstracting: (1<=p68)
states: 499
abstracting: (1<=p1)
states: 1,968 (3)
abstracting: (1<=p81)
states: 154
abstracting: (1<=p1)
states: 1,968 (3)
.....
EG iterations: 5
abstracting: (1<=p57)
states: 278
abstracting: (1<=p1)
states: 1,968 (3)
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m04-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

totally nodes used: 787207 (7.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2081709 5408284 7489993
used/not used/entry size/cache size: 5947082 61161782 16 1024MB
basic ops cache: hits/miss/sum: 251572 665250 916822
used/not used/entry size/cache size: 1167704 15609512 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: 9039 29746 38785
used/not used/entry size/cache size: 29686 8358922 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 66383458
1 670709
2 48334
3 5725
4 559
5 70
6 6
7 0
8 1
9 1
>= 10 1

Total processing time: 0m 6.165sec


BK_STOP 1678348971689

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


iterations count:36466 (278), effective:889 (6)

initing FirstDep: 0m 0.000sec


iterations count:239 (1), effective:1 (0)

iterations count:131 (1), effective:0 (0)

iterations count:131 (1), effective:0 (0)

iterations count:3414 (26), effective:64 (0)

iterations count:187 (1), effective:1 (0)

iterations count:131 (1), effective:0 (0)

iterations count:868 (6), effective:20 (0)

iterations count:187 (1), effective:1 (0)

iterations count:131 (1), effective:0 (0)

iterations count:187 (1), effective:1 (0)

iterations count:131 (1), effective:0 (0)

iterations count:150 (1), effective:1 (0)

iterations count:256 (1), effective:1 (0)

iterations count:153 (1), effective:2 (0)

iterations count:153 (1), effective:2 (0)

iterations count:687 (5), effective:9 (0)

iterations count:153 (1), effective:2 (0)

iterations count:5377 (41), effective:107 (0)

iterations count:131 (1), effective:0 (0)

iterations count:131 (1), effective:0 (0)

iterations count:3569 (27), effective:64 (0)

iterations count:343 (2), effective:9 (0)

iterations count:132 (1), effective:1 (0)

iterations count:453 (3), effective:11 (0)

iterations count:292 (2), effective:9 (0)

iterations count:6666 (50), effective:133 (1)

iterations count:150 (1), effective:1 (0)

iterations count:131 (1), effective:0 (0)

iterations count:868 (6), effective:20 (0)

iterations count:131 (1), effective:0 (0)

iterations count:160 (1), effective:1 (0)

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="DBSingleClientW-PT-d0m04"
export BK_EXAMINATION="CTLFireability"
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 DBSingleClientW-PT-d0m04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482400178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m04.tgz
mv DBSingleClientW-PT-d0m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;