About the Execution of Marcie+red for Angiogenesis-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14513.747 | 3600000.00 | 3666926.00 | 231.30 | ?T?FF???????FFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598900345.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 Angiogenesis-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.3K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K 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 Angiogenesis-PT-20-CTLCardinality-00
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-01
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-02
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-03
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-04
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-05
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-06
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-07
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-08
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-09
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-10
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-11
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-12
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-13
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-14
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678684652399
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=Angiogenesis-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:17:36] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-13 05:17:36] [INFO ] Transformed 39 places.
[2023-03-13 05:17:36] [INFO ] Transformed 64 transitions.
[2023-03-13 05:17:36] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Angiogenesis-PT-20-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-20-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Applied a total of 1 rules in 113 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:17:36] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-13 05:17:36] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-13 05:17:36] [INFO ] Invariant cache hit.
[2023-03-13 05:17:37] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-13 05:17:37] [INFO ] Invariant cache hit.
[2023-03-13 05:17:37] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/39 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1182 ms. Remains : 38/39 places, 64/64 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-13 05:17:37] [INFO ] Flatten gal took : 40 ms
[2023-03-13 05:17:37] [INFO ] Flatten gal took : 26 ms
[2023-03-13 05:17:38] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 84) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-13 05:17:38] [INFO ] Invariant cache hit.
[2023-03-13 05:17:38] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-13 05:17:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-13 05:17:39] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :13
[2023-03-13 05:17:39] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :13
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-13 05:17:39] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :13
Fused 25 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 56 ms.
Support contains 11 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 35 transition count 61
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 107 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 58
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 34 transition count 57
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 13 place count 33 transition count 57
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 33 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 33 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 33 transition count 53
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 31 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 31 transition count 52
Applied a total of 22 rules in 46 ms. Remains 31 /38 variables (removed 7) and now considering 52/64 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 31/38 places, 52/64 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 52 rows 31 cols
[2023-03-13 05:17:39] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-13 05:17:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:17:39] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-13 05:17:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:17:39] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 05:17:39] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 05:17:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:17:39] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 05:17:39] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 05:17:39] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 05:17:39] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 52/52 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 49
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 29 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 27 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 25 transition count 44
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 25 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 22 place count 21 transition count 49
Drop transitions removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 31 place count 21 transition count 40
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 35 place count 21 transition count 36
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 38 place count 21 transition count 33
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 44 place count 18 transition count 30
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 46 place count 18 transition count 30
Applied a total of 46 rules in 10 ms. Remains 18 /31 variables (removed 13) and now considering 30/52 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 18/31 places, 30/52 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Finished Best-First random walk after 835 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=417 )
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-20-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:17:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 05:17:39] [INFO ] Flatten gal took : 8 ms
FORMULA Angiogenesis-PT-20-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:17:39] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 33 out of 38 places (down from 34) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 63
Applied a total of 4 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 64
Applied a total of 4 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA Angiogenesis-PT-20-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:17:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:17:40] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 05:17:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 64 transitions and 184 arcs took 1 ms.
Total runtime 4337 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: 38 NrTr: 64 NrArc: 184)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec
net check time: 0m 0.000sec
init dd package: 0m 2.974sec
RS generation: 0m19.059sec
-> reachability set: #nodes 131809 (1.3e+05) #states 351,820,047,967,344,849 (17)
starting MCC model checker
--------------------------
checking: AG [EX [~ [p27<=p7]]]
normalized: ~ [E [true U ~ [EX [~ [p27<=p7]]]]]
abstracting: (p27<=p7)
states: 160,171,154,871,432,385 (17)
.MC time: 5m27.135sec
checking: AX [EG [[AG [~ [7<=p18]] & EF [p23<=p10]]]]
normalized: ~ [EX [~ [EG [[E [true U p23<=p10] & ~ [E [true U 7<=p18]]]]]]]
abstracting: (7<=p18)
states: 119,471,360,431,121 (14)
MC time: 4m56.318sec
checking: AG [E [EX [p31<=4] U ~ [[AX [1<=0] | ~ [A [p30<=p5 U 4<=p24]]]]]]
normalized: ~ [E [true U ~ [E [EX [p31<=4] U ~ [[~ [[~ [EG [~ [4<=p24]]] & ~ [E [~ [4<=p24] U [~ [p30<=p5] & ~ [4<=p24]]]]]] | ~ [EX [~ [1<=0]]]]]]]]]
abstracting: (1<=0)
states: 0
before gc: list nodes free: 23643
after gc: idd nodes used:688920, unused:63311080; list nodes free:528303084
.abstracting: (4<=p24)
states: 4,852,281,701,176,441 (15)
abstracting: (p30<=p5)
states: 279,927,671,510,811,699 (17)
abstracting: (4<=p24)
states: 4,852,281,701,176,441 (15)
abstracting: (4<=p24)
states: 4,852,281,701,176,441 (15)
.
EG iterations: 1
abstracting: (p31<=4)
states: 332,626,866,604,937,522 (17)
.MC time: 4m29.118sec
checking: AG [[p30<=11 | [EG [AF [~ [p34<=8]]] | A [EG [p12<=p14] U EF [EX [p12<=10]]]]]]
normalized: ~ [E [true U ~ [[p30<=11 | [[~ [EG [~ [E [true U EX [p12<=10]]]]] & ~ [E [~ [E [true U EX [p12<=10]]] U [~ [EG [p12<=p14]] & ~ [E [true U EX [p12<=10]]]]]]] | EG [~ [EG [p34<=8]]]]]]]]
abstracting: (p34<=8)
states: 637,887,886,660,878 (14)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p12<=10)
states: 351,819,717,304,636,196 (17)
.abstracting: (p12<=p14)
states: 257,192,578,005,686,422 (17)
.
EG iterations: 1
abstracting: (p12<=10)
states: 351,819,717,304,636,196 (17)
.abstracting: (p12<=10)
states: 351,819,717,304,636,196 (17)
..
EG iterations: 1
abstracting: (p30<=11)
states: 351,765,508,355,544,232 (17)
-> the formula is TRUE
FORMULA Angiogenesis-PT-20-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m34.169sec
checking: EF [EG [~ [E [~ [[14<=p16 | p28<=p36]] U [EF [12<=p35] | ~ [p24<=p27]]]]]]
normalized: E [true U EG [~ [E [~ [[14<=p16 | p28<=p36]] U [~ [p24<=p27] | E [true U 12<=p35]]]]]]
abstracting: (12<=p35)
states: 54,539,611,800,617 (13)
abstracting: (p24<=p27)
states: 300,047,831,324,637,354 (17)
abstracting: (p28<=p36)
states: 180,509,899,137,777,488 (17)
abstracting: (14<=p16)
states: 1,367,346,672 (9)
MC time: 4m29.471sec
checking: E [~ [A [p2<=18 U [p30<=p0 & AX [AG [p26<=p21]]]]] U EG [EF [~ [p36<=8]]]]
normalized: E [~ [[~ [EG [~ [[p30<=p0 & ~ [EX [E [true U ~ [p26<=p21]]]]]]]] & ~ [E [~ [[p30<=p0 & ~ [EX [E [true U ~ [p26<=p21]]]]]] U [~ [p2<=18] & ~ [[p30<=p0 & ~ [EX [E [true U ~ [p26<=p21]]]]]]]]]]] U EG [E [true U ~ [p36<=8]]]]
abstracting: (p36<=8)
states: 350,879,140,656,792,758 (17)
before gc: list nodes free: 1113035
after gc: idd nodes used:1945599, unused:62054401; list nodes free:551627566
.
EG iterations: 1
abstracting: (p26<=p21)
states: 318,054,491,431,867,708 (17)
MC time: 3m59.016sec
checking: [AF [AG [~ [E [E [p35<=p17 U p14<=p8] U E [14<=p18 U 18<=p35]]]]] | [AF [EG [p34<=p19]] & [EF [AX [1<=0]] & EX [~ [2<=p10]]]]]
normalized: [[[EX [~ [2<=p10]] & E [true U ~ [EX [~ [1<=0]]]]] & ~ [EG [~ [EG [p34<=p19]]]]] | ~ [EG [E [true U E [E [p35<=p17 U p14<=p8] U E [14<=p18 U 18<=p35]]]]]]
abstracting: (18<=p35)
states: 10,400,812,847 (10)
abstracting: (14<=p18)
states: 1,367,346,672 (9)
abstracting: (p14<=p8)
states: 272,090,118,447,491,863 (17)
abstracting: (p35<=p17)
states: 225,379,459,633,246,722 (17)
MC time: 3m35.004sec
checking: EF [[EF [[EF [~ [17<=p30]] | [[EF [p36<=17] & AX [17<=p36]] & [[p26<=p25 | 19<=p5] & [p12<=11 | 11<=p28]]]]] & [AF [7<=p26] & AG [17<=p31]]]]
normalized: E [true U [[~ [E [true U ~ [17<=p31]]] & ~ [EG [~ [7<=p26]]]] & E [true U [[[[p12<=11 | 11<=p28] & [p26<=p25 | 19<=p5]] & [~ [EX [~ [17<=p36]]] & E [true U p36<=17]]] | E [true U ~ [17<=p30]]]]]]
abstracting: (17<=p30)
states: 67,417,579,287 (10)
abstracting: (p36<=17)
states: 351,820,037,566,557,202 (17)
abstracting: (17<=p36)
states: 67,417,522,007 (10)
.abstracting: (19<=p5)
states: 77,130,223,659 (10)
abstracting: (p26<=p25)
states: 299,513,734,630,540,007 (17)
abstracting: (11<=p28)
states: 712,225,696,776,626 (14)
abstracting: (p12<=11)
states: 351,819,987,719,903,476 (17)
abstracting: (7<=p26)
states: 244,723,583,715 (11)
.
EG iterations: 1
abstracting: (17<=p31)
states: 67,417,522,007 (10)
-> the formula is FALSE
FORMULA Angiogenesis-PT-20-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m45.263sec
checking: EG [AG [[[E [p20<=p27 U p23<=p10] | AX [~ [15<=p21]]] | [[~ [p8<=p23] & ~ [p19<=11]] | [~ [13<=p1] & ~ [6<=p18]]]]]]
normalized: EG [~ [E [true U ~ [[[[~ [6<=p18] & ~ [13<=p1]] | [~ [p19<=11] & ~ [p8<=p23]]] | [~ [EX [15<=p21]] | E [p20<=p27 U p23<=p10]]]]]]]
abstracting: (p23<=p10)
states: 241,019,093,605,963,873 (17)
abstracting: (p20<=p27)
states: 325,840,594,759,868,825 (17)
before gc: list nodes free: 13008674
after gc: idd nodes used:3891358, unused:60108642; list nodes free:531844293
MC time: 3m30.501sec
checking: EF [[AF [p33<=10] & AX [[[[AG [p1<=19] & [AX [p34<=p25] | [p19<=p3 | p7<=4]]] | A [p36<=p24 U 10<=p5]] | [EF [p14<=p21] | EX [p36<=12]]]]]]
normalized: E [true U [~ [EX [~ [[[EX [p36<=12] | E [true U p14<=p21]] | [[~ [EG [~ [10<=p5]]] & ~ [E [~ [10<=p5] U [~ [p36<=p24] & ~ [10<=p5]]]]] | [[[p19<=p3 | p7<=4] | ~ [EX [~ [p34<=p25]]]] & ~ [E [true U ~ [p1<=19]]]]]]]]] & ~ [EG [~ [p33<=10]]]]]
abstracting: (p33<=10)
states: 203,620,695,254,041,449 (17)
.
EG iterations: 1
abstracting: (p1<=19)
states: 351,820,047,964,238,515 (17)
MC time: 3m 6.130sec
checking: [EX [9<=p4] & E [E [EG [AF [p14<=p6]] U [EG [EX [p15<=13]] & [[p15<=9 & [p9<=p25 & [p10<=p3 | 14<=p2]]] | AG [p6<=p8]]]] U ~ [EX [A [EF [p17<=1] U [p20<=5 | p1<=p8]]]]]]
normalized: [E [E [EG [~ [EG [~ [p14<=p6]]]] U [[~ [E [true U ~ [p6<=p8]]] | [p15<=9 & [p9<=p25 & [p10<=p3 | 14<=p2]]]] & EG [EX [p15<=13]]]] U ~ [EX [[~ [EG [~ [[p20<=5 | p1<=p8]]]] & ~ [E [~ [[p20<=5 | p1<=p8]] U [~ [E [true U p17<=1]] & ~ [[p20<=5 | p1<=p8]]]]]]]]] & EX [9<=p4]]
abstracting: (9<=p4)
states: 351,765,508,355,544,232 (17)
.abstracting: (p1<=p8)
states: 213,388,139,713,610,602 (17)
abstracting: (p20<=5)
states: 351,816,381,533,188,968 (17)
abstracting: (p17<=1)
states: 225,856,620,617,280,882 (17)
abstracting: (p1<=p8)
states: 213,388,139,713,610,602 (17)
abstracting: (p20<=5)
states: 351,816,381,533,188,968 (17)
abstracting: (p1<=p8)
states: 213,388,139,713,610,602 (17)
abstracting: (p20<=5)
states: 351,816,381,533,188,968 (17)
..
EG iterations: 2
.abstracting: (p15<=13)
states: 351,815,985,638,979,882 (17)
..
EG iterations: 1
abstracting: (14<=p2)
states: 5,471,312,487,179 (12)
abstracting: (p10<=p3)
states: 180,063,758,745,392,226 (17)
abstracting: (p9<=p25)
states: 216,949,749,911,849,129 (17)
abstracting: (p15<=9)
states: 351,425,980,670,307,008 (17)
abstracting: (p6<=p8)
states: 233,547,293,995,585,348 (17)
abstracting: (p14<=p6)
states: 272,090,118,447,491,863 (17)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1634776 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098036 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
iterations count:19139 (299), effective:1383 (21)
initing FirstDep: 0m 0.000sec
sat_reach.icc:155: Timeout: after 325 sec
sat_reach.icc:155: Timeout: after 295 sec
iterations count:6248 (97), effective:404 (6)
sat_reach.icc:155: Timeout: after 268 sec
iterations count:168 (2), effective:8 (0)
iterations count:168 (2), effective:8 (0)
iterations count:168 (2), effective:8 (0)
iterations count:13834 (216), effective:820 (12)
sat_reach.icc:155: Timeout: after 265 sec
iterations count:11708 (182), effective:723 (11)
sat_reach.icc:155: Timeout: after 238 sec
iterations count:64 (1), effective:0 (0)
iterations count:544 (8), effective:20 (0)
sat_reach.icc:155: Timeout: after 214 sec
iterations count:96 (1), effective:4 (0)
iterations count:79 (1), effective:3 (0)
iterations count:64 (1), effective:0 (0)
iterations count:84 (1), effective:8 (0)
sat_reach.icc:155: Timeout: after 209 sec
sat_reach.icc:155: Timeout: after 185 sec
iterations count:1264 (19), effective:148 (2)
iterations count:1183 (18), effective:66 (1)
net_ddint.h:600: Timeout: after 165 sec
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="Angiogenesis-PT-20"
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 Angiogenesis-PT-20, 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 r010-oct2-167813598900345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 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 '
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 ;