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.r105-tall-167814481000281.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 ltsminxred
Input is DBSingleClientW-PT-d1m10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 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 432K 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-d1m10-CTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678269772983

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 10:02:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 10:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:02:54] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-08 10:02:54] [INFO ] Transformed 1440 places.
[2023-03-08 10:02:54] [INFO ] Transformed 672 transitions.
[2023-03-08 10:02:54] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 328 transition count 596
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 182 place count 241 transition count 363
Iterating global reduction 1 with 87 rules applied. Total rules applied 269 place count 241 transition count 363
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 273 place count 241 transition count 359
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 341 place count 173 transition count 291
Iterating global reduction 2 with 68 rules applied. Total rules applied 409 place count 173 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 413 place count 173 transition count 287
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 448 place count 138 transition count 233
Iterating global reduction 3 with 35 rules applied. Total rules applied 483 place count 138 transition count 233
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 509 place count 138 transition count 207
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 518 place count 129 transition count 191
Iterating global reduction 4 with 9 rules applied. Total rules applied 527 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 528 place count 129 transition count 190
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 534 place count 123 transition count 184
Iterating global reduction 5 with 6 rules applied. Total rules applied 540 place count 123 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 541 place count 123 transition count 183
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 546 place count 118 transition count 178
Iterating global reduction 6 with 5 rules applied. Total rules applied 551 place count 118 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 553 place count 118 transition count 176
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 554 place count 117 transition count 174
Iterating global reduction 7 with 1 rules applied. Total rules applied 555 place count 117 transition count 174
Applied a total of 555 rules in 262 ms. Remains 117 /347 variables (removed 230) and now considering 174/672 (removed 498) transitions.
// Phase 1: matrix 174 rows 117 cols
[2023-03-08 10:02:55] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 10:02:55] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-08 10:02:55] [INFO ] Invariant cache hit.
[2023-03-08 10:02:55] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 10:02:55] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-03-08 10:02:55] [INFO ] Invariant cache hit.
[2023-03-08 10:02:55] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/347 places, 174/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 117/347 places, 174/672 transitions.
Support contains 17 out of 117 places after structural reductions.
[2023-03-08 10:02:55] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-08 10:02:55] [INFO ] Flatten gal took : 38 ms
[2023-03-08 10:02:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 10:02:55] [INFO ] Flatten gal took : 18 ms
[2023-03-08 10:02:55] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 11 out of 117 places (down from 17) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 989 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 10:02:57] [INFO ] Invariant cache hit.
[2023-03-08 10:02:57] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 10:02:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 10:02:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 10:02:57] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-08 10:02:57] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 10:02:57] [INFO ] After 51ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2023-03-08 10:02:57] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-08 10:02:57] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 174/174 transitions.
Graph (complete) has 382 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 115 transition count 170
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 106 transition count 151
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 106 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 106 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 100 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 100 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 100 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 99 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 99 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 98 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 98 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 97 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 96 transition count 131
Applied a total of 49 rules in 40 ms. Remains 96 /117 variables (removed 21) and now considering 131/174 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 96/117 places, 131/174 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2267519 steps, run timeout after 3001 ms. (steps per millisecond=755 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 2267519 steps, saw 844082 distinct states, run finished after 3002 ms. (steps per millisecond=755 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 131 rows 96 cols
[2023-03-08 10:03:01] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 10:03:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:03:01] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:03:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:03:01] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:03:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 10:03:01] [INFO ] After 14ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:03:01] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:03:01] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 131/131 transitions.
Graph (complete) has 308 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 130
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 92 transition count 126
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 92 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 92 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 90 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 90 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 90 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 88 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 88 transition count 111
Applied a total of 20 rules in 17 ms. Remains 88 /96 variables (removed 8) and now considering 111/131 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 88/96 places, 111/131 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 979 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2826669 steps, run timeout after 3001 ms. (steps per millisecond=941 ) properties seen :{}
Probabilistic random walk after 2826669 steps, saw 1083308 distinct states, run finished after 3001 ms. (steps per millisecond=941 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 88 cols
[2023-03-08 10:03:04] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 10:03:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:03:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:03:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:03:04] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:03:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 10:03:04] [INFO ] After 15ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:03:04] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:03:04] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/88 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-03-08 10:03:04] [INFO ] Invariant cache hit.
[2023-03-08 10:03:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 10:03:04] [INFO ] Invariant cache hit.
[2023-03-08 10:03:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 10:03:04] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 10:03:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:03:04] [INFO ] Invariant cache hit.
[2023-03-08 10:03:05] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 88/88 places, 111/111 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 88 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 86 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 86 transition count 94
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 77 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 76 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 76 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 75 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 75 transition count 92
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 2 with 6 rules applied. Total rules applied 38 place count 72 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 70 transition count 125
Applied a total of 42 rules in 19 ms. Remains 70 /88 variables (removed 18) and now considering 125/111 (removed -14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 70 cols
[2023-03-08 10:03:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:03:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:03:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:03:05] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:03:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:03:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-08 10:03:05] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:03:05] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:03:05] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 10 ms
[2023-03-08 10:03:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 10 ms
[2023-03-08 10:03:05] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 1 out of 117 places (down from 6) after GAL structural reductions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 414 edges and 117 vertex of which 114 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 174/174 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 103 transition count 149
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 103 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 103 transition count 146
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 96 transition count 136
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 96 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 96 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 94 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 94 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 92 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 92 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 92 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 91 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 90 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 89 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 89 transition count 113
Applied a total of 66 rules in 11 ms. Remains 89 /117 variables (removed 28) and now considering 113/174 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 89/117 places, 113/174 transitions.
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 174/174 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 17 place count 102 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 30 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 102 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 94 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 94 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 91 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 91 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 88 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 88 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 88 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 86 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 84 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 83 transition count 101
Applied a total of 79 rules in 12 ms. Remains 83 /117 variables (removed 34) and now considering 101/174 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 83/117 places, 101/174 transitions.
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 174/174 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 17 place count 102 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 30 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 102 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 94 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 94 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 94 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 91 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 91 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 88 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 88 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 88 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 86 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 84 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 83 transition count 101
Applied a total of 79 rules in 11 ms. Remains 83 /117 variables (removed 34) and now considering 101/174 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 83/117 places, 101/174 transitions.
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 6 ms
[2023-03-08 10:03:05] [INFO ] Input system was already deterministic with 101 transitions.
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 10 ms
[2023-03-08 10:03:05] [INFO ] Flatten gal took : 10 ms
[2023-03-08 10:03:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-08 10:03:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 174 transitions and 684 arcs took 2 ms.
Total runtime 10905 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/504/ctl_0_ --ctl=/tmp/504/ctl_1_ --ctl=/tmp/504/ctl_2_ --mu-par --mu-opt
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678270038012

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name DBSingleClientW-PT-d1m10-CTLCardinality-07
ctl formula formula --ctl=/tmp/504/ctl_0_
ctl formula name DBSingleClientW-PT-d1m10-CTLCardinality-11
ctl formula formula --ctl=/tmp/504/ctl_1_
ctl formula name DBSingleClientW-PT-d1m10-CTLCardinality-12
ctl formula formula --ctl=/tmp/504/ctl_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 117 places, 174 transitions and 684 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 174->165 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 117; there are 165 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 23448407 group checks and 0 next state calls
pnml2lts-sym: reachability took 216.170 real 863.750 user 0.230 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.040 real 0.130 user 0.000 sys
pnml2lts-sym: state space has 2254850001 states, 214201 nodes
pnml2lts-sym: Formula /tmp/504/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/504/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/504/ctl_0_ does not hold for the initial state
pnml2lts-sym: group_next: 3974 nodes total
pnml2lts-sym: group_explored: 4883 nodes, 6498 short vectors total
pnml2lts-sym: max token count: 10

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-d1m10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d1m10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481000281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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