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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.5K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 9.7K Feb 26 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678684148966

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-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:09:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:09:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:09:11] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-13 05:09:11] [INFO ] Transformed 39 places.
[2023-03-13 05:09:11] [INFO ] Transformed 64 transitions.
[2023-03-13 05:09:11] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 39 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:09:11] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-13 05:09:12] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-13 05:09:12] [INFO ] Invariant cache hit.
[2023-03-13 05:09:12] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-13 05:09:12] [INFO ] Invariant cache hit.
[2023-03-13 05:09:12] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 39/39 places, 64/64 transitions.
Support contains 39 out of 39 places after structural reductions.
[2023-03-13 05:09:12] [INFO ] Flatten gal took : 26 ms
[2023-03-13 05:09:12] [INFO ] Flatten gal took : 11 ms
[2023-03-13 05:09:12] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 83) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :2
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 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 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) 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 12 ms. (steps per millisecond=83 ) properties (out of 24) 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 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 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 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 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 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 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 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 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) 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 13 ms. (steps per millisecond=77 ) 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 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 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 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-13 05:09:13] [INFO ] Invariant cache hit.
[2023-03-13 05:09:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:09:13] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:21
[2023-03-13 05:09:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 05:09:13] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :11
[2023-03-13 05:09:13] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :11
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-13 05:09:13] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :11
Fused 24 Parikh solutions to 11 different solutions.
Parikh walk visited 6 properties in 52 ms.
Support contains 6 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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 19 place count 29 transition count 55
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 90 edges and 29 vertex of which 28 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 7 rules applied. Total rules applied 26 place count 28 transition count 49
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 28 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 27 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 27 transition count 47
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 27 transition count 45
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 27 transition count 43
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 38 place count 25 transition count 41
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 25 transition count 39
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 43 place count 23 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 23 transition count 38
Applied a total of 44 rules in 23 ms. Remains 23 /39 variables (removed 16) and now considering 38/64 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 23/39 places, 38/64 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 23 cols
[2023-03-13 05:09:13] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 05:09:13] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 05:09:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 05:09:13] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 05:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:09:13] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 05:09:13] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 05:09:13] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 111 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
[2023-03-13 05:09:13] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
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 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 63
Applied a total of 8 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:09:14] [INFO ] Flatten gal took : 12 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 63 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 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 4 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 4 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 5 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Graph (complete) has 117 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Applied a total of 4 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 36/39 places, 63/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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 2 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 2 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 16 ms
[2023-03-13 05:09:14] [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 0 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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 13 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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 0 ms. Remains : 38/39 places, 64/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [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:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 63
Applied a total of 3 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 37/39 places, 63/64 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:09:14] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:09:14] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 05:09:14] [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 2879 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.903sec


RS generation: 0m48.141sec


-> reachability set: #nodes 648270 (6.5e+05) #states 1,115,538,966,669,107 (15)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m28.707sec

checking: [EX [0<=0] & EG [EX [0<=0]]]
normalized: [EX [0<=0] & EG [EX [0<=0]]]

abstracting: (0<=0)
states: 1,115,538,966,669,107 (15)
..
EG iterations: 1
abstracting: (0<=0)
states: 1,115,538,966,669,107 (15)
.-> the formula is TRUE

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

MC time: 0m 0.124sec

checking: EG [EF [13<=p18]]
normalized: EG [E [true U 13<=p18]]

abstracting: (13<=p18)
states: 463,541,994 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m50.256sec

checking: EF [EG [p35<=p37]]
normalized: E [true U EG [p35<=p37]]

abstracting: (p35<=p37)
states: 3,650,499,710,098 (12)
..
EG iterations: 2
MC time: 4m23.306sec

checking: EF [AX [p12<=p21]]
normalized: E [true U ~ [EX [~ [p12<=p21]]]]

abstracting: (p12<=p21)
states: 560,664,207,019,146 (14)
.-> the formula is TRUE

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

MC time: 1m50.722sec

checking: AG [~ [A [~ [p1<=p2] U A [p33<=10 U 8<=p19]]]]
normalized: ~ [E [true U [~ [EG [~ [[~ [EG [~ [8<=p19]]] & ~ [E [~ [8<=p19] U [~ [p33<=10] & ~ [8<=p19]]]]]]]] & ~ [E [~ [[~ [EG [~ [8<=p19]]] & ~ [E [~ [8<=p19] U [~ [p33<=10] & ~ [8<=p19]]]]]] U [p1<=p2 & ~ [[~ [EG [~ [8<=p19]]] & ~ [E [~ [8<=p19] U [~ [p33<=10] & ~ [8<=p19]]]]]]]]]]]]

abstracting: (8<=p19)
states: 7,365,728,230 (9)
abstracting: (p33<=10)
states: 459,489,773,908,261 (14)
abstracting: (8<=p19)
states: 7,365,728,230 (9)
abstracting: (8<=p19)
states: 7,365,728,230 (9)
.
EG iterations: 1
abstracting: (p1<=p2)
states: 1,038,599,519,519,208 (15)
abstracting: (8<=p19)
states: 7,365,728,230 (9)
abstracting: (p33<=10)
states: 459,489,773,908,261 (14)
abstracting: (8<=p19)
states: 7,365,728,230 (9)
MC time: 4m13.000sec

checking: A [~ [[EF [p29<=1] & AG [EF [7<=p35]]]] U AG [EF [[p12<=p37 | 6<=p32]]]]
normalized: [~ [EG [E [true U ~ [E [true U [p12<=p37 | 6<=p32]]]]]] & ~ [E [E [true U ~ [E [true U [p12<=p37 | 6<=p32]]]] U [[~ [E [true U ~ [E [true U 7<=p35]]]] & E [true U p29<=1]] & E [true U ~ [E [true U [p12<=p37 | 6<=p32]]]]]]]]

abstracting: (6<=p32)
states: 12,242,578,560,961 (13)
abstracting: (p12<=p37)
states: 728,723,313,792,365 (14)
abstracting: (p29<=1)
states: 664,611,882,773,106 (14)
MC time: 3m52.035sec

checking: E [EF [7<=p37] U AX [AG [[p20<=p14 | ~ [p30<=p9]]]]]
normalized: E [E [true U 7<=p37] U ~ [EX [E [true U ~ [[p20<=p14 | ~ [p30<=p9]]]]]]]

abstracting: (p30<=p9)
states: 858,221,933,829,440 (14)
abstracting: (p20<=p14)
states: 933,139,290,829,329 (14)

before gc: list nodes free: 1768546

after gc: idd nodes used:7475960, unused:56524040; list nodes free:482693813
MC time: 3m33.282sec

checking: EF [AG [[[~ [p8<=p19] | ~ [p9<=9]] | [~ [4<=p18] | ~ [p4<=p0]]]]]
normalized: E [true U ~ [E [true U ~ [[[~ [p4<=p0] | ~ [4<=p18]] | [~ [p9<=9] | ~ [p8<=p19]]]]]]]

abstracting: (p8<=p19)
states: 730,542,329,614,746 (14)
abstracting: (p9<=9)
states: 1,115,535,736,834,661 (15)
abstracting: (4<=p18)
states: 69,716,426,789,384 (13)
abstracting: (p4<=p0)
states: 1,038,509,820,204,890 (15)
MC time: 3m15.061sec

checking: AG [[AF [p6<=p9] | [EX [0<=0] & [EG [~ [p17<=3]] | [p16<=p11 | ~ [p3<=1]]]]]]
normalized: ~ [E [true U ~ [[[[[p16<=p11 | ~ [p3<=1]] | EG [~ [p17<=3]]] & EX [0<=0]] | ~ [EG [~ [p6<=p9]]]]]]]

abstracting: (p6<=p9)
states: 383,055,284,946,320 (14)
.
EG iterations: 1
abstracting: (0<=0)
states: 1,115,538,966,669,107 (15)
.abstracting: (p17<=3)
states: 1,109,980,277,485,697 (15)
..
EG iterations: 2
abstracting: (p3<=1)
states: 811,554,569,225,356 (14)
abstracting: (p16<=p11)
states: 786,509,318,628,489 (14)

before gc: list nodes free: 9658958

after gc: idd nodes used:9687523, unused:54312477; list nodes free:461613119
MC time: 2m59.026sec

checking: E [p17<=p34 U [EF [AG [[~ [14<=p4] & E [p8<=p22 U 8<=p19]]]] & [AX [~ [p2<=10]] & 1<=p6]]]
normalized: E [p17<=p34 U [[1<=p6 & ~ [EX [p2<=10]]] & E [true U ~ [E [true U ~ [[E [p8<=p22 U 8<=p19] & ~ [14<=p4]]]]]]]]

abstracting: (14<=p4)
states: 130,725,342 (8)
abstracting: (8<=p19)
states: 7,365,728,230 (9)
abstracting: (p8<=p22)
states: 830,946,724,868,184 (14)
MC time: 2m44.241sec

checking: [EF [AX [~ [p27<=3]]] & EF [[[E [p20<=p8 U p15<=p28] & AX [p35<=p33]] | AG [[p16<=p25 & 12<=p22]]]]]
normalized: [E [true U [~ [E [true U ~ [[p16<=p25 & 12<=p22]]]] | [~ [EX [~ [p35<=p33]]] & E [p20<=p8 U p15<=p28]]]] & E [true U ~ [EX [p27<=3]]]]

abstracting: (p27<=3)
states: 1,115,368,331,530,200 (15)
.MC time: 2m30.528sec

checking: E [EG [[A [A [7<=p36 U p12<=10] U E [p34<=4 U p22<=3]] | [AF [EX [p19<=p15]] & [~ [p30<=p17] | [10<=p5 & ~ [p37<=p18]]]]]] U ~ [[[9<=p4 & EX [0<=0]] | ~ [EF [14<=p9]]]]]
normalized: E [EG [[[[[10<=p5 & ~ [p37<=p18]] | ~ [p30<=p17]] & ~ [EG [~ [EX [p19<=p15]]]]] | [~ [EG [~ [E [p34<=4 U p22<=3]]]] & ~ [E [~ [E [p34<=4 U p22<=3]] U [~ [[~ [EG [~ [p12<=10]]] & ~ [E [~ [p12<=10] U [~ [7<=p36] & ~ [p12<=10]]]]]] & ~ [E [p34<=4 U p22<=3]]]]]]]] U ~ [[~ [E [true U 14<=p9]] | [9<=p4 & EX [0<=0]]]]]

abstracting: (0<=0)
states: 1,115,538,966,669,107 (15)
.abstracting: (9<=p4)
states: 513,700,690,553 (11)
abstracting: (14<=p9)
states: 130,824 (5)
abstracting: (p22<=3)
states: 1,046,472,126,092,189 (15)
abstracting: (p34<=4)
states: 183,177,264,823,298 (14)
MC time: 2m22.401sec

checking: AG [[AX [~ [A [[5<=p25 | p4<=p32] U AF [8<=p32]]]] & [EX [[AF [9<=p7] | A [10<=p37 U 2<=p26]]] | [AX [AF [p23<=5]] | [AF [~ [p34<=p12]] & EF [[p3<=10 | p33<=p13]]]]]]]
normalized: ~ [E [true U ~ [[[[[E [true U [p3<=10 | p33<=p13]] & ~ [EG [p34<=p12]]] | ~ [EX [EG [~ [p23<=5]]]]] | EX [[[~ [EG [~ [2<=p26]]] & ~ [E [~ [2<=p26] U [~ [10<=p37] & ~ [2<=p26]]]]] | ~ [EG [~ [9<=p7]]]]]] & ~ [EX [[~ [EG [EG [~ [8<=p32]]]] & ~ [E [EG [~ [8<=p32]] U [~ [[5<=p25 | p4<=p32]] & EG [~ [8<=p32]]]]]]]]]]]]

abstracting: (8<=p32)
states: 1,623,568,285,401 (12)
.
EG iterations: 1
abstracting: (p4<=p32)
states: 723,898,130,443,592 (14)
abstracting: (5<=p25)
states: 1,223,534,477,169 (12)
abstracting: (8<=p32)
states: 1,623,568,285,401 (12)
.
EG iterations: 1
MC time: 2m 8.582sec

checking: AG [[E [[~ [AX [p3<=p37]] & [A [6<=p9 U 14<=p23] & ~ [EX [p21<=p14]]]] U [A [8<=p32 U p9<=p10] | [AG [p12<=1] | ~ [AG [p13<=7]]]]] | EG [AG [[~ [p17<=p38] | p37<=5]]]]]
normalized: ~ [E [true U ~ [[EG [~ [E [true U ~ [[p37<=5 | ~ [p17<=p38]]]]]] | E [[[~ [EX [p21<=p14]] & [~ [EG [~ [14<=p23]]] & ~ [E [~ [14<=p23] U [~ [6<=p9] & ~ [14<=p23]]]]]] & EX [~ [p3<=p37]]] U [[E [true U ~ [p13<=7]] | ~ [E [true U ~ [p12<=1]]]] | [~ [EG [~ [p9<=p10]]] & ~ [E [~ [p9<=p10] U [~ [8<=p32] & ~ [p9<=p10]]]]]]]]]]]

abstracting: (p9<=p10)
states: 774,727,767,001,045 (14)
abstracting: (8<=p32)
states: 1,623,568,285,401 (12)
abstracting: (p9<=p10)
states: 774,727,767,001,045 (14)
abstracting: (p9<=p10)
states: 774,727,767,001,045 (14)

before gc: list nodes free: 45329

after gc: idd nodes used:12278974, unused:51721026; list nodes free:451246746
MC time: 1m55.063sec

checking: AG [[EX [EF [[7<=p14 | p4<=5]]] | [[[14<=p18 & [[AX [~ [p19<=2]] | EX [AG [2<=p32]]] & [~ [10<=p28] | ~ [p38<=p27]]]] & [EG [E [A [p26<=p16 U 2<=p23] U [p34<=p16 | p14<=5]]] & [AF [~ [6<=p37]] & ~ [E [p18<=2 U 6<=p38]]]]] | p24<=p13]]]
normalized: ~ [E [true U ~ [[[p24<=p13 | [[[~ [E [p18<=2 U 6<=p38]] & ~ [EG [6<=p37]]] & EG [E [[~ [EG [~ [2<=p23]]] & ~ [E [~ [2<=p23] U [~ [p26<=p16] & ~ [2<=p23]]]]] U [p34<=p16 | p14<=5]]]] & [14<=p18 & [[~ [p38<=p27] | ~ [10<=p28]] & [EX [~ [E [true U ~ [2<=p32]]]] | ~ [EX [p19<=2]]]]]]] | EX [E [true U [7<=p14 | p4<=5]]]]]]]

abstracting: (p4<=5)
states: 1,103,296,387,673,998 (15)
abstracting: (7<=p14)
states: 4,340,698,287,283 (12)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1697232 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097432 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:18034 (281), effective:1362 (21)

initing FirstDep: 0m 0.000sec


iterations count:24360 (380), effective:1877 (29)

sat_reach.icc:155: Timeout: after 262 sec


iterations count:306 (4), effective:78 (1)

iterations count:2863 (44), effective:245 (3)

sat_reach.icc:155: Timeout: after 252 sec


iterations count:94 (1), effective:15 (0)

sat_reach.icc:155: Timeout: after 231 sec


sat_reach.icc:155: Timeout: after 212 sec


sat_reach.icc:155: Timeout: after 194 sec


sat_reach.icc:155: Timeout: after 178 sec


sat_reach.icc:155: Timeout: after 163 sec


sat_reach.icc:155: Timeout: after 149 sec


iterations count:16479 (257), effective:1323 (20)

sat_reach.icc:155: Timeout: after 137 sec


sat_reach.icc:155: Timeout: after 125 sec


iterations count:736 (11), effective:49 (0)

net_ddint.h:600: Timeout: after 114 sec


sat_reach.icc:155: Timeout: after 105 sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Angiogenesis-PT-15"
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-15, 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-167813598900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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