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-167813598900330.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.6K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 14:54 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 4.1K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-10-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678683964399

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:06:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:06:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:06:07] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-13 05:06:07] [INFO ] Transformed 39 places.
[2023-03-13 05:06:07] [INFO ] Transformed 64 transitions.
[2023-03-13 05:06:07] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-10-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 13 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:06:07] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-13 05:06:07] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-13 05:06:07] [INFO ] Invariant cache hit.
[2023-03-13 05:06:07] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-13 05:06:07] [INFO ] Invariant cache hit.
[2023-03-13 05:06:07] [INFO ] Dead Transitions using invariants and state equation in 122 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 571 ms. Remains : 38/39 places, 64/64 transitions.
Support contains 35 out of 38 places after structural reductions.
[2023-03-13 05:06:07] [INFO ] Flatten gal took : 38 ms
[2023-03-13 05:06:07] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:06:07] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 42) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 05:06:08] [INFO ] Invariant cache hit.
[2023-03-13 05:06:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-13 05:06:08] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 05:06:08] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:06:08] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:06:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 05:06:08] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 05:06:08] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 05:06:08] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 1 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 35 transition count 61
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 108 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 34 transition count 60
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 34 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 32 transition count 59
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 15 place count 32 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 32 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 32 transition count 53
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 23 place count 30 transition count 51
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 27 place count 30 transition count 51
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 30 place count 30 transition count 51
Applied a total of 30 rules in 66 ms. Remains 30 /38 variables (removed 8) and now considering 51/64 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 30/38 places, 51/64 transitions.
Finished random walk after 1632 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=816 )
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:06:08] [INFO ] Input system was already deterministic with 64 transitions.
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 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:06:08] [INFO ] Flatten gal took : 23 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:06:08] [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:06:08] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:06:08] [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 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 9 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 9 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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 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:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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
Applied a total of 3 rules in 2 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 2 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:06:08] [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 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:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:08] [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 2 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:08] [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 1 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 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 3 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 6 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:06:08] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:06:09] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 2083 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=694 )
FORMULA Angiogenesis-PT-10-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:09] [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 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 36 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 36 transition count 62
Applied a total of 11 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 62/64 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 36/38 places, 62/64 transitions.
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Input system was already deterministic with 62 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:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:09] [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 3 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:09] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:09] [INFO ] Flatten gal took : 15 ms
[2023-03-13 05:06:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 05:06:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 64 transitions and 184 arcs took 2 ms.
Total runtime 2312 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 38 NrTr: 64 NrArc: 184)

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

net check time: 0m 0.000sec

init dd package: 0m 2.887sec


RS generation: 0m 1.124sec


-> reachability set: #nodes 18394 (1.8e+04) #states 822,645,885,495 (11)



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

checking: EF [EG [1<=p20]]
normalized: E [true U EG [1<=p20]]

abstracting: (1<=p20)
states: 71,528,758,583 (10)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.768sec

checking: AF [E [EF [1<=p22] U 1<=p15]]
normalized: ~ [EG [~ [E [E [true U 1<=p22] U 1<=p15]]]]

abstracting: (1<=p15)
states: 365,203,299,954 (11)
abstracting: (1<=p22)
states: 166,727,081,996 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.747sec

checking: AF [~ [E [p6<=0 U AX [1<=p16]]]]
normalized: ~ [EG [E [p6<=0 U ~ [EX [~ [1<=p16]]]]]]

abstracting: (1<=p16)
states: 167,755,076,831 (11)
.abstracting: (p6<=0)
states: 547,898,554,958 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.328sec

checking: E [EX [[AF [1<=p12] | EF [1<=p22]]] U AG [1<=p1]]
normalized: E [EX [[E [true U 1<=p22] | ~ [EG [~ [1<=p12]]]]] U ~ [E [true U ~ [1<=p1]]]]

abstracting: (1<=p1)
states: 333,299,255,327 (11)
abstracting: (1<=p12)
states: 167,666,359,572 (11)
.
EG iterations: 1
abstracting: (1<=p22)
states: 166,727,081,996 (11)
.-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.749sec

checking: EG [AX [EF [AG [[1<=p11 | [1<=p8 & 1<=p10]]]]]]
normalized: EG [~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p11 | [1<=p8 & 1<=p10]]]]]]]]]]

abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p8)
states: 274,865,497,172 (11)
abstracting: (1<=p11)
states: 365,039,009,447 (11)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.755sec

checking: EX [EF [AG [[AG [p3<=0] | [p18<=0 | p26<=0]]]]]
normalized: EX [E [true U ~ [E [true U ~ [[[p18<=0 | p26<=0] | ~ [E [true U ~ [p3<=0]]]]]]]]]

