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-167813598900329.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900329
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-01
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-02
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-03
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-04
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-05
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-06
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-07
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-08
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-09
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-10
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-11
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-12
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-13
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-14
FORMULA_NAME Angiogenesis-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678683951031

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-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:05:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:05:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:05:54] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-13 05:05:54] [INFO ] Transformed 39 places.
[2023-03-13 05:05:54] [INFO ] Transformed 64 transitions.
[2023-03-13 05:05:54] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 37 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 25 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 39 cols
[2023-03-13 05:05:54] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-13 05:05:54] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-13 05:05:54] [INFO ] Invariant cache hit.
[2023-03-13 05:05:54] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-13 05:05:54] [INFO ] Invariant cache hit.
[2023-03-13 05:05:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 39/39 places, 64/64 transitions.
Support contains 37 out of 39 places after structural reductions.
[2023-03-13 05:05:55] [INFO ] Flatten gal took : 27 ms
[2023-03-13 05:05:55] [INFO ] Flatten gal took : 11 ms
[2023-03-13 05:05:55] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 36 out of 39 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 62) seen :53
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 05:05:55] [INFO ] Invariant cache hit.
[2023-03-13 05:05:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:05:55] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-13 05:05:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:05:56] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-13 05:05:56] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-13 05:05:56] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 4 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 5 place count 36 transition count 62
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 27 transition count 53
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 82 edges and 27 vertex of which 26 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 1 with 9 rules applied. Total rules applied 32 place count 26 transition count 45
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 26 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 25 transition count 47
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 25 transition count 45
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 25 transition count 42
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 25 transition count 38
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 51 place count 21 transition count 35
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 53 place count 21 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 56 place count 19 transition count 32
Applied a total of 56 rules in 77 ms. Remains 19 /39 variables (removed 20) and now considering 32/64 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 19/39 places, 32/64 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 1878382 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :{1=1}
Probabilistic random walk after 1878382 steps, saw 818058 distinct states, run finished after 3003 ms. (steps per millisecond=625 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-13 05:05:59] [INFO ] Flow matrix only has 31 transitions (discarded 1 similar events)
// Phase 1: matrix 31 rows 19 cols
[2023-03-13 05:05:59] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 05:05:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-13 05:05:59] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:05:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-13 05:05:59] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 05:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:05:59] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 05:05:59] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 05:05:59] [INFO ] After 154ms 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 19 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19/19 places, 32/32 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t32 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 18 transition count 29
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 17 transition count 28
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 7 place count 16 transition count 28
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 16 transition count 26
Applied a total of 9 rules in 6 ms. Remains 16 /19 variables (removed 3) and now considering 26/32 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 16/19 places, 26/32 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished Best-First random walk after 511 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=170 )
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 05:05:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 14 ms
FORMULA Angiogenesis-PT-10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 64
Applied a total of 2 rules in 5 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 39/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 14 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
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 1 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
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 1 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 4 place count 36 transition count 63
Applied a total of 4 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 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 39 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 37 transition count 63
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 63
Applied a total of 6 rules in 4 ms. Remains 37 /39 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 37/39 places, 63/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 63 transitions.
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 0 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 39/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 4 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 5 place count 36 transition count 63
Applied a total of 5 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 63 transitions.
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 1 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
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 1 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 4 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 6 place count 36 transition count 63
Applied a total of 6 rules in 4 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 63 transitions.
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 1 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:05:59] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/39 places, 64/64 transitions.
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:00] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 39/39 places, 64/64 transitions.
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:00] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 4 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 11 place count 36 transition count 63
Applied a total of 11 rules in 4 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:00] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:06:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:06:00] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 05:06:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 64 transitions and 185 arcs took 1 ms.
Total runtime 5810 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: 39 NrTr: 64 NrArc: 185)

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

net check time: 0m 0.000sec

init dd package: 0m 3.095sec


RS generation: 0m 6.488sec


-> reachability set: #nodes 128274 (1.3e+05) #states 822,645,885,495 (11)



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

checking: AG [E [EX [EX [0<=0]] U EF [p23<=3]]]
normalized: ~ [E [true U ~ [E [EX [EX [0<=0]] U E [true U p23<=3]]]]]

abstracting: (p23<=3)
states: 821,954,373,725 (11)
abstracting: (0<=0)
states: 822,645,885,495 (11)
..-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.046sec

checking: EF [EG [~ [p24<=4]]]
normalized: E [true U EG [~ [p24<=4]]]

abstracting: (p24<=4)
states: 817,758,163,547 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m11.265sec

checking: AG [EX [AG [EF [~ [p16<=3]]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U ~ [E [true U ~ [p16<=3]]]]]]]]]

abstracting: (p16<=3)
states: 804,810,682,525 (11)
.-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.053sec

checking: EX [EF [~ [p1<=5]]]
normalized: EX [E [true U ~ [p1<=5]]]

abstracting: (p1<=5)
states: 821,924,553,229 (11)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.457sec

checking: AG [E [p9<=p1 U 6<=p33]]
normalized: ~ [E [true U ~ [E [p9<=p1 U 6<=p33]]]]

abstracting: (6<=p33)
states: 697,028,729,078 (11)
abstracting: (p9<=p1)
states: 632,571,106,293 (11)
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.942sec

checking: EF [AG [A [E [5<=p14 U 8<=p30] U 1<=p18]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [E [5<=p14 U 8<=p30]] & ~ [1<=p18]]]]]]]]]

abstracting: (1<=p18)
states: 365,203,299,954 (11)
abstracting: (8<=p30)
states: 36,850 (4)
abstracting: (5<=p14)
states: 5,036,305,776 (9)
abstracting: (1<=p18)
states: 365,203,299,954 (11)
abstracting: (1<=p18)
states: 365,203,299,954 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.014sec

checking: EF [[E [p5<=8 U p2<=p18] & AG [p5<=7]]]
normalized: E [true U [~ [E [true U ~ [p5<=7]]] & E [p5<=8 U p2<=p18]]]

abstracting: (p2<=p18)
states: 138,107,157,585 (11)
abstracting: (p5<=8)
states: 153,496,099,547 (11)
abstracting: (p5<=7)
states: 58,569,619,476 (10)
-> the formula is FALSE

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

MC time: 0m54.729sec

checking: [AG [[EG [AX [EG [p36<=p24]]] | EF [p30<=p15]]] & EF [AG [[p24<=4 | p25<=0]]]]
normalized: [E [true U ~ [E [true U ~ [[p24<=4 | p25<=0]]]]] & ~ [E [true U ~ [[E [true U p30<=p15] | EG [~ [EX [~ [EG [p36<=p24]]]]]]]]]]

abstracting: (p36<=p24)
states: 571,063,375,118 (11)
..
EG iterations: 2
...
EG iterations: 2
abstracting: (p30<=p15)
states: 646,135,524,298 (11)
abstracting: (p25<=0)
states: 655,918,803,499 (11)
abstracting: (p24<=4)
states: 817,758,163,547 (11)
-> the formula is TRUE

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

MC time: 1m 7.232sec

checking: EF [[4<=p13 & [EX [~ [6<=p3]] | [7<=p8 & [AG [p34<=p36] | AF [p10<=p17]]]]]]
normalized: E [true U [4<=p13 & [[7<=p8 & [~ [EG [~ [p10<=p17]]] | ~ [E [true U ~ [p34<=p36]]]]] | EX [~ [6<=p3]]]]]

abstracting: (6<=p3)
states: 1,634,632,128 (9)
.abstracting: (p34<=p36)
states: 50,104,962,872 (10)
abstracting: (p10<=p17)
states: 592,073,565,115 (11)
..
EG iterations: 2
abstracting: (7<=p8)
states: 11,928,976 (7)
abstracting: (4<=p13)
states: 697,772,681 (8)
-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.630sec

checking: AX [[~ [3<=p24] & [EF [EG [p26<=p38]] & [EF [8<=p16] | [p16<=p33 & EX [3<=p32]]]]]]
normalized: ~ [EX [~ [[[[[p16<=p33 & EX [3<=p32]] | E [true U 8<=p16]] & E [true U EG [p26<=p38]]] & ~ [3<=p24]]]]]

abstracting: (3<=p24)
states: 53,746,751,025 (10)
abstracting: (p26<=p38)
states: 679,660,273,760 (11)
..
EG iterations: 2
abstracting: (8<=p16)
states: 31,266,093 (7)
abstracting: (3<=p32)
states: 58,569,550,836 (10)
.abstracting: (p16<=p33)
states: 815,832,200,528 (11)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-10-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.802sec

checking: AG [EF [[EF [~ [p26<=p38]] | [A [~ [p2<=6] U AF [7<=p18]] | [p35<=8 & [EG [3<=p10] | [AG [p8<=6] | p10<=3]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p35<=8 & [[p10<=3 | ~ [E [true U ~ [p8<=6]]]] | EG [3<=p10]]] | [~ [EG [EG [~ [7<=p18]]]] & ~ [E [EG [~ [7<=p18]] U [p2<=6 & EG [~ [7<=p18]]]]]]] | E [true U ~ [p26<=p38]]]]]]]

abstracting: (p26<=p38)
states: 679,660,273,760 (11)
abstracting: (7<=p18)
states: 224,296,547 (8)
.
EG iterations: 1
abstracting: (p2<=6)
states: 560,005,398,748 (11)
abstracting: (7<=p18)
states: 224,296,547 (8)
.
EG iterations: 1
abstracting: (7<=p18)
states: 224,296,547 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p10)
states: 16,954,682,307 (10)
..
EG iterations: 2
abstracting: (p8<=6)
states: 822,633,956,519 (11)
abstracting: (p10<=3)
states: 819,794,592,092 (11)
abstracting: (p35<=8)
states: 401,519,165,453 (11)
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.315sec

checking: AG [~ [A [[[[3<=p2 & AX [p22<=p18]] | ~ [EG [p25<=p32]]] & ~ [E [6<=p2 U p7<=2]]] U EG [AX [p33<=p36]]]]]
normalized: ~ [E [true U [~ [EG [~ [EG [~ [EX [~ [p33<=p36]]]]]]] & ~ [E [~ [EG [~ [EX [~ [p33<=p36]]]]] U [~ [[~ [E [6<=p2 U p7<=2]] & [~ [EG [p25<=p32]] | [3<=p2 & ~ [EX [~ [p22<=p18]]]]]]] & ~ [EG [~ [EX [~ [p33<=p36]]]]]]]]]]]

abstracting: (p33<=p36)
states: 3,568,711,868 (9)
........
EG iterations: 7
abstracting: (p22<=p18)
states: 567,524,406,986 (11)
.abstracting: (3<=p2)
states: 582,313,650,820 (11)
abstracting: (p25<=p32)
states: 718,811,807,110 (11)
.
EG iterations: 1
abstracting: (p7<=2)
states: 802,513,979,899 (11)
abstracting: (6<=p2)
states: 342,172,093,700 (11)
abstracting: (p33<=p36)
states: 3,568,711,868 (9)
........
EG iterations: 7
abstracting: (p33<=p36)
states: 3,568,711,868 (9)
........
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 4.482sec

checking: AG [[p9<=p10 & [[AF [5<=p28] | EF [[p31<=1 & p12<=8]]] | [~ [7<=p11] | [5<=p24 & [p26<=5 | 8<=p31]]]]]]
normalized: ~ [E [true U ~ [[p9<=p10 & [[[5<=p24 & [p26<=5 | 8<=p31]] | ~ [7<=p11]] | [E [true U [p31<=1 & p12<=8]] | ~ [EG [~ [5<=p28]]]]]]]]]

abstracting: (5<=p28)
states: 14,881,718,728 (10)
.
EG iterations: 1
abstracting: (p12<=8)
states: 822,643,942,215 (11)
abstracting: (p31<=1)
states: 669,149,785,948 (11)
abstracting: (7<=p11)
states: 1,214,557,609 (9)
abstracting: (8<=p31)
states: 62,070,469 (7)
abstracting: (p26<=5)
states: 822,638,037,429 (11)
abstracting: (5<=p24)
states: 4,887,721,948 (9)
abstracting: (p9<=p10)
states: 610,235,090,628 (11)
-> the formula is FALSE

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

MC time: 0m43.951sec

checking: A [[A [~ [p28<=8] U [AX [A [p38<=0 U 6<=p6]] & AX [AG [p20<=p6]]]] & [p3<=p33 | p9<=p4]] U ~ [EF [6<=p2]]]
normalized: [~ [EG [E [true U 6<=p2]]] & ~ [E [E [true U 6<=p2] U [~ [[[p3<=p33 | p9<=p4] & [~ [EG [~ [[~ [EX [E [true U ~ [p20<=p6]]]] & ~ [EX [~ [[~ [EG [~ [6<=p6]]] & ~ [E [~ [6<=p6] U [~ [p38<=0] & ~ [6<=p6]]]]]]]]]]]] & ~ [E [~ [[~ [EX [E [true U ~ [p20<=p6]]]] & ~ [EX [~ [[~ [EG [~ [6<=p6]]] & ~ [E [~ [6<=p6] U [~ [p38<=0] & ~ [6<=p6]]]]]]]]]] U [p28<=8 & ~ [[~ [EX [E [true U ~ [p20<=p6]]]] & ~ [EX [~ [[~ [EG [~ [6<=p6]]] & ~ [E [~ [6<=p6] U [~ [p38<=0] & ~ [6<=p6]]]]]]]]]]]]]]]] & E [true U 6<=p2]]]]]

abstracting: (6<=p2)
states: 342,172,093,700 (11)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (p38<=0)
states: 669,149,884,618 (11)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
.
EG iterations: 1
.abstracting: (p20<=p6)
states: 764,034,815,169 (11)
.abstracting: (p28<=8)
states: 822,625,067,376 (11)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (p38<=0)
states: 669,149,884,618 (11)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
.
EG iterations: 1
.abstracting: (p20<=p6)
states: 764,034,815,169 (11)
.abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (p38<=0)
states: 669,149,884,618 (11)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
abstracting: (6<=p6)
states: 17,671,026,134 (10)
.
EG iterations: 1
.abstracting: (p20<=p6)
states: 764,034,815,169 (11)
..
EG iterations: 1
abstracting: (p9<=p4)
states: 642,683,648,655 (11)
abstracting: (p3<=p33)
states: 821,477,456,052 (11)
abstracting: (6<=p2)
states: 342,172,093,700 (11)
abstracting: (6<=p2)
states: 342,172,093,700 (11)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m42.612sec

checking: [AG [[[AX [~ [7<=p4]] | EG [AX [~ [p32<=4]]]] | [p2<=p38 | p21<=p37]]] & [~ [A [p24<=7 U ~ [AF [p14<=p34]]]] & EG [AG [~ [8<=p25]]]]]
normalized: [[EG [~ [E [true U 8<=p25]]] & ~ [[~ [EG [~ [EG [~ [p14<=p34]]]]] & ~ [E [~ [EG [~ [p14<=p34]]] U [~ [p24<=7] & ~ [EG [~ [p14<=p34]]]]]]]]] & ~ [E [true U ~ [[[p2<=p38 | p21<=p37] | [EG [~ [EX [p32<=4]]] | ~ [EX [7<=p4]]]]]]]]

abstracting: (7<=p4)
states: 359,869,957 (8)
.abstracting: (p32<=4)
states: 816,465,321,428 (11)
...
EG iterations: 2
abstracting: (p21<=p37)
states: 778,039,579,280 (11)
abstracting: (p2<=p38)
states: 96,879,463,402 (10)
abstracting: (p14<=p34)
states: 817,589,955,787 (11)
.
EG iterations: 1
abstracting: (p24<=7)
states: 822,616,517,755 (11)
abstracting: (p14<=p34)
states: 817,589,955,787 (11)
.
EG iterations: 1
abstracting: (p14<=p34)
states: 817,589,955,787 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (8<=p25)
states: 29,456 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Angiogenesis-PT-10-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m14.915sec

totally nodes used: 63400936 (6.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1768301586 718657795 2486959381
used/not used/entry size/cache size: 67101488 7376 16 1024MB
basic ops cache: hits/miss/sum: 148255314 69855770 218111084
used/not used/entry size/cache size: 16629555 147661 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: 5892403 2430561 8322964
used/not used/entry size/cache size: 2088089 6300519 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 31034051
1 22790595
2 8964276
3 2620123
4 771596
5 279529
6 133609
7 93580
8 74814
9 55396
>= 10 291295

Total processing time: 14m55.146sec


BK_STOP 1678684855521

--------------------
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:11953 (186), effective:901 (14)

initing FirstDep: 0m 0.000sec


iterations count:134 (2), effective:7 (0)

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

iterations count:5590 (87), effective:429 (6)

iterations count:7297 (114), effective:564 (8)

iterations count:10002 (156), effective:825 (12)

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

iterations count:7051 (110), effective:542 (8)

iterations count:1839 (28), effective:154 (2)

iterations count:6271 (97), effective:497 (7)

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

iterations count:121 (1), effective:3 (0)

iterations count:1817 (28), effective:167 (2)

iterations count:16664 (260), effective:1283 (20)

iterations count:248 (3), effective:8 (0)

iterations count:2857 (44), effective:242 (3)

iterations count:7321 (114), effective:566 (8)

iterations count:10002 (156), effective:825 (12)

iterations count:959 (14), effective:67 (1)

iterations count:6499 (101), effective:506 (7)

iterations count:6736 (105), effective:552 (8)

iterations count:16183 (252), effective:1284 (20)

iterations count:995 (15), effective:65 (1)

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

iterations count:8998 (140), effective:710 (11)

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

iterations count:12475 (194), effective:1005 (15)

iterations count:650 (10), effective:65 (1)

iterations count:757 (11), effective:74 (1)

iterations count:25020 (390), effective:2061 (32)

iterations count:2367 (36), effective:194 (3)

iterations count:1080 (16), effective:76 (1)

iterations count:1380 (21), effective:105 (1)

iterations count:1824 (28), effective:132 (2)

iterations count:4046 (63), effective:310 (4)

iterations count:1824 (28), effective:132 (2)

iterations count:4046 (63), effective:310 (4)

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

iterations count:1824 (28), effective:132 (2)

iterations count:4046 (63), effective:310 (4)

iterations count:1380 (21), effective:105 (1)

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

iterations count:1380 (21), effective:105 (1)

iterations count:11249 (175), effective:864 (13)

iterations count:9415 (147), effective:740 (11)

iterations count:11688 (182), effective:926 (14)

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="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-10, 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-167813598900329"
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 [ "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 ;