fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813598900354
Last Updated
May 14, 2023

About the Execution of Marcie+red for Angiogenesis-PT-25

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15541.892 3600000.00 3637868.00 94.30 ????TTF??FT???TT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598900354.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-25, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.8K Feb 26 14:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 14:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 14:49 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 25K 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 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 14:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 14:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-25-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678685150816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-25
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:25:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:25:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:25:53] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-13 05:25:53] [INFO ] Transformed 39 places.
[2023-03-13 05:25:53] [INFO ] Transformed 64 transitions.
[2023-03-13 05:25:53] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 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.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Applied a total of 1 rules in 13 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:25:53] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-13 05:25:53] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-13 05:25:53] [INFO ] Invariant cache hit.
[2023-03-13 05:25:53] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-13 05:25:53] [INFO ] Invariant cache hit.
[2023-03-13 05:25:53] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/39 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 38/39 places, 64/64 transitions.
Support contains 37 out of 38 places after structural reductions.
[2023-03-13 05:25:54] [INFO ] Flatten gal took : 30 ms
[2023-03-13 05:25:54] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:25:54] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 36 out of 38 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 59) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-13 05:25:54] [INFO ] Invariant cache hit.
[2023-03-13 05:25:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 05:25:54] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:12
[2023-03-13 05:25:54] [INFO ] After 83ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 05:25:54] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 05:25:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:25:54] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 05:25:55] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-13 05:25:55] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 22 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 64
Applied a total of 2 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 38/38 places, 64/64 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) 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
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:25:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 05:25:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:25:55] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:25:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 05:25:55] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 05:25:55] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-13 05:25:55] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 35 transition count 61
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 110 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 34 transition count 60
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 34 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 32 transition count 59
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 15 place count 32 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 32 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 32 transition count 53
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 23 place count 30 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 30 transition count 51
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 28 place count 30 transition count 51
Applied a total of 28 rules in 24 ms. Remains 30 /38 variables (removed 8) and now considering 51/64 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 30/38 places, 51/64 transitions.
Incomplete random walk after 10015 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Finished Best-First random walk after 1968 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=656 )
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 64
Applied a total of 2 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 12 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 36 transition count 63
Applied a total of 10 rules in 4 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 4 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Applied a total of 3 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 9409 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1568 )
FORMULA Angiogenesis-PT-25-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 4 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:25:55] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :0
Finished Best-First random walk after 7247 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1207 )
FORMULA Angiogenesis-PT-25-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:25:55] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:25:55] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 05:25:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 64 transitions and 184 arcs took 1 ms.
Total runtime 2806 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.898sec


RS generation: 0m58.344sec


-> reachability set: #nodes 258154 (2.6e+05) #states 43,090,329,340,850,957,348 (19)



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

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

abstracting: (p24<=0)
states: 24,845,668,166,791,282,593 (19)
.-> the formula is TRUE

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

MC time: 3m35.126sec

checking: AG [EF [[AX [EF [[p31<=0 | p34<=0]]] | p22<=0]]]
normalized: ~ [E [true U ~ [E [true U [p22<=0 | ~ [EX [~ [E [true U [p31<=0 | p34<=0]]]]]]]]]]

abstracting: (p34<=0)
states: 9,383,478,156 (9)
abstracting: (p31<=0)
states: 15,504,616,782,890,243,901 (19)
.abstracting: (p22<=0)
states: 24,845,668,166,791,282,593 (19)
-> the formula is TRUE

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

MC time: 0m31.813sec

checking: EF [AG [A [[1<=p24 & 1<=p27] U [1<=p13 & 1<=p33]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[1<=p13 & 1<=p33]]]] & ~ [E [~ [[1<=p13 & 1<=p33]] U [~ [[1<=p24 & 1<=p27]] & ~ [[1<=p13 & 1<=p33]]]]]]]]]]

abstracting: (1<=p33)
states: 43,022,583,839,115,058,008 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p27)
states: 32,448,021,583,910,809,524 (19)
abstracting: (1<=p24)
states: 18,244,661,174,059,674,755 (19)
abstracting: (1<=p33)
states: 43,022,583,839,115,058,008 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p33)
states: 43,022,583,839,115,058,008 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m39.162sec

checking: EF [EG [[1<=p26 & EG [[[[1<=p13 & 1<=p32] & [1<=p7 & 1<=p10]] | 1<=p15]]]]]
normalized: E [true U EG [[1<=p26 & EG [[1<=p15 | [[1<=p7 & 1<=p10] & [1<=p13 & 1<=p32]]]]]]]

abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p15)
states: 28,333,829,979,623,890,466 (19)
.
EG iterations: 1
abstracting: (1<=p26)
states: 11,526,218,635,994,019,506 (19)
..
EG iterations: 2
MC time: 4m51.095sec

checking: [AG [EX [~ [A [1<=p37 U [1<=p7 & 1<=p10]]]]] | E [[1<=p15 & [1<=p5 & 1<=p31]] U 1<=p15]]
normalized: [E [[1<=p15 & [1<=p5 & 1<=p31]] U 1<=p15] | ~ [E [true U ~ [EX [~ [[~ [EG [~ [[1<=p7 & 1<=p10]]]] & ~ [E [~ [[1<=p7 & 1<=p10]] U [~ [1<=p37] & ~ [[1<=p7 & 1<=p10]]]]]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p37)

before gc: list nodes free: 1354350

after gc: idd nodes used:1527475, unused:62472525; list nodes free:616029101
states: 17,309,086,114,977,806,612 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
.
EG iterations: 1
.MC time: 4m24.156sec

checking: EG [[1<=p8 | [AG [EF [[1<=p6 & 1<=p10]]] & E [~ [E [[1<=p19 & 1<=p30] U 1<=p15]] U AG [EF [1<=p16]]]]]]
normalized: EG [[1<=p8 | [E [~ [E [[1<=p19 & 1<=p30] U 1<=p15]] U ~ [E [true U ~ [E [true U 1<=p16]]]]] & ~ [E [true U ~ [E [true U [1<=p6 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p6)
states: 23,812,632,051,839,204,014 (19)
MC time: 4m 0.052sec

checking: E [A [[1<=p1 & ~ [EF [[1<=p15 | 1<=p21]]]] U [AX [AF [[1<=p5 & 1<=p31]]] | [~ [EF [[1<=p7 & 1<=p10]]] | 1<=p1]]] U AX [AX [EX [AX [1<=p18]]]]]
normalized: E [[~ [EG [~ [[[1<=p1 | ~ [E [true U [1<=p7 & 1<=p10]]]] | ~ [EX [EG [~ [[1<=p5 & 1<=p31]]]]]]]]] & ~ [E [~ [[[1<=p1 | ~ [E [true U [1<=p7 & 1<=p10]]]] | ~ [EX [EG [~ [[1<=p5 & 1<=p31]]]]]]] U [~ [[1<=p1 & ~ [E [true U [1<=p15 | 1<=p21]]]]] & ~ [[[1<=p1 | ~ [E [true U [1<=p7 & 1<=p10]]]] | ~ [EX [EG [~ [[1<=p5 & 1<=p31]]]]]]]]]]] U ~ [EX [EX [~ [EX [~ [EX [~ [1<=p18]]]]]]]]]

abstracting: (1<=p18)
states: 18,260,919,712,122,884,360 (19)
...
before gc: list nodes free: 3964721

after gc: idd nodes used:2359265, unused:61640735; list nodes free:607467389
.abstracting: (1<=p31)
states: 27,585,712,557,960,713,447 (19)
abstracting: (1<=p5)
states: 36,945,725,823,224,523,238 (19)
..
EG iterations: 2
.abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
MC time: 3m38.156sec

checking: [E [1<=p37 U [1<=p30 & 1<=p34]] & EF [[EX [[1<=p8 & 1<=p10]] | EX [A [[1<=p6 & 1<=p10] U A [[1<=p17 & 1<=p30] U 1<=p22]]]]]]
normalized: [E [true U [EX [[~ [EG [~ [[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [[1<=p17 & 1<=p30]] & ~ [1<=p22]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [[1<=p17 & 1<=p30]] & ~ [1<=p22]]]]]] U [~ [[1<=p6 & 1<=p10]] & ~ [[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [[1<=p17 & 1<=p30]] & ~ [1<=p22]]]]]]]]]]] | EX [[1<=p8 & 1<=p10]]]] & E [1<=p37 U [1<=p30 & 1<=p34]]]

abstracting: (1<=p34)
states: 43,090,329,331,467,479,192 (19)
abstracting: (1<=p30)
states: 27,585,712,558,001,904,467 (19)
abstracting: (1<=p37)
states: 17,309,086,114,977,806,612 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p8)
states: 23,812,635,694,402,765,444 (19)
.abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
abstracting: (1<=p30)
states: 27,585,712,558,001,904,467 (19)
abstracting: (1<=p17)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
.
EG iterations: 1
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p6)
states: 23,812,632,051,839,204,014 (19)
abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
abstracting: (1<=p30)
states: 27,585,712,558,001,904,467 (19)
abstracting: (1<=p17)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)
.
EG iterations: 1
MC time: 3m19.012sec

checking: ~ [E [[[AG [~ [EX [1<=p26]]] | AX [1<=p12]] | [p11<=0 | [1<=p30 & 1<=p34]]] U ~ [[~ [[[EG [[1<=p14 & 1<=p32]] & [1<=p13 & 1<=p33]] & [1<=p31 & [1<=p35 & EF [[1<=p13 & 1<=p33]]]]]] | [1<=p16 & ~ [[AX [1<=p12] & p29<=0]]]]]]]
normalized: ~ [E [[[p11<=0 | [1<=p30 & 1<=p34]] | [~ [EX [~ [1<=p12]]] | ~ [E [true U EX [1<=p26]]]]] U ~ [[[1<=p16 & ~ [[p29<=0 & ~ [EX [~ [1<=p12]]]]]] | ~ [[[1<=p31 & [1<=p35 & E [true U [1<=p13 & 1<=p33]]]] & [[1<=p13 & 1<=p33] & EG [[1<=p14 & 1<=p32]]]]]]]]]

abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p14)
states: 18,260,919,712,122,884,360 (19)
..
EG iterations: 2
abstracting: (1<=p33)
states: 43,022,583,839,115,058,008 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p33)
states: 43,022,583,839,115,058,008 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p35)
states: 27,585,712,558,001,904,467 (19)
abstracting: (1<=p31)
states: 27,585,712,557,960,713,447 (19)
abstracting: (1<=p12)
states: 18,260,916,510,293,964,242 (19)
.abstracting: (p29<=0)
states: 22,319,333,445,443,377,140 (19)
abstracting: (1<=p16)
states: 18,260,919,712,122,884,360 (19)
abstracting: (1<=p26)
states: 11,526,218,635,994,019,506 (19)
MC time: 3m 1.126sec

checking: AF [[EF [1<=p22] & [A [AF [AX [[1<=p31 & 1<=p34]]] U ~ [[A [[1<=p31 & 1<=p35] U 1<=p12] | [[1<=p7 & 1<=p33] & [1<=p14 & 1<=p32]]]]] & ~ [A [[AF [[1<=p31 & 1<=p34]] | EX [[1<=p13 & 1<=p31]]] U [1<=p3 & [1<=p26 & EX [1<=p21]]]]]]]]
normalized: ~ [EG [~ [[[~ [[~ [EG [~ [[1<=p3 & [1<=p26 & EX [1<=p21]]]]]] & ~ [E [~ [[1<=p3 & [1<=p26 & EX [1<=p21]]]] U [~ [[EX [[1<=p13 & 1<=p31]] | ~ [EG [~ [[1<=p31 & 1<=p34]]]]]] & ~ [[1<=p3 & [1<=p26 & EX [1<=p21]]]]]]]]] & [~ [EG [[[[1<=p14 & 1<=p32] & [1<=p7 & 1<=p33]] | [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p31 & 1<=p35]] & ~ [1<=p12]]]]]]]] & ~ [E [[[[1<=p14 & 1<=p32] & [1<=p7 & 1<=p33]] | [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p31 & 1<=p35]] & ~ [1<=p12]]]]]] U [EG [EX [~ [[1<=p31 & 1<=p34]]]] & [[[1<=p14 & 1<=p32] & [1<=p7 & 1<=p33]] | [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p31 & 1<=p35]] & ~ [1<=p12]]]]]]]]]]] & E [true U 1<=p22]]]]]

abstracting: (1<=p22)
states: 18,244,661,174,059,674,755 (19)

before gc: list nodes free: 782925

after gc: idd nodes used:3975108, unused:60024892; list nodes free:595117116
MC time: 2m44.011sec

checking: [EG [[p10<=0 | p33<=0]] | [AX [[[AG [p37<=0] | [EF [[p14<=0 | p33<=0]] | [p21<=0 & [p2<=0 | p4<=0]]]] & A [1<=p26 U [EF [[1<=p25 & 1<=p30]] & AX [1<=p3]]]]] | [EF [1<=p8] & [EF [EG [[1<=p13 & 1<=p32]]] & EG [A [1<=p11 U p36<=0]]]]]]
normalized: [[[[EG [[~ [EG [~ [p36<=0]]] & ~ [E [~ [p36<=0] U [~ [p36<=0] & ~ [1<=p11]]]]]] & E [true U EG [[1<=p13 & 1<=p32]]]] & E [true U 1<=p8]] | ~ [EX [~ [[[~ [EG [~ [[~ [EX [~ [1<=p3]]] & E [true U [1<=p25 & 1<=p30]]]]]] & ~ [E [~ [[~ [EX [~ [1<=p3]]] & E [true U [1<=p25 & 1<=p30]]]] U [~ [1<=p26] & ~ [[~ [EX [~ [1<=p3]]] & E [true U [1<=p25 & 1<=p30]]]]]]]] & [[[p21<=0 & [p2<=0 | p4<=0]] | E [true U [p14<=0 | p33<=0]]] | ~ [E [true U ~ [p37<=0]]]]]]]]] | EG [[p10<=0 | p33<=0]]]

abstracting: (p33<=0)
states: 67,745,501,735,899,340 (16)
abstracting: (p10<=0)
states: 10,610,453,586,422,452,111 (19)
.
EG iterations: 1
abstracting: (p37<=0)
states: 25,781,243,225,873,150,736 (19)
MC time: 2m29.082sec

checking: [EX [[[[~ [A [AF [1<=p15] U [[1<=p8 & 1<=p10] & [1<=p13 & 1<=p32]]]] | [AG [p22<=0] | 1<=p1]] & [1<=p30 & 1<=p34]] & [1<=p14 & [1<=p32 & EG [AX [p24<=0]]]]]] | [~ [E [[AG [1<=p18] | [~ [AF [1<=p11]] | EX [[1<=p36 | 1<=p15]]]] U 1<=p21]] & EG [p15<=0]]]
normalized: [[EG [p15<=0] & ~ [E [[[EX [[1<=p36 | 1<=p15]] | EG [~ [1<=p11]]] | ~ [E [true U ~ [1<=p18]]]] U 1<=p21]]] | EX [[[1<=p14 & [1<=p32 & EG [~ [EX [~ [p24<=0]]]]]] & [[1<=p30 & 1<=p34] & [[1<=p1 | ~ [E [true U ~ [p22<=0]]]] | ~ [[~ [EG [~ [[[1<=p13 & 1<=p32] & [1<=p8 & 1<=p10]]]]] & ~ [E [~ [[[1<=p13 & 1<=p32] & [1<=p8 & 1<=p10]]] U [EG [~ [1<=p15]] & ~ [[[1<=p13 & 1<=p32] & [1<=p8 & 1<=p10]]]]]]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p8)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p15)
states: 28,333,829,979,623,890,466 (19)
.
EG iterations: 1
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p8)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p8)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
.
EG iterations: 1
abstracting: (p22<=0)
states: 24,845,668,166,791,282,593 (19)
MC time: 2m16.194sec

checking: AF [E [[~ [E [1<=p6 U [1<=p29 | 1<=p3]]] | [AG [p37<=0] | AF [[[1<=p8 & 1<=p10] | [1<=p31 & 1<=p35]]]]] U [[EF [[[1<=p8 & 1<=p10] & [1<=p19 & 1<=p30]]] | p3<=0] & [1<=p12 | [[1<=p23 & [1<=p30 & 1<=p11]] & [[1<=p7 & 1<=p10] & [1<=p15 & AF [1<=p11]]]]]]]]
normalized: ~ [EG [~ [E [[[~ [EG [~ [[[1<=p31 & 1<=p35] | [1<=p8 & 1<=p10]]]]] | ~ [E [true U ~ [p37<=0]]]] | ~ [E [1<=p6 U [1<=p29 | 1<=p3]]]] U [[1<=p12 | [[[1<=p15 & ~ [EG [~ [1<=p11]]]] & [1<=p7 & 1<=p10]] & [1<=p23 & [1<=p30 & 1<=p11]]]] & [p3<=0 | E [true U [[1<=p19 & 1<=p30] & [1<=p8 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p8)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p30)
states: 27,585,712,558,001,904,467 (19)
abstracting: (1<=p19)
states: 18,260,919,712,122,884,360 (19)
MC time: 2m 3.150sec

checking: [EG [[[1<=p9 & 1<=p10] & [EF [[[1<=p7 & 1<=p32] | 1<=p18]] & [[EG [[1<=p2 & 1<=p4]] | E [p20<=0 U E [[1<=p5 & 1<=p31] U 1<=p16]]] & EG [AX [[1<=p14 & 1<=p11]]]]]]] | [E [E [AX [[[1<=p8 & 1<=p10] & [1<=p5 & 1<=p31]]] U 1<=p26] U AG [EF [[[1<=p17 & 1<=p30] & [1<=p5 & 1<=p31]]]]] | AG [[EG [[[p23<=0 | p30<=0] & AX [1<=p27]]] | A [1<=p12 U EG [1<=p16]]]]]]
normalized: [[~ [E [true U ~ [[[~ [EG [~ [EG [1<=p16]]]] & ~ [E [~ [EG [1<=p16]] U [~ [1<=p12] & ~ [EG [1<=p16]]]]]] | EG [[~ [EX [~ [1<=p27]]] & [p23<=0 | p30<=0]]]]]]] | E [E [~ [EX [~ [[[1<=p5 & 1<=p31] & [1<=p8 & 1<=p10]]]]] U 1<=p26] U ~ [E [true U ~ [E [true U [[1<=p5 & 1<=p31] & [1<=p17 & 1<=p30]]]]]]]] | EG [[[[EG [~ [EX [~ [[1<=p14 & 1<=p11]]]]] & [E [p20<=0 U E [[1<=p5 & 1<=p31] U 1<=p16]] | EG [[1<=p2 & 1<=p4]]]] & E [true U [1<=p18 | [1<=p7 & 1<=p32]]]] & [1<=p9 & 1<=p10]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p9)
states: 23,777,427,926,750,890,758 (19)
abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p18)
states: 18,260,919,712,122,884,360 (19)
abstracting: (1<=p4)
states: 43,090,329,340,490,051,192 (19)
abstracting: (1<=p2)
states: 27,585,712,558,001,904,467 (19)
MC time: 1m52.286sec

checking: EF [EG [[1<=p26 & EG [[[[1<=p13 & 1<=p32] & [1<=p7 & 1<=p10]] | 1<=p15]]]]]
normalized: E [true U EG [[1<=p26 & EG [[1<=p15 | [[1<=p13 & 1<=p32] & [1<=p7 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p32)
states: 43,090,325,990,063,670,264 (19)
abstracting: (1<=p13)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p15)
states: 28,333,829,979,623,890,466 (19)

before gc: list nodes free: 6159485

after gc: idd nodes used:4830864, unused:59169136; list nodes free:585985822
.
EG iterations: 1
abstracting: (1<=p26)
states: 11,526,218,635,994,019,506 (19)
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 5m50.626sec

checking: [AG [EX [~ [A [1<=p37 U [1<=p7 & 1<=p10]]]]] | E [[1<=p15 & [1<=p5 & 1<=p31]] U 1<=p15]]
normalized: [E [[1<=p15 & [1<=p5 & 1<=p31]] U 1<=p15] | ~ [E [true U ~ [EX [~ [[~ [EG [~ [[1<=p7 & 1<=p10]]]] & ~ [E [~ [[1<=p7 & 1<=p10]] U [~ [1<=p37] & ~ [[1<=p7 & 1<=p10]]]]]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p37)
states: 17,309,086,114,977,806,612 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p7)
states: 23,812,635,694,402,765,444 (19)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 28,333,829,979,623,890,466 (19)
abstracting: (1<=p31)
states: 27,585,712,557,960,713,447 (19)
abstracting: (1<=p5)
states: 36,945,725,823,224,523,238 (19)
abstracting: (1<=p15)
states: 28,333,829,979,623,890,466 (19)
-> the formula is FALSE

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

MC time: 7m26.482sec

checking: EG [[1<=p8 | [AG [EF [[1<=p6 & 1<=p10]]] & E [~ [E [[1<=p19 & 1<=p30] U 1<=p15]] U AG [EF [1<=p16]]]]]]
normalized: EG [[1<=p8 | [E [~ [E [[1<=p19 & 1<=p30] U 1<=p15]] U ~ [E [true U ~ [E [true U 1<=p16]]]]] & ~ [E [true U ~ [E [true U [1<=p6 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 32,479,875,754,428,505,237 (19)
abstracting: (1<=p6)
states: 23,812,632,051,839,204,014 (19)

before gc: list nodes free: 14752987

after gc: idd nodes used:4638225, unused:59361775; list nodes free:588934696
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 605360 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097164 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec


iterations count:24035 (375), effective:1737 (27)

initing FirstDep: 0m 0.000sec


iterations count:1176 (18), effective:71 (1)

iterations count:28606 (446), effective:2259 (35)

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

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

iterations count:1096 (17), effective:24 (0)

iterations count:389 (6), effective:25 (0)

sat_reach.icc:155: Timeout: after 290 sec


iterations count:148 (2), effective:12 (0)

sat_reach.icc:155: Timeout: after 263 sec


iterations count:2095 (32), effective:124 (1)

sat_reach.icc:155: Timeout: after 239 sec


sat_reach.icc:155: Timeout: after 217 sec


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

iterations count:264 (4), effective:25 (0)

iterations count:264 (4), effective:25 (0)

sat_reach.icc:155: Timeout: after 198 sec


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

net_ddint.h:600: Timeout: after 180 sec


sat_reach.icc:155: Timeout: after 163 sec


sat_reach.icc:155: Timeout: after 148 sec


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

sat_reach.icc:155: Timeout: after 135 sec


sat_reach.icc:155: Timeout: after 122 sec


iterations count:1065 (16), effective:56 (0)

net_ddint.h:600: Timeout: after 111 sec


iterations count:3398 (53), effective:217 (3)

iterations count:148 (2), effective:12 (0)

iterations count:8879 (138), effective:886 (13)

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

iterations count:2095 (32), effective:124 (1)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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