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.r138-smll-167819420800457.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 DoubleExponent-PT-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420800457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678840479661

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:34:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 00:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:34:42] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-15 00:34:42] [INFO ] Transformed 163 places.
[2023-03-15 00:34:42] [INFO ] Transformed 148 transitions.
[2023-03-15 00:34:42] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 107 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 148
Applied a total of 1 rules in 26 ms. Remains 162 /163 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 162 cols
[2023-03-15 00:34:42] [INFO ] Computed 18 place invariants in 31 ms
[2023-03-15 00:34:43] [INFO ] Implicit Places using invariants in 428 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 472 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/163 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 161/163 places, 148/148 transitions.
Support contains 107 out of 161 places after structural reductions.
[2023-03-15 00:34:43] [INFO ] Flatten gal took : 195 ms
[2023-03-15 00:34:43] [INFO ] Flatten gal took : 47 ms
[2023-03-15 00:34:43] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 1434 ms. (steps per millisecond=6 ) properties (out of 95) seen :26
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 111 ms. (steps per millisecond=9 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 69) seen :0
Running SMT prover for 69 properties.
// Phase 1: matrix 148 rows 161 cols
[2023-03-15 00:34:48] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-15 00:34:49] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-15 00:34:49] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 00:34:49] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:68
[2023-03-15 00:34:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-15 00:34:50] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 00:34:51] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :21 sat :48
[2023-03-15 00:34:51] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 13 ms to minimize.
[2023-03-15 00:34:51] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2023-03-15 00:34:51] [INFO ] Deduced a trap composed of 37 places in 593 ms of which 32 ms to minimize.
[2023-03-15 00:34:52] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 3 ms to minimize.
[2023-03-15 00:34:52] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 37 ms to minimize.
[2023-03-15 00:34:53] [INFO ] Deduced a trap composed of 68 places in 1289 ms of which 1 ms to minimize.
[2023-03-15 00:34:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2537 ms
[2023-03-15 00:34:53] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2023-03-15 00:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 120 ms
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 409 ms
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2023-03-15 00:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 00:34:54] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 0 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 607 ms
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 0 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 0 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2023-03-15 00:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-15 00:34:55] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 0 ms to minimize.
[2023-03-15 00:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-15 00:34:56] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 0 ms to minimize.
[2023-03-15 00:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-15 00:34:56] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2023-03-15 00:34:56] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2023-03-15 00:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-15 00:34:56] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-15 00:34:56] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-15 00:34:57] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-15 00:34:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-03-15 00:34:57] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2023-03-15 00:34:57] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2023-03-15 00:34:57] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 5 ms to minimize.
[2023-03-15 00:34:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-15 00:34:57] [INFO ] After 7182ms SMT Verify possible using trap constraints in natural domain returned unsat :23 sat :46
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-15 00:34:58] [INFO ] After 8726ms SMT Verify possible using all constraints in natural domain returned unsat :23 sat :46
Fused 69 Parikh solutions to 45 different solutions.
Parikh walk visited 0 properties in 1179 ms.
Support contains 66 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 160 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 154 transition count 139
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 151 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 19 place count 151 transition count 135
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 147 transition count 135
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 138 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 137 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 137 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 135 transition count 124
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 135 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 63 place count 129 transition count 118
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 129 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 128 transition count 117
Applied a total of 68 rules in 71 ms. Remains 128 /161 variables (removed 33) and now considering 117/148 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 128/161 places, 117/148 transitions.
Incomplete random walk after 10000 steps, including 809 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 46) seen :10
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 117 rows 128 cols
[2023-03-15 00:35:01] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-15 00:35:01] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-15 00:35:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 00:35:01] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 13 ms returned sat
[2023-03-15 00:35:02] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-15 00:35:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 00:35:02] [INFO ] After 499ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2023-03-15 00:35:02] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-15 00:35:02] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2023-03-15 00:35:02] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2023-03-15 00:35:02] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 352 ms
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2023-03-15 00:35:03] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2023-03-15 00:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2023-03-15 00:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 1 ms to minimize.
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 1 ms to minimize.
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 1 ms to minimize.
[2023-03-15 00:35:04] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 1 ms to minimize.
[2023-03-15 00:35:05] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 1 ms to minimize.
[2023-03-15 00:35:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 908 ms
[2023-03-15 00:35:05] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-15 00:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-15 00:35:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2023-03-15 00:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-15 00:35:05] [INFO ] After 3695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 639 ms.
[2023-03-15 00:35:06] [INFO ] After 5278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Fused 34 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 618 ms.
Support contains 51 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 117/117 transitions.
Graph (complete) has 256 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 rules applied. Total rules applied 3 place count 127 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 125 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 124 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 15 place count 120 transition count 110
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 120 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 119 transition count 109
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 20 place count 119 transition count 109
Applied a total of 20 rules in 26 ms. Remains 119 /128 variables (removed 9) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 119/128 places, 109/117 transitions.
Incomplete random walk after 10000 steps, including 777 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 164358 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1}
Probabilistic random walk after 164358 steps, saw 82203 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :33
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 119 cols
[2023-03-15 00:35:11] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-15 00:35:11] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 00:35:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 00:35:11] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-15 00:35:11] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 00:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 00:35:11] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 00:35:11] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 00:35:11] [INFO ] After 171ms 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 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 109/109 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 119 transition count 89
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 99 transition count 89
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 40 place count 99 transition count 85
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 95 transition count 85
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 78 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 77 transition count 68
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 77 transition count 60
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 69 transition count 60
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 69 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 68 transition count 59
Applied a total of 106 rules in 70 ms. Remains 68 /119 variables (removed 51) and now considering 59/109 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 68/119 places, 59/109 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1356971 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :{}
Probabilistic random walk after 1356971 steps, saw 678524 distinct states, run finished after 3005 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 68 cols
[2023-03-15 00:35:15] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-15 00:35:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 00:35:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:35:15] [INFO ] [Nat]Absence check using 5 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-15 00:35:15] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 00:35:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 00:35:15] [INFO ] After 8ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 00:35:15] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 00:35:15] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 68/68 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-15 00:35:15] [INFO ] Invariant cache hit.
[2023-03-15 00:35:15] [INFO ] Implicit Places using invariants in 145 ms returned [13, 24, 37, 41, 59, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 146 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/68 places, 59/59 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 55
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 55
Applied a total of 9 rules in 10 ms. Remains 58 /62 variables (removed 4) and now considering 55/59 (removed 4) transitions.
// Phase 1: matrix 55 rows 58 cols
[2023-03-15 00:35:15] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 00:35:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-15 00:35:15] [INFO ] Invariant cache hit.
[2023-03-15 00:35:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 00:35:15] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/68 places, 55/59 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 379 ms. Remains : 58/68 places, 55/59 transitions.
Incomplete random walk after 10000 steps, including 1485 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 70507 steps, run visited all 1 properties in 170 ms. (steps per millisecond=414 )
Probabilistic random walk after 70507 steps, saw 35275 distinct states, run finished after 171 ms. (steps per millisecond=412 ) properties seen :1
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-003-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:35:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-15 00:35:15] [INFO ] Flatten gal took : 16 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:35:15] [INFO ] Flatten gal took : 14 ms
[2023-03-15 00:35:15] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 71 out of 161 places (down from 87) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 265 edges and 161 vertex of which 156 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 159 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 158 transition count 125
Reduce places removed 22 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 29 rules applied. Total rules applied 52 place count 136 transition count 118
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 59 place count 129 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 59 place count 129 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 73 place count 122 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 106 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 106 transition count 95
Applied a total of 106 rules in 31 ms. Remains 106 /161 variables (removed 55) and now considering 95/148 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 106/161 places, 95/148 transitions.
[2023-03-15 00:35:15] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:35:15] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:35:15] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 158 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 121 transition count 111
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 73 place count 121 transition count 106
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 116 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 127 place count 94 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 94 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 93 transition count 83
Applied a total of 129 rules in 30 ms. Remains 93 /161 variables (removed 68) and now considering 83/148 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 93/161 places, 83/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 160 transition count 148
Applied a total of 1 rules in 4 ms. Remains 160 /161 variables (removed 1) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 160/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 12 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 158 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 157 transition count 114
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 124 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 123 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 123 transition count 107
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 117 transition count 107
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 123 place count 96 transition count 86
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 96 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 95 transition count 85
Applied a total of 127 rules in 31 ms. Remains 95 /161 variables (removed 66) and now considering 85/148 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 95/161 places, 85/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 4 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 3 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 9 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 10 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 10 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 9 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 10 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 9 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 4 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 9 ms
[2023-03-15 00:35:16] [INFO ] Input system was already deterministic with 148 transitions.
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 10 ms
[2023-03-15 00:35:16] [INFO ] Flatten gal took : 10 ms
[2023-03-15 00:35:16] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-15 00:35:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 148 transitions and 413 arcs took 3 ms.
Total runtime 34298 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 161 NrTr: 148 NrArc: 413)

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

net check time: 0m 0.000sec

init dd package: 0m 3.749sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10272632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102280 kB

BK_TIME_CONFINEMENT_REACHED

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

6557 7287 7767 8162 8604 8936 9356 9519 9898 10011 10423

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="DoubleExponent-PT-003"
export BK_EXAMINATION="CTLCardinality"
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 DoubleExponent-PT-003, 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 r138-smll-167819420800457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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