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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.2K 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 14K Feb 26 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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-05-CTLCardinality-00
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-01
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-02
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-03
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-04
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-05
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-06
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-07
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-08
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-09
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-10
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-11
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-12
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-13
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-14
FORMULA_NAME Angiogenesis-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678683859340

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-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:04:22] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-13 05:04:22] [INFO ] Transformed 39 places.
[2023-03-13 05:04:22] [INFO ] Transformed 64 transitions.
[2023-03-13 05:04:22] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-05-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 10 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:04:22] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-13 05:04:22] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-13 05:04:22] [INFO ] Invariant cache hit.
[2023-03-13 05:04:23] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2023-03-13 05:04:23] [INFO ] Invariant cache hit.
[2023-03-13 05:04:23] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 39/39 places, 64/64 transitions.
Support contains 38 out of 39 places after structural reductions.
[2023-03-13 05:04:23] [INFO ] Flatten gal took : 29 ms
[2023-03-13 05:04:23] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:04:23] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 83) seen :61
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 05:04:24] [INFO ] Invariant cache hit.
[2023-03-13 05:04:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:04:24] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :5 sat :2 real:13
[2023-03-13 05:04:24] [INFO ] After 35ms SMT Verify possible using trap constraints in real domain returned unsat :5 sat :2 real:13
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 05:04:24] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :2 real:13
[2023-03-13 05:04:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:04:24] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :7
[2023-03-13 05:04:24] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2023-03-13 05:04:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 05:04:24] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 05:04:24] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :6
Fused 20 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 8 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 34 transition count 60
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 13 place count 34 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 31 transition count 56
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 31 transition count 53
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 31 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 31 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 30 transition count 49
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 30 transition count 46
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 27 transition count 44
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 27 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 25 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 40 place count 25 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 42 place count 25 transition count 42
Applied a total of 42 rules in 26 ms. Remains 25 /39 variables (removed 14) and now considering 42/64 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 25/39 places, 42/64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 05:04:24] [INFO ] Flow matrix only has 40 transitions (discarded 2 similar events)
// Phase 1: matrix 40 rows 25 cols
[2023-03-13 05:04:24] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 05:04:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 05:04:24] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:04:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 05:04:24] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 05:04:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 05:04:24] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 05:04:24] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 05:04:24] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 42/42 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t22 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 rules applied. Total rules applied 4 place count 23 transition count 38
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 19 transition count 35
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 19 transition count 32
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 3 with 2 rules applied. Total rules applied 16 place count 18 transition count 32
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 18 transition count 30
Applied a total of 18 rules in 4 ms. Remains 18 /25 variables (removed 7) and now considering 30/42 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 18/25 places, 30/42 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 66733 steps, run visited all 1 properties in 75 ms. (steps per millisecond=889 )
Probabilistic random walk after 66733 steps, saw 8664 distinct states, run finished after 75 ms. (steps per millisecond=889 ) properties seen :1
Successfully simplified 14 atomic propositions for a total of 15 simplifications.
[2023-03-13 05:04:24] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:04:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Angiogenesis-PT-05-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:04:24] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:04:24] [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.0 ms
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 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 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 6 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 6 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:25] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 8415 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=765 )
FORMULA Angiogenesis-PT-05-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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 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 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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 05:04:25] [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
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 38 transition count 64
Applied a total of 5 rules in 3 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:25] [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 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 1 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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 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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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
Applied a total of 4 rules in 2 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 2 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [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:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:04:25] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:25] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 05:04:25] [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 2946 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.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.951sec


RS generation: 0m 0.305sec


-> reachability set: #nodes 10921 (1.1e+04) #states 42,734,935 (7)



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

checking: EF [EG [~ [p23<=p3]]]
normalized: E [true U EG [~ [p23<=p3]]]

abstracting: (p23<=p3)
states: 39,669,931 (7)
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 2.455sec

checking: [EX [0<=0] & AX [AG [AF [p27<=p9]]]]
normalized: [~ [EX [E [true U EG [~ [p27<=p9]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (p27<=p9)
states: 41,732,400 (7)
..
EG iterations: 2
.-> the formula is FALSE

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

MC time: 0m 0.426sec

checking: EF [EG [AG [EF [p16<=p18]]]]
normalized: E [true U EG [~ [E [true U ~ [E [true U p16<=p18]]]]]]

abstracting: (p16<=p18)
states: 32,554,361 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA Angiogenesis-PT-05-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: A [3<=p28 U A [AG [3<=p14] U [AG [AX [p3<=4]] | ~ [EX [0<=0]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]] & ~ [E [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]] U [E [true U ~ [3<=p14]] & ~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]] & ~ [E [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]] U [E [true U ~ [3<=p14]] & ~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]]]]] U [~ [3<=p28] & ~ [[~ [EG [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]] & ~ [E [~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]] U [E [true U ~ [3<=p14]] & ~ [[~ [EX [0<=0]] | ~ [E [true U EX [~ [p3<=4]]]]]]]]]]]]]]]

abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (3<=p14)
states: 512,541 (5)
abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
..
EG iterations: 1
abstracting: (3<=p28)
states: 1,170,290 (6)
abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (3<=p14)
states: 512,541 (5)
abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
..
EG iterations: 1
abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (3<=p14)
states: 512,541 (5)
abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
.abstracting: (p3<=4)
states: 42,727,493 (7)
.abstracting: (0<=0)
states: 42,734,935 (7)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.863sec

checking: ~ [E [EF [~ [AF [4<=p8]]] U AG [p12<=p10]]]
normalized: ~ [E [E [true U EG [~ [4<=p8]]] U ~ [E [true U ~ [p12<=p10]]]]]

abstracting: (p12<=p10)
states: 32,167,633 (7)
abstracting: (4<=p8)
states: 6,189 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 1.111sec

checking: EF [[EG [p26<=3] | [4<=p37 & p35<=p33]]]
normalized: E [true U [[4<=p37 & p35<=p33] | EG [p26<=3]]]

abstracting: (p26<=3)
states: 42,734,452 (7)
.
EG iterations: 1
abstracting: (p35<=p33)
states: 22,316,315 (7)
abstracting: (4<=p37)
states: 100,991 (5)
-> the formula is TRUE

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

MC time: 0m 0.027sec

checking: EG [~ [A [[p33<=4 | [EX [4<=p10] | AX [2<=p16]]] U 2<=p30]]]
normalized: EG [~ [[~ [EG [~ [2<=p30]]] & ~ [E [~ [2<=p30] U [~ [[p33<=4 | [~ [EX [~ [2<=p16]]] | EX [4<=p10]]]] & ~ [2<=p30]]]]]]]

abstracting: (2<=p30)
states: 433,155 (5)
abstracting: (4<=p10)
states: 895
.abstracting: (2<=p16)
states: 2,965,900 (6)
.abstracting: (p33<=4)
states: 32,493,470 (7)
abstracting: (2<=p30)
states: 433,155 (5)
abstracting: (2<=p30)
states: 433,155 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.421sec

checking: AG [A [~ [[p32<=p11 & EG [p24<=p27]]] U ~ [AX [2<=p16]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [~ [2<=p16]]]]] & ~ [E [~ [EX [~ [2<=p16]]] U [[p32<=p11 & EG [p24<=p27]] & ~ [EX [~ [2<=p16]]]]]]]]]]

abstracting: (2<=p16)
states: 2,965,900 (6)
.abstracting: (p24<=p27)
states: 30,559,949 (7)
..
EG iterations: 2
abstracting: (p32<=p11)
states: 33,737,900 (7)
abstracting: (2<=p16)
states: 2,965,900 (6)
.abstracting: (2<=p16)
states: 2,965,900 (6)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.536sec

checking: E [~ [[EX [AF [~ [p17<=p7]]] & EF [1<=p18]]] U AX [~ [p16<=p0]]]
normalized: E [~ [[E [true U 1<=p18] & EX [~ [EG [p17<=p7]]]]] U ~ [EX [p16<=p0]]]

abstracting: (p16<=p0)
states: 39,812,035 (7)
.abstracting: (p17<=p7)
states: 39,149,953 (7)
.
EG iterations: 1
.abstracting: (1<=p18)
states: 12,688,021 (7)
-> the formula is TRUE

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

MC time: 0m 3.846sec

checking: EF [[AG [~ [p26<=p24]] & [AF [[A [p7<=p31 U 3<=p35] | AX [p5<=p32]]] | EG [[EF [p6<=p4] | AG [p31<=3]]]]]]
normalized: E [true U [[EG [[~ [E [true U ~ [p31<=3]]] | E [true U p6<=p4]]] | ~ [EG [~ [[~ [EX [~ [p5<=p32]]] | [~ [EG [~ [3<=p35]]] & ~ [E [~ [3<=p35] U [~ [p7<=p31] & ~ [3<=p35]]]]]]]]]] & ~ [E [true U p26<=p24]]]]

abstracting: (p26<=p24)
states: 39,540,083 (7)
abstracting: (3<=p35)
states: 39,888,959 (7)
abstracting: (p7<=p31)
states: 36,417,743 (7)
abstracting: (3<=p35)
states: 39,888,959 (7)
abstracting: (3<=p35)
states: 39,888,959 (7)
..
EG iterations: 2
abstracting: (p5<=p32)
states: 44,372 (4)
..
EG iterations: 1
abstracting: (p6<=p4)
states: 22,802,519 (7)
abstracting: (p31<=3)
states: 42,633,685 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA Angiogenesis-PT-05-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.604sec

checking: [EG [[EX [AG [2<=p31]] | [EG [~ [5<=p19]] | AG [[[~ [3<=p1] & EX [p19<=2]] | [~ [p38<=1] & ~ [5<=p0]]]]]]] & E [~ [1<=p30] U AG [[~ [[~ [5<=p23] | A [3<=p1 U p7<=p10]]] & AG [~ [p7<=p10]]]]]]
normalized: [E [~ [1<=p30] U ~ [E [true U ~ [[~ [E [true U p7<=p10]] & ~ [[[~ [EG [~ [p7<=p10]]] & ~ [E [~ [p7<=p10] U [~ [3<=p1] & ~ [p7<=p10]]]]] | ~ [5<=p23]]]]]]]] & EG [[[~ [E [true U ~ [[[~ [5<=p0] & ~ [p38<=1]] | [EX [p19<=2] & ~ [3<=p1]]]]]] | EG [~ [5<=p19]]] | EX [~ [E [true U ~ [2<=p31]]]]]]]

abstracting: (2<=p31)
states: 3,537,642 (6)
.abstracting: (5<=p19)
states: 6
.
EG iterations: 1
abstracting: (3<=p1)
states: 350,216 (5)
abstracting: (p19<=2)
states: 42,718,678 (7)
.abstracting: (p38<=1)
states: 42,633,944 (7)
abstracting: (5<=p0)
states: 5,271,389 (6)
.
EG iterations: 1
abstracting: (5<=p23)
states: 6
abstracting: (p7<=p10)
states: 35,327,815 (7)
abstracting: (3<=p1)
states: 350,216 (5)
abstracting: (p7<=p10)
states: 35,327,815 (7)
abstracting: (p7<=p10)
states: 35,327,815 (7)
..
EG iterations: 2
abstracting: (p7<=p10)
states: 35,327,815 (7)
abstracting: (1<=p30)
states: 5,462,898 (6)
-> the formula is FALSE

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

MC time: 0m 1.711sec

checking: ~ [A [AG [AX [[[p11<=p32 & 2<=p18] | [p21<=1 & 2<=p29]]]] U [E [AX [p16<=p1] U [~ [EF [p6<=p32]] | [[p7<=p29 & 3<=p24] & [p37<=p22 & p38<=p19]]]] & A [[A [p22<=p30 U 2<=p25] & EX [p29<=3]] U [EF [p27<=p3] & [p19<=0 | p34<=3]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [EG [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]] & ~ [E [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]] U [~ [[EX [p29<=3] & [~ [EG [~ [2<=p25]]] & ~ [E [~ [2<=p25] U [~ [p22<=p30] & ~ [2<=p25]]]]]]] & ~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]]]] & E [~ [EX [~ [p16<=p1]]] U [[[p37<=p22 & p38<=p19] & [p7<=p29 & 3<=p24]] | ~ [E [true U p6<=p32]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]] & ~ [E [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]] U [~ [[EX [p29<=3] & [~ [EG [~ [2<=p25]]] & ~ [E [~ [2<=p25] U [~ [p22<=p30] & ~ [2<=p25]]]]]]] & ~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]]]] & E [~ [EX [~ [p16<=p1]]] U [[[p37<=p22 & p38<=p19] & [p7<=p29 & 3<=p24]] | ~ [E [true U p6<=p32]]]]]] U [~ [[[~ [EG [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]] & ~ [E [~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]] U [~ [[EX [p29<=3] & [~ [EG [~ [2<=p25]]] & ~ [E [~ [2<=p25] U [~ [p22<=p30] & ~ [2<=p25]]]]]]] & ~ [[[p19<=0 | p34<=3] & E [true U p27<=p3]]]]]]] & E [~ [EX [~ [p16<=p1]]] U [[[p37<=p22 & p38<=p19] & [p7<=p29 & 3<=p24]] | ~ [E [true U p6<=p32]]]]]] & E [true U EX [~ [[[p21<=1 & 2<=p29] | [p11<=p32 & 2<=p18]]]]]]]]]]

abstracting: (2<=p18)
states: 2,965,900 (6)
abstracting: (p11<=p32)
states: 29,105,591 (7)
abstracting: (2<=p29)
states: 5,349,501 (6)
abstracting: (p21<=1)
states: 42,723,124 (7)
.abstracting: (p6<=p32)
states: 22,802,022 (7)
abstracting: (3<=p24)
states: 488,488 (5)
abstracting: (p7<=p29)
states: 37,985,239 (7)
abstracting: (p38<=p19)
states: 39,450,400 (7)
abstracting: (p37<=p22)
states: 32,479,935 (7)
abstracting: (p16<=p1)
states: 32,840,605 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (p22<=p30)
states: 31,516,801 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (2<=p25)
states: 307,322 (5)
.
EG iterations: 1
abstracting: (p29<=3)
states: 42,578,720 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
..
EG iterations: 2
abstracting: (p6<=p32)
states: 22,802,022 (7)
abstracting: (3<=p24)
states: 488,488 (5)
abstracting: (p7<=p29)
states: 37,985,239 (7)
abstracting: (p38<=p19)
states: 39,450,400 (7)
abstracting: (p37<=p22)
states: 32,479,935 (7)
abstracting: (p16<=p1)
states: 32,840,605 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (p22<=p30)
states: 31,516,801 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (2<=p25)
states: 307,322 (5)
.
EG iterations: 1
abstracting: (p29<=3)
states: 42,578,720 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
..
EG iterations: 2
abstracting: (p6<=p32)
states: 22,802,022 (7)
abstracting: (3<=p24)
states: 488,488 (5)
abstracting: (p7<=p29)
states: 37,985,239 (7)
abstracting: (p38<=p19)
states: 39,450,400 (7)
abstracting: (p37<=p22)
states: 32,479,935 (7)
abstracting: (p16<=p1)
states: 32,840,605 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (p22<=p30)
states: 31,516,801 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (2<=p25)
states: 307,322 (5)
.
EG iterations: 1
abstracting: (p29<=3)
states: 42,578,720 (7)
.abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
abstracting: (p27<=p3)
states: 41,824,252 (7)
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p19<=0)
states: 38,494,099 (7)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 3.763sec

checking: E [[[EX [[A [EG [4<=p33] U E [p24<=p38 U p6<=p7]] | EF [EX [3<=p13]]]] | A [p22<=p0 U AX [[p22<=p20 & 3<=p32]]]] | [EX [E [p17<=1 U p34<=3]] | [EF [AG [3<=p13]] & [EX [2<=p19] | AF [1<=p27]]]]] U [AX [[EF [5<=p10] | [EX [p12<=3] & A [p19<=p2 U p20<=2]]]] & [~ [[EF [p36<=2] & [~ [E [3<=p0 U 2<=p25]] & ~ [3<=p1]]]] & p16<=0]]]
normalized: E [[[[[~ [EG [~ [1<=p27]]] | EX [2<=p19]] & E [true U ~ [E [true U ~ [3<=p13]]]]] | EX [E [p17<=1 U p34<=3]]] | [[~ [EG [EX [~ [[p22<=p20 & 3<=p32]]]]] & ~ [E [EX [~ [[p22<=p20 & 3<=p32]]] U [~ [p22<=p0] & EX [~ [[p22<=p20 & 3<=p32]]]]]]] | EX [[E [true U EX [3<=p13]] | [~ [EG [~ [E [p24<=p38 U p6<=p7]]]] & ~ [E [~ [E [p24<=p38 U p6<=p7]] U [~ [EG [4<=p33]] & ~ [E [p24<=p38 U p6<=p7]]]]]]]]]] U [~ [EX [~ [[[[~ [EG [~ [p20<=2]]] & ~ [E [~ [p20<=2] U [~ [p19<=p2] & ~ [p20<=2]]]]] & EX [p12<=3]] | E [true U 5<=p10]]]]] & [p16<=0 & ~ [[[~ [3<=p1] & ~ [E [3<=p0 U 2<=p25]]] & E [true U p36<=2]]]]]]

abstracting: (p36<=2)
states: 42,015,515 (7)
abstracting: (2<=p25)
states: 307,322 (5)
abstracting: (3<=p0)
states: 19,822,700 (7)
abstracting: (3<=p1)
states: 350,216 (5)
abstracting: (p16<=0)
states: 30,046,914 (7)
abstracting: (5<=p10)
states: 6
abstracting: (p12<=3)
states: 42,696,480 (7)
.abstracting: (p20<=2)
states: 42,718,678 (7)
abstracting: (p19<=p2)
states: 41,927,790 (7)
abstracting: (p20<=2)
states: 42,718,678 (7)
abstracting: (p20<=2)
states: 42,718,678 (7)
.
EG iterations: 1
.abstracting: (p6<=p7)
states: 20,220,554 (7)
abstracting: (p24<=p38)
states: 31,176,707 (7)
abstracting: (4<=p33)
states: 25,664,142 (7)
.
EG iterations: 1
abstracting: (p6<=p7)
states: 20,220,554 (7)
abstracting: (p24<=p38)
states: 31,176,707 (7)
abstracting: (p6<=p7)
states: 20,220,554 (7)
abstracting: (p24<=p38)
states: 31,176,707 (7)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,804 (4)
..abstracting: (3<=p32)
states: 718,700 (5)
abstracting: (p22<=p20)
states: 31,178,963 (7)
.abstracting: (p22<=p0)
states: 39,882,275 (7)
abstracting: (3<=p32)
states: 718,700 (5)
abstracting: (p22<=p20)
states: 31,178,963 (7)
.abstracting: (3<=p32)
states: 718,700 (5)
abstracting: (p22<=p20)
states: 31,178,963 (7)
..
EG iterations: 1
abstracting: (p34<=3)
states: 33,394,679 (7)
abstracting: (p17<=1)
states: 42,420,175 (7)
.abstracting: (3<=p13)
states: 13,804 (4)
abstracting: (2<=p19)
states: 314,760 (5)
.abstracting: (1<=p27)
states: 1,161,840 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 5.374sec

totally nodes used: 5535986 (5.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 53675821 39068469 92744290
used/not used/entry size/cache size: 32036034 35072830 16 1024MB
basic ops cache: hits/miss/sum: 7172979 5402674 12575653
used/not used/entry size/cache size: 6745732 10031484 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: 226865 175907 402772
used/not used/entry size/cache size: 173903 8214705 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 62603573
1 4108922
2 301007
3 40663
4 16609
5 8008
6 5721
7 4467
8 2895
9 2025
>= 10 14974

Total processing time: 0m28.037sec


BK_STOP 1678683893597

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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:5829 (91), effective:437 (6)

initing FirstDep: 0m 0.000sec


iterations count:2295 (35), effective:187 (2)

iterations count:1943 (30), effective:142 (2)

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

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

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

iterations count:8500 (132), effective:646 (10)

iterations count:707 (11), effective:50 (0)

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

iterations count:2266 (35), effective:191 (2)

iterations count:296 (4), effective:19 (0)

iterations count:1295 (20), effective:109 (1)

iterations count:779 (12), effective:62 (0)

iterations count:5514 (86), effective:426 (6)

iterations count:921 (14), effective:58 (0)

iterations count:6646 (103), effective:598 (9)

iterations count:2354 (36), effective:179 (2)

iterations count:951 (14), effective:66 (1)

iterations count:1640 (25), effective:129 (2)

iterations count:3274 (51), effective:250 (3)

iterations count:5585 (87), effective:454 (7)

iterations count:973 (15), effective:77 (1)

iterations count:7077 (110), effective:571 (8)

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

iterations count:391 (6), effective:33 (0)

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

iterations count:3503 (54), effective:279 (4)

iterations count:1624 (25), effective:129 (2)

iterations count:8096 (126), effective:656 (10)

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

iterations count:1758 (27), effective:134 (2)

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

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

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

iterations count:1624 (25), effective:129 (2)

iterations count:8096 (126), effective:656 (10)

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

iterations count:1758 (27), effective:134 (2)

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

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

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

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

iterations count:1624 (25), effective:129 (2)

iterations count:8096 (126), effective:656 (10)

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

iterations count:1758 (27), effective:134 (2)

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

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

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

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

iterations count:3053 (47), effective:225 (3)

iterations count:6124 (95), effective:478 (7)

iterations count:2637 (41), effective:187 (2)

iterations count:1936 (30), effective:147 (2)

iterations count:1936 (30), effective:147 (2)

iterations count:1923 (30), effective:137 (2)

iterations count:1936 (30), effective:147 (2)

iterations count:3575 (55), effective:273 (4)

iterations count:3588 (56), effective:303 (4)

iterations count:594 (9), effective:46 (0)

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

iterations count:3361 (52), effective:255 (3)

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-05"
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-05, 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-167813598900321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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