abstracting: (p3<=0)
states: 453,721,607,541 (11)
abstracting: (p26<=0)
states: 751,499,162,688 (11)
abstracting: (p18<=0)
states: 654,890,808,664 (11)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.617sec

checking: [AF [[[p11<=0 | p22<=0] & [EG [1<=p15] & EX [1<=p12]]]] | EF [AG [EX [[p14<=0 & p18<=0]]]]]
normalized: [E [true U ~ [E [true U ~ [EX [[p14<=0 & p18<=0]]]]]] | ~ [EG [~ [[[EX [1<=p12] & EG [1<=p15]] & [p11<=0 | p22<=0]]]]]]

abstracting: (p22<=0)
states: 655,918,803,499 (11)
abstracting: (p11<=0)
states: 457,606,876,048 (11)
abstracting: (1<=p15)
states: 365,203,299,954 (11)
.
EG iterations: 1
abstracting: (1<=p12)
states: 167,666,359,572 (11)
..
EG iterations: 1
abstracting: (p18<=0)
states: 654,890,808,664 (11)
abstracting: (p14<=0)
states: 654,890,808,664 (11)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.100sec

checking: [EF [[EG [AG [[1<=p25 & 1<=p30]]] | AG [[1<=p21 | 1<=p20]]]] | [EF [[p13<=0 | p33<=0]] & EG [[1<=p14 & 1<=p33]]]]
normalized: [[EG [[1<=p14 & 1<=p33]] & E [true U [p13<=0 | p33<=0]]] | E [true U [~ [E [true U ~ [[1<=p21 | 1<=p20]]]] | EG [~ [E [true U ~ [[1<=p25 & 1<=p30]]]]]]]]

abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p25)
states: 166,727,081,996 (11)
.
EG iterations: 1
abstracting: (1<=p20)
states: 71,528,758,583 (10)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (p33<=0)
states: 13,097,349,053 (10)
abstracting: (p13<=0)
states: 457,442,585,541 (11)
abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p14)
states: 167,755,076,831 (11)
..
EG iterations: 2
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.832sec

checking: EX [[1<=p20 | [A [EF [[1<=p21 & [1<=p8 & 1<=p10]]] U [1<=p6 & 1<=p10]] | [1<=p6 & 1<=p10]]]]
normalized: EX [[1<=p20 | [[1<=p6 & 1<=p10] | [~ [EG [~ [[1<=p6 & 1<=p10]]]] & ~ [E [~ [[1<=p6 & 1<=p10]] U [~ [E [true U [1<=p21 & [1<=p8 & 1<=p10]]]] & ~ [[1<=p6 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p6)
states: 274,747,330,537 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p8)
states: 274,865,497,172 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p6)
states: 274,747,330,537 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p6)
states: 274,747,330,537 (11)
.
EG iterations: 1
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p6)
states: 274,747,330,537 (11)
abstracting: (1<=p20)
states: 71,528,758,583 (10)
.-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.042sec

checking: EF [[[1<=p7 & 1<=p33] & [AF [EG [A [1<=p37 U [1<=p28 & 1<=p30]]]] & A [[AF [1<=p29] & ~ [EX [[1<=p13 & 1<=p32]]]] U 1<=p16]]]]
normalized: E [true U [[[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [[~ [EX [[1<=p13 & 1<=p32]]] & ~ [EG [~ [1<=p29]]]]] & ~ [1<=p16]]]]] & ~ [EG [~ [EG [[~ [EG [~ [[1<=p28 & 1<=p30]]]] & ~ [E [~ [[1<=p28 & 1<=p30]] U [~ [1<=p37] & ~ [[1<=p28 & 1<=p30]]]]]]]]]]] & [1<=p7 & 1<=p33]]]

abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p7)
states: 274,865,497,172 (11)
abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p28)
states: 466,584,905,605 (11)
abstracting: (1<=p37)
states: 153,496,000,877 (11)
abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p28)
states: 466,584,905,605 (11)
abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p28)
states: 466,584,905,605 (11)
..
EG iterations: 2
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p16)
states: 167,755,076,831 (11)
abstracting: (1<=p29)
states: 209,049,404,819 (11)
.
EG iterations: 1
abstracting: (1<=p32)
states: 822,568,558,183 (11)
abstracting: (1<=p13)
states: 365,203,299,954 (11)
.abstracting: (1<=p16)
states: 167,755,076,831 (11)
abstracting: (1<=p16)
states: 167,755,076,831 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.555sec

checking: EF [[[1<=p27 & EX [[AG [1<=p14] & EF [1<=p15]]]] & [EF [[AF [p36<=0] & p16<=0]] & [AG [A [1<=p11 U [1<=p13 & 1<=p33]]] | EX [AG [[1<=p7 & 1<=p32]]]]]]]
normalized: E [true U [[[EX [~ [E [true U ~ [[1<=p7 & 1<=p32]]]]] | ~ [E [true U ~ [[~ [EG [~ [[1<=p13 & 1<=p33]]]] & ~ [E [~ [[1<=p13 & 1<=p33]] U [~ [1<=p11] & ~ [[1<=p13 & 1<=p33]]]]]]]]]] & E [true U [p16<=0 & ~ [EG [~ [p36<=0]]]]]] & [1<=p27 & EX [[E [true U 1<=p15] & ~ [E [true U ~ [1<=p14]]]]]]]]

abstracting: (1<=p14)
states: 167,755,076,831 (11)
abstracting: (1<=p15)
states: 365,203,299,954 (11)
.abstracting: (1<=p27)
states: 466,584,905,605 (11)
abstracting: (p36<=0)
states: 453,721,744,249 (11)
..
EG iterations: 2
abstracting: (p16<=0)
states: 654,890,808,664 (11)
abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p13)
states: 365,203,299,954 (11)
abstracting: (1<=p11)
states: 365,039,009,447 (11)
abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p13)
states: 365,203,299,954 (11)
abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p13)
states: 365,203,299,954 (11)
.
EG iterations: 1
abstracting: (1<=p32)
states: 822,568,558,183 (11)
abstracting: (1<=p7)
states: 274,865,497,172 (11)
.-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.734sec

checking: AG [[EG [[~ [E [[1<=p5 & 1<=p31] U [1<=p6 & 1<=p10]]] | AX [[[1<=p19 & 1<=p30] & [1<=p9 & 1<=p10]]]]] | AF [EX [[1<=p7 & 1<=p10]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [[1<=p7 & 1<=p10]]]]] | EG [[~ [EX [~ [[[1<=p9 & 1<=p10] & [1<=p19 & 1<=p30]]]]] | ~ [E [[1<=p5 & 1<=p31] U [1<=p6 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p6)
states: 274,747,330,537 (11)
abstracting: (1<=p31)
states: 368,924,141,246 (11)
abstracting: (1<=p5)
states: 597,839,483,060 (11)
abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p19)
states: 167,755,076,831 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p9)
states: 270,631,443,152 (11)
............
EG iterations: 11
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p7)
states: 274,865,497,172 (11)
............
EG iterations: 11
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.970sec

checking: [AX [[EF [[[p22<=0 | [p30<=0 | p34<=0]] | [[p2<=0 | p4<=0] | [p0<=0 | p31<=0]]]] & p18<=0]] & EG [EX [~ [A [E [[1<=p9 & 1<=p10] U [1<=p31 & 1<=p34]] U A [1<=p36 U 1<=p21]]]]]]
normalized: [EG [EX [~ [[~ [EG [~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [1<=p36] & ~ [1<=p21]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [1<=p36] & ~ [1<=p21]]]]]] U [~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [1<=p36] & ~ [1<=p21]]]]]] & ~ [E [[1<=p9 & 1<=p10] U [1<=p31 & 1<=p34]]]]]]]]]] & ~ [EX [~ [[p18<=0 & E [true U [[[p0<=0 | p31<=0] | [p2<=0 | p4<=0]] | [p22<=0 | [p30<=0 | p34<=0]]]]]]]]]

abstracting: (p34<=0)
states: 5,260,398 (6)
abstracting: (p30<=0)
states: 453,721,607,541 (11)
abstracting: (p22<=0)
states: 655,918,803,499 (11)
abstracting: (p4<=0)
states: 478,478 (5)
abstracting: (p2<=0)
states: 453,721,607,541 (11)
abstracting: (p31<=0)
states: 453,721,744,249 (11)
abstracting: (p0<=0)
states: 80,110,926,502 (10)
abstracting: (p18<=0)
states: 654,890,808,664 (11)
.abstracting: (1<=p34)
states: 822,640,625,097 (11)
abstracting: (1<=p31)
states: 368,924,141,246 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p9)
states: 270,631,443,152 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p36)
states: 368,924,141,246 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
.
EG iterations: 1
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p36)
states: 368,924,141,246 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
.
EG iterations: 1
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p36)
states: 368,924,141,246 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
abstracting: (1<=p21)
states: 362,685,744,032 (11)
.
EG iterations: 1
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.079sec

checking: EF [[E [~ [[[1<=p12 & [1<=p30 & 1<=p34]] | p8<=0]] U [[p8<=0 | EF [1<=p22]] & [~ [[1<=p14 & 1<=p33]] | [E [1<=p24 U 1<=p15] | [1<=p7 & 1<=p10]]]]] & AX [[AF [EG [1<=p3]] & [EG [p3<=0] & [p21<=0 | p1<=0]]]]]]
normalized: E [true U [~ [EX [~ [[[[p21<=0 | p1<=0] & EG [p3<=0]] & ~ [EG [~ [EG [1<=p3]]]]]]]] & E [~ [[p8<=0 | [1<=p12 & [1<=p30 & 1<=p34]]]] U [[[[1<=p7 & 1<=p10] | E [1<=p24 U 1<=p15]] | ~ [[1<=p14 & 1<=p33]]] & [p8<=0 | E [true U 1<=p22]]]]]]

abstracting: (1<=p22)
states: 166,727,081,996 (11)
abstracting: (p8<=0)
states: 547,780,388,323 (11)
abstracting: (1<=p33)
states: 809,548,536,442 (11)
abstracting: (1<=p14)
states: 167,755,076,831 (11)
abstracting: (1<=p15)
states: 365,203,299,954 (11)
abstracting: (1<=p24)
states: 166,727,081,996 (11)
abstracting: (1<=p10)
states: 469,977,654,509 (11)
abstracting: (1<=p7)
states: 274,865,497,172 (11)
abstracting: (1<=p34)
states: 822,640,625,097 (11)
abstracting: (1<=p30)
states: 368,924,277,954 (11)
abstracting: (1<=p12)
states: 167,666,359,572 (11)
abstracting: (p8<=0)
states: 547,780,388,323 (11)
abstracting: (1<=p3)
states: 368,924,277,954 (11)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (p3<=0)
states: 453,721,607,541 (11)
..
EG iterations: 2
abstracting: (p1<=0)
states: 489,346,630,168 (11)
abstracting: (p21<=0)
states: 459,960,141,463 (11)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.652sec

totally nodes used: 19173560 (1.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 252689403 110130383 362819786
used/not used/entry size/cache size: 55697522 11411342 16 1024MB
basic ops cache: hits/miss/sum: 39415517 18015204 57430721
used/not used/entry size/cache size: 13466182 3311034 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 948977 424914 1373891
used/not used/entry size/cache size: 414215 7974393 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 51312743
1 13401256
2 2017101
3 262426
4 52182
5 17835
6 10406
7 6627
8 5664
9 4215
>= 10 18409

Total processing time: 1m36.914sec


BK_STOP 1678684066361

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:9304 (145), effective:673 (10)

initing FirstDep: 0m 0.000sec


iterations count:2533 (39), effective:148 (2)

iterations count:1306 (20), effective:79 (1)

iterations count:1081 (16), effective:60 (0)

iterations count:3362 (52), effective:217 (3)

iterations count:84 (1), effective:10 (0)

iterations count:1306 (20), effective:79 (1)

iterations count:184 (2), effective:20 (0)

iterations count:1556 (24), effective:109 (1)

iterations count:4160 (65), effective:249 (3)

iterations count:11225 (175), effective:876 (13)

iterations count:3666 (57), effective:226 (3)

iterations count:11371 (177), effective:883 (13)

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

iterations count:414 (6), effective:15 (0)

iterations count:194 (3), effective:10 (0)

iterations count:2990 (46), effective:184 (2)

iterations count:14555 (227), effective:966 (15)

iterations count:99 (1), effective:5 (0)

iterations count:821 (12), effective:28 (0)

iterations count:4442 (69), effective:293 (4)

iterations count:304 (4), effective:10 (0)

iterations count:1081 (16), effective:60 (0)

iterations count:154 (2), effective:20 (0)

iterations count:189 (2), effective:15 (0)

iterations count:194 (3), effective:10 (0)

iterations count:144 (2), effective:10 (0)

iterations count:1669 (26), effective:124 (1)

iterations count:3790 (59), effective:338 (5)

iterations count:71 (1), effective:7 (0)

iterations count:1002 (15), effective:46 (0)

iterations count:114 (1), effective:10 (0)

iterations count:114 (1), effective:10 (0)

iterations count:2752 (43), effective:304 (4)

iterations count:114 (1), effective:10 (0)

iterations count:1306 (20), effective:79 (1)

iterations count:1081 (16), effective:60 (0)

iterations count:246 (3), effective:21 (0)

iterations count:11439 (178), effective:776 (12)

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-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Angiogenesis-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598900330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-10.tgz
mv Angiogenesis-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;