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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15035.271 3600000.00 3660185.00 130.70 TFTFFTFFFTFFFFTT 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-167813598900342.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900342
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678684330676

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=ReachabilityCardinality
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:12:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:12:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:12:13] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-13 05:12:13] [INFO ] Transformed 39 places.
[2023-03-13 05:12:13] [INFO ] Transformed 64 transitions.
[2023-03-13 05:12:13] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10005 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 16) seen :9
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :1
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 64 rows 39 cols
[2023-03-13 05:12:13] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-13 05:12:14] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 05:12:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 05:12:14] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 05:12:14] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 05:12:14] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 23 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
Partial Free-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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 64
Applied a total of 3 rules in 25 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 38/39 places, 64/64 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 503552 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503552 steps, saw 328467 distinct states, run finished after 3005 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:12:17] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-13 05:12:17] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 05:12:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:12:17] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 05:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:12:17] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 05:12:17] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 05:12:17] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 23 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 4 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 4 ms. Remains : 38/38 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-13 05:12:17] [INFO ] Invariant cache hit.
[2023-03-13 05:12:17] [INFO ] Implicit Places using invariants in 34 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 37/38 places, 64/64 transitions.
Graph (trivial) has 2 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 9 ms. Remains 36 /37 variables (removed 1) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 36 cols
[2023-03-13 05:12:17] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 05:12:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-13 05:12:17] [INFO ] Invariant cache hit.
[2023-03-13 05:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:12:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 36/38 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 145 ms. Remains : 36/38 places, 62/64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 05:12:17] [INFO ] Invariant cache hit.
[2023-03-13 05:12:17] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 05:12:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-13 05:12:17] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 05:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 05:12:17] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 05:12:17] [INFO ] After 13ms 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:12:18] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 62/62 transitions.
Graph (trivial) has 10 edges and 36 vertex of which 4 / 36 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition k29 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 14 place count 27 transition count 48
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 27 transition count 43
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 2 with 4 rules applied. Total rules applied 23 place count 25 transition count 43
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 25 transition count 41
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 25 transition count 39
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 25 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 23 transition count 37
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 35 place count 23 transition count 34
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 43 place count 19 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 19 transition count 29
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 19 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 48 place count 17 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 17 transition count 27
Applied a total of 49 rules in 40 ms. Remains 17 /36 variables (removed 19) and now considering 27/62 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 17/36 places, 27/62 transitions.
Finished random walk after 5496 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1099 )
FORMULA Angiogenesis-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4924 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Angiogenesis_PT_15
(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 3.036sec


RS generation: 0m48.574sec


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



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

checking: EF [9<=PtP3]
normalized: E [true U 9<=PtP3]

abstracting: (9<=PtP3)
states: 513,700,550,225 (11)
MC time: 3m42.082sec

checking: AG [KdStarGStarP3kP3<=9]
normalized: ~ [E [true U ~ [KdStarGStarP3kP3<=9]]]

abstracting: (KdStarGStarP3kP3<=9)
states: 1,115,538,844,176,536 (15)
MC time: 3m28.164sec

checking: EF [10<=KdStarGStarPgStarP2]
normalized: E [true U 10<=KdStarGStarPgStarP2]

abstracting: (10<=KdStarGStarPgStarP2)
states: 120,480,124 (8)
MC time: 3m15.095sec

checking: AG [KdStarGStarP3kStarP2<=Pten]
normalized: ~ [E [true U ~ [KdStarGStarP3kStarP2<=Pten]]]

abstracting: (KdStarGStarP3kStarP2<=Pten)
states: 1,115,538,966,669,107 (15)
-> the formula is TRUE

FORMULA Angiogenesis-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.595sec

checking: EF [~ [DAG<=Pip2]]
normalized: E [true U ~ [DAG<=Pip2]]

abstracting: (DAG<=Pip2)
states: 723,898,131,156,506 (14)
MC time: 3m15.259sec

checking: AG [KdStarGStarPgStarP3<=AktP3]
normalized: ~ [E [true U ~ [KdStarGStarPgStarP3<=AktP3]]]

abstracting: (KdStarGStarPgStarP3<=AktP3)
states: 921,668,567,163,677 (14)
MC time: 3m 2.016sec

checking: EF [[~ [KdStarGStarPgStarP3P2<=6] | ~ [6<=Pten]]]
normalized: E [true U [~ [6<=Pten] | ~ [KdStarGStarPgStarP3P2<=6]]]

abstracting: (KdStarGStarPgStarP3P2<=6)
states: 1,115,538,963,575,081 (15)
abstracting: (6<=Pten)
states: 1,114,027,211,350,759 (15)
MC time: 2m50.105sec

checking: AG [[DAG<=PtP3P2 | ~ [13<=GStarPgP3]]]
normalized: ~ [E [true U ~ [[DAG<=PtP3P2 | ~ [13<=GStarPgP3]]]]]

abstracting: (13<=GStarPgP3)
states: 110,445 (5)
abstracting: (DAG<=PtP3P2)
states: 608,240,790,816,447 (14)
MC time: 2m39.005sec

checking: AG [[KdStarGStarPgStar<=Gab1 | [~ [[~ [[2<=GP3 | AktStar<=6]] | [~ [15<=KdStarGStarPgP3] | ~ [KdStarPgStar<=1]]]] & ~ [4<=KdStarGStarP3kStar]]]]
normalized: ~ [E [true U ~ [[KdStarGStarPgStar<=Gab1 | [~ [4<=KdStarGStarP3kStar] & ~ [[[~ [KdStarPgStar<=1] | ~ [15<=KdStarGStarPgP3]] | ~ [[2<=GP3 | AktStar<=6]]]]]]]]]

abstracting: (AktStar<=6)
states: 521,736,556,838,609 (14)
abstracting: (2<=GP3)
states: 189,378,619,000,252 (14)
abstracting: (15<=KdStarGStarPgP3)
states: 16
abstracting: (KdStarPgStar<=1)
states: 664,611,882,773,106 (14)
abstracting: (4<=KdStarGStarP3kStar)
states: 69,716,426,789,384 (13)
abstracting: (KdStarGStarPgStar<=Gab1)
states: 866,719,647,467,817 (14)
MC time: 2m28.001sec

checking: AG [[Gab1<=1 | [[~ [[[8<=KdStarGStar & ~ [[[11<=PtP3P2 | KdStarGStarPgStarP3P2<=KdStarGStarPg] | AktP3<=15]]] & DAGE<=KdStarGStarPgStarP3]] & [[~ [3<=Pten] | KdStarGStarPgP3<=8] & KdStarG<=11]] | ~ [[PtP3P2<=8 | [~ [KdStarGStarP3kStarP3P2<=6] | 3<=DAGE]]]]]]
normalized: ~ [E [true U ~ [[Gab1<=1 | [~ [[PtP3P2<=8 | [3<=DAGE | ~ [KdStarGStarP3kStarP3P2<=6]]]] | [[KdStarG<=11 & [KdStarGStarPgP3<=8 | ~ [3<=Pten]]] & ~ [[DAGE<=KdStarGStarPgStarP3 & [8<=KdStarGStar & ~ [[AktP3<=15 | [11<=PtP3P2 | KdStarGStarPgStarP3P2<=KdStarGStarPg]]]]]]]]]]]]

abstracting: (KdStarGStarPgStarP3P2<=KdStarGStarPg)
states: 1,030,420,990,968,631 (15)
abstracting: (11<=PtP3P2)
states: 0
abstracting: (AktP3<=15)
states: 1,115,538,966,669,107 (15)
abstracting: (8<=KdStarGStar)
states: 1,425,050,970,634 (12)
abstracting: (DAGE<=KdStarGStarPgStarP3)
states: 619,003,196,747,237 (14)
abstracting: (3<=Pten)
states: 1,115,522,859,976,237 (15)
abstracting: (KdStarGStarPgP3<=8)
states: 1,115,537,946,568,917 (15)
abstracting: (KdStarG<=11)
states: 1,115,535,381,788,410 (15)
abstracting: (KdStarGStarP3kStarP3P2<=6)
states: 1,115,538,963,572,585 (15)
abstracting: (3<=DAGE)
states: 148,187,806,970,077 (14)
abstracting: (PtP3P2<=8)
states: 1,115,538,966,669,107 (15)
abstracting: (Gab1<=1)
states: 460,292,978,864,515 (14)

before gc: list nodes free: 1438482

after gc: idd nodes used:4244653, unused:59755347; list nodes free:502258308
MC time: 2m18.007sec

checking: AG [[[KdStarGStarP3kStarP3P2<=PtP2 & ~ [Enz<=14]] | ~ [[KdStarGStarP3kStar<=KdStarGStarP3kStarP2 & [[KdStarGStarP3k<=6 | [[AktP3<=Pg | 8<=KdStarGStarP3] | [7<=KdStarGP3 | KdStarGStarPgStar<=7]]] & [8<=KdStarPgStar & [[KdStar<=14 | GStarP3kP3<=1] & KdStarGStarPgStarP2<=14]]]]]]]
normalized: ~ [E [true U ~ [[~ [[KdStarGStarP3kStar<=KdStarGStarP3kStarP2 & [[8<=KdStarPgStar & [KdStarGStarPgStarP2<=14 & [KdStar<=14 | GStarP3kP3<=1]]] & [KdStarGStarP3k<=6 | [[7<=KdStarGP3 | KdStarGStarPgStar<=7] | [AktP3<=Pg | 8<=KdStarGStarP3]]]]]] | [KdStarGStarP3kStarP3P2<=PtP2 & ~ [Enz<=14]]]]]]

abstracting: (Enz<=14)
states: 594,887,115,795,254 (14)
abstracting: (KdStarGStarP3kStarP3P2<=PtP2)
states: 1,024,364,721,366,227 (15)
abstracting: (8<=KdStarGStarP3)
states: 7,365,728,230 (9)
abstracting: (AktP3<=Pg)
states: 1,102,097,536,229,308 (15)
abstracting: (KdStarGStarPgStar<=7)
states: 1,114,147,139,890,133 (15)
abstracting: (7<=KdStarGP3)
states: 45,477,453,679 (10)
abstracting: (KdStarGStarP3k<=6)
states: 1,111,198,268,381,824 (15)
abstracting: (GStarP3kP3<=1)
states: 926,154,682,704,518 (14)
abstracting: (KdStar<=14)
states: 1,115,538,899,054,167 (15)
abstracting: (KdStarGStarPgStarP2<=14)
states: 1,115,538,966,669,091 (15)
abstracting: (8<=KdStarPgStar)
states: 5,649,572,880,338 (12)
abstracting: (KdStarGStarP3kStar<=KdStarGStarP3kStarP2)
states: 612,298,174,046,929 (14)
MC time: 2m 9.010sec

checking: AG [~ [[[[[~ [[[4<=GP3 | KdStarGStarPgStarP3P2<=1] | [14<=KdStarPgStarP2 & GStarP3<=8]]] | PtP2<=PtP3] | [12<=KdStarGStarPg | [[[14<=KdStarPgStarP2 & 7<=KdStar] | [KdStarGStarP3<=8 & KdStarGStar<=4]] | ~ [KdStarGStarPgStarP3<=4]]]] & ~ [KdStarGStarP3kStar<=AktP3]] & [Gab1<=4 & [Akt<=PtP3P2 & [~ [[P3k<=KdStarGStarPgP3 & 12<=Pg]] | [[~ [KdStarGStarPgStarP2<=10] | [PtP3P2<=GStarP3kP3 & KdStarGStarPgStarP3<=KdStarGStarPgStarP3]] | [KdStarGStarP3kStarP2<=6 | [GStarP3<=5 & 4<=PtP2]]]]]]]]]
normalized: ~ [E [true U [[Gab1<=4 & [Akt<=PtP3P2 & [[[KdStarGStarP3kStarP2<=6 | [GStarP3<=5 & 4<=PtP2]] | [[PtP3P2<=GStarP3kP3 & KdStarGStarPgStarP3<=KdStarGStarPgStarP3] | ~ [KdStarGStarPgStarP2<=10]]] | ~ [[P3k<=KdStarGStarPgP3 & 12<=Pg]]]]] & [~ [KdStarGStarP3kStar<=AktP3] & [[12<=KdStarGStarPg | [~ [KdStarGStarPgStarP3<=4] | [[KdStarGStarP3<=8 & KdStarGStar<=4] | [14<=KdStarPgStarP2 & 7<=KdStar]]]] | [PtP2<=PtP3 | ~ [[[14<=KdStarPgStarP2 & GStarP3<=8] | [4<=GP3 | KdStarGStarPgStarP3P2<=1]]]]]]]]]

abstracting: (KdStarGStarPgStarP3P2<=1)
states: 1,094,126,199,678,198 (15)
abstracting: (4<=GP3)
states: 23,189,253,955,227 (13)
abstracting: (GStarP3<=8)
states: 1,115,518,850,470,502 (15)
abstracting: (14<=KdStarPgStarP2)
states: 1,132 (3)
abstracting: (PtP2<=PtP3)
states: 723,898,130,443,592 (14)
abstracting: (7<=KdStar)
states: 15,002,770,494,087 (13)
abstracting: (14<=KdStarPgStarP2)
states: 1,132 (3)
abstracting: (KdStarGStar<=4)
states: 1,085,567,274,091,623 (15)
abstracting: (KdStarGStarP3<=8)
states: 1,115,537,932,429,830 (15)
abstracting: (KdStarGStarPgStarP3<=4)
states: 1,114,315,432,191,938 (15)
abstracting: (12<=KdStarGStarPg)
states: 3,496,705,486 (9)
abstracting: (KdStarGStarP3kStar<=AktP3)
states: 709,083,601,757,099 (14)
abstracting: (12<=Pg)
states: 67,617,322,701,265 (13)
abstracting: (P3k<=KdStarGStarPgP3)
states: 11,850,474,288 (10)
abstracting: (KdStarGStarPgStarP2<=10)
states: 1,115,538,955,139,171 (15)
abstracting: (KdStarGStarPgStarP3<=KdStarGStarPgStarP3)
states: 1,115,538,966,669,107 (15)
abstracting: (PtP3P2<=GStarP3kP3)
states: 916,288,114,785,108 (14)
abstracting: (4<=PtP2)
states: 68,565,714,910,670 (13)
abstracting: (GStarP3<=5)
states: 1,113,581,146,841,219 (15)
abstracting: (KdStarGStarP3kStarP2<=6)
states: 1,115,493,440,325,359 (15)
abstracting: (Akt<=PtP3P2)
states: 100,015,067,820,705 (14)
abstracting: (Gab1<=4)
states: 939,796,677,504,840 (14)
MC time: 2m 1.144sec

checking: AG [[[Pten<=Enz | [Gab1<=KdStarPgStar & ~ [[[[KdStarGStarPgStar<=14 | ~ [12<=KdStarGStarP3kStarP2]] & [[~ [5<=Enz] & [DAGE<=12 & Pip2<=KdStarGStarPg]] | ~ [KdStarGStarP3kStarP3<=DAG]]] | [9<=P3k | 11<=KdStarGStarP3kStarP3P2]]]]] | [[[4<=KdStarGStarP3kP3 | KdStarGStarP3kStarP3<=KdStarGStarP3kStarP2] | ~ [[[KdStarGStar<=4 | 2<=P3k] & GStarP3<=PtP3]]] | [~ [[7<=KdStarGStarP3k | ~ [[3<=KdStarGStarPgStarP3P2 | [~ [Pg<=7] | ~ [2<=P3k]]]]]] | ~ [[~ [12<=DAG] | KdStarGStarPgStar<=DAGE]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[KdStarGStarPgStar<=DAGE | ~ [12<=DAG]]] | ~ [[7<=KdStarGStarP3k | ~ [[3<=KdStarGStarPgStarP3P2 | [~ [2<=P3k] | ~ [Pg<=7]]]]]]] | [~ [[GStarP3<=PtP3 & [KdStarGStar<=4 | 2<=P3k]]] | [4<=KdStarGStarP3kP3 | KdStarGStarP3kStarP3<=KdStarGStarP3kStarP2]]] | [Pten<=Enz | [Gab1<=KdStarPgStar & ~ [[[9<=P3k | 11<=KdStarGStarP3kStarP3P2] | [[~ [KdStarGStarP3kStarP3<=DAG] | [[DAGE<=12 & Pip2<=KdStarGStarPg] & ~ [5<=Enz]]] & [KdStarGStarPgStar<=14 | ~ [12<=KdStarGStarP3kStarP2]]]]]]]]]]]

abstracting: (12<=KdStarGStarP3kStarP2)
states: 863,984 (5)
abstracting: (KdStarGStarPgStar<=14)
states: 1,115,538,965,247,005 (15)
abstracting: (5<=Enz)
states: 1,115,503,630,641,326 (15)
abstracting: (Pip2<=KdStarGStarPg)
states: 737,166,239,897,837 (14)
abstracting: (DAGE<=12)
states: 1,115,537,808,348,454 (15)
abstracting: (KdStarGStarP3kStarP3<=DAG)
states: 931,787,498,777,268 (14)
abstracting: (11<=KdStarGStarP3kStarP3P2)
states: 0
abstracting: (9<=P3k)
states: 942,782,745,461,855 (14)
abstracting: (Gab1<=KdStarPgStar)
states: 530,793,871,039,949 (14)
abstracting: (Pten<=Enz)
states: 898,523,366,636,523 (14)
abstracting: (KdStarGStarP3kStarP3<=KdStarGStarP3kStarP2)
states: 860,816,178,358,839 (14)
abstracting: (4<=KdStarGStarP3kP3)
states: 5,558,689,183,410 (12)
abstracting: (2<=P3k)
states: 1,115,466,053,225,334 (15)
abstracting: (KdStarGStar<=4)
states: 1,085,567,274,091,623 (15)
abstracting: (GStarP3<=PtP3)
states: 825,712,464,832,458 (14)
abstracting: (Pg<=7)
states: 583,359,499,960,582 (14)
abstracting: (2<=P3k)
states: 1,115,466,053,225,334 (15)
abstracting: (3<=KdStarGStarPgStarP3P2)
states: 2,195,917,190,017 (12)
abstracting: (7<=KdStarGStarP3k)
states: 4,340,698,287,283 (12)
abstracting: (12<=DAG)
states: 7,213,533,822 (9)
abstracting: (KdStarGStarPgStar<=DAGE)
states: 730,268,011,184,509 (14)
MC time: 1m53.860sec

checking: AG [[[[[[[~ [[[2<=P3k & KdStarGStarPgStarP3<=2] | ~ [KdStarGStarP3kStarP2<=1]]] & [[KdStarPgStar<=13 | ~ [Pip3<=KdStarGStarP3]] | ~ [6<=KdStarGStarP3kStarP3]]] & [~ [GStarP3kP3<=8] & ~ [[[14<=GP3 & KdStar<=5] | GP3<=4]]]] | PtP3<=2] | AktStar<=KdStarPgStarP2] & ~ [[~ [[[[[KdStarGStar<=GStarP3 & 5<=Gab1] | [KdStarPgStarP2<=15 & KdStarGStarP3kStarP2<=KdStarPgStar]] & ~ [[KdStarGStarP3kStarP2<=KdStarGStar | KdStarGStarP3kStarP3P2<=KdStarGStarPgP3]]] | ~ [[~ [KdStarGStarPgStarP3<=3] & ~ [GStarPgP3<=GStarP3kP3]]]]] & [~ [KdStar<=8] | [KdStarGStarPgStarP3<=14 & ~ [10<=PtP3P2]]]]]] | ~ [KdStarGStarPgStarP3<=KdStarGStarPgStarP3]]]
normalized: ~ [E [true U ~ [[~ [KdStarGStarPgStarP3<=KdStarGStarPgStarP3] | [~ [[[[KdStarGStarPgStarP3<=14 & ~ [10<=PtP3P2]] | ~ [KdStar<=8]] & ~ [[~ [[~ [GStarPgP3<=GStarP3kP3] & ~ [KdStarGStarPgStarP3<=3]]] | [~ [[KdStarGStarP3kStarP2<=KdStarGStar | KdStarGStarP3kStarP3P2<=KdStarGStarPgP3]] & [[KdStarPgStarP2<=15 & KdStarGStarP3kStarP2<=KdStarPgStar] | [KdStarGStar<=GStarP3 & 5<=Gab1]]]]]]] & [AktStar<=KdStarPgStarP2 | [PtP3<=2 | [[~ [[GP3<=4 | [14<=GP3 & KdStar<=5]]] & ~ [GStarP3kP3<=8]] & [[~ [6<=KdStarGStarP3kStarP3] | [KdStarPgStar<=13 | ~ [Pip3<=KdStarGStarP3]]] & ~ [[~ [KdStarGStarP3kStarP2<=1] | [2<=P3k & KdStarGStarPgStarP3<=2]]]]]]]]]]]]

abstracting: (KdStarGStarPgStarP3<=2)
states: 1,092,518,498,675,393 (15)
abstracting: (2<=P3k)
states: 1,115,466,053,225,334 (15)
abstracting: (KdStarGStarP3kStarP2<=1)
states: 1,025,852,562,158,540 (15)
abstracting: (Pip3<=KdStarGStarP3)
states: 619,283,312,030,059 (14)
abstracting: (KdStarPgStar<=13)
states: 1,115,538,386,475,393 (15)
abstracting: (6<=KdStarGStarP3kStarP3)
states: 249,480,213,872 (11)
abstracting: (GStarP3kP3<=8)
states: 1,115,518,850,470,502 (15)
abstracting: (KdStar<=5)
states: 1,081,204,238,803,252 (15)
abstracting: (14<=GP3)
states: 94,712 (4)
abstracting: (GP3<=4)
states: 1,108,455,740,262,192 (15)
abstracting: (PtP3<=2)
states: 967,351,160,706,790 (14)
abstracting: (AktStar<=KdStarPgStarP2)
states: 111,538,719,977,111 (14)
abstracting: (5<=Gab1)
states: 175,742,289,164,267 (14)
abstracting: (KdStarGStar<=GStarP3)
states: 670,021,642,081,987 (14)
abstracting: (KdStarGStarP3kStarP2<=KdStarPgStar)
states: 970,819,700,114,389 (14)
abstracting: (KdStarPgStarP2<=15)
states: 1,115,538,966,669,107 (15)
abstracting: (KdStarGStarP3kStarP3P2<=KdStarGStarPgP3)
states: 987,601,084,798,973 (14)
abstracting: (KdStarGStarP3kStarP2<=KdStarGStar)
states: 933,139,290,829,329 (14)
abstracting: (KdStarGStarPgStarP3<=3)
states: 1,110,014,401,604,358 (15)
abstracting: (GStarPgP3<=GStarP3kP3)
states: 778,613,771,998,454 (14)
abstracting: (KdStar<=8)
states: 1,113,358,118,481,780 (15)
abstracting: (10<=PtP3P2)
states: 0
abstracting: (KdStarGStarPgStarP3<=14)
states: 1,115,538,966,669,091 (15)
abstracting: (KdStarGStarPgStarP3<=KdStarGStarPgStarP3)
states: 1,115,538,966,669,107 (15)

before gc: list nodes free: 574229

after gc: idd nodes used:19375220, unused:44624780; list nodes free:381166771
MC time: 1m45.154sec

checking: EF [[~ [Enz<=6] & [KdStarPgStar<=11 & [[[~ [PtP3P2<=5] | [[[[KdStarGStarPgStar<=PtP2 & KdStarPgStar<=P3k] & 13<=GStarPgP3] | [~ [Enz<=Pten] & ~ [KdStarGStarP3kP3<=2]]] | ~ [[KdStarPgStar<=KdStarGStarP3 | KdStarGStarP3kStarP3P2<=KdStarGStarPg]]]] & KdStarGStarPg<=P3k] & [[~ [[[[KdStarGStarPgP3<=7 | KdStarGStarPg<=KdStarG] | ~ [Enz<=10]] & 12<=KdStarGStarP3kStar]] | [~ [KdStarG<=Pip3] & [[[KdStarPgStarP2<=9 | KdStarGP3<=7] & [DAGE<=KdStarGP3 & KdStarGStarP3<=9]] | [~ [KdStarGStarP3k<=3] | [KdStarGStarPgP3<=AktP3 | KdStarGStar<=Gab1]]]]] & 3<=DAG]]]]]
normalized: E [true U [[KdStarPgStar<=11 & [[3<=DAG & [[[[[KdStarGStarPgP3<=AktP3 | KdStarGStar<=Gab1] | ~ [KdStarGStarP3k<=3]] | [[DAGE<=KdStarGP3 & KdStarGStarP3<=9] & [KdStarPgStarP2<=9 | KdStarGP3<=7]]] & ~ [KdStarG<=Pip3]] | ~ [[12<=KdStarGStarP3kStar & [~ [Enz<=10] | [KdStarGStarPgP3<=7 | KdStarGStarPg<=KdStarG]]]]]] & [KdStarGStarPg<=P3k & [[~ [[KdStarPgStar<=KdStarGStarP3 | KdStarGStarP3kStarP3P2<=KdStarGStarPg]] | [[~ [KdStarGStarP3kP3<=2] & ~ [Enz<=Pten]] | [13<=GStarPgP3 & [KdStarGStarPgStar<=PtP2 & KdStarPgStar<=P3k]]]] | ~ [PtP3P2<=5]]]]] & ~ [Enz<=6]]]

abstracting: (Enz<=6)
states: 513,700,690,553 (11)
abstracting: (PtP3P2<=5)
states: 1,115,531,753,161,100 (15)
abstracting: (KdStarPgStar<=P3k)
states: 1,114,968,318,555,833 (15)
abstracting: (KdStarGStarPgStar<=PtP2)
states: 730,268,011,184,509 (14)
abstracting: (13<=GStarPgP3)
states: 110,445 (5)
abstracting: (Enz<=Pten)
states: 391,225,192,380,775 (14)
abstracting: (KdStarGStarP3kP3<=2)
states: 1,092,396,826,104,897 (15)
abstracting: (KdStarGStarP3kStarP3P2<=KdStarGStarPg)
states: 1,030,271,671,301,777 (15)
abstracting: (KdStarPgStar<=KdStarGStarP3)
states: 485,647,555,225,963 (14)
abstracting: (KdStarGStarPg<=P3k)
states: 1,115,538,966,669,107 (15)
abstracting: (KdStarGStarPg<=KdStarG)
states: 721,956,957,250,454 (14)
abstracting: (KdStarGStarPgP3<=7)
states: 1,115,531,685,295,823 (15)
abstracting: (Enz<=10)
states: 29,933,111,333,348 (13)
abstracting: (12<=KdStarGStarP3kStar)
states: 3,706,634,246 (9)
abstracting: (KdStarG<=Pip3)
states: 728,723,313,792,365 (14)
abstracting: (KdStarGP3<=7)
states: 1,115,531,617,405,382 (15)
abstracting: (KdStarPgStarP2<=9)
states: 1,115,538,779,604,332 (15)
abstracting: (KdStarGStarP3<=9)
states: 1,115,538,844,176,536 (15)
abstracting: (DAGE<=KdStarGP3)
states: 619,280,661,590,201 (14)
abstracting: (KdStarGStarP3k<=3)
states: 1,045,822,539,879,723 (15)
abstracting: (KdStarGStar<=Gab1)
states: 865,631,224,270,492 (14)
abstracting: (KdStarGStarPgP3<=AktP3)
states: 921,668,567,163,677 (14)
abstracting: (3<=DAG)
states: 148,187,806,970,077 (14)
abstracting: (KdStarPgStar<=11)
states: 1,115,503,996,542,617 (15)
MC time: 1m38.727sec

checking: AG [[[~ [[7<=KdStarGStarP3kStarP3 & KdStarGStarP3kStar<=PtP3]] | ~ [[~ [[~ [KdStarGStarP3kStar<=13] | [Enz<=GStarPgP3 & KdStarGStarPgStarP2<=13]]] | [[[Enz<=PtP3 | Pg<=13] & 11<=KdStarGStarPgStarP2] & [[PtP3P2<=12 & Pten<=14] | [GStarPgP3<=5 & PtP2<=11]]]]]] | [~ [[[~ [[DAGE<=KdStarGStarP3kStarP2 | [[15<=KdStarGStarPgStarP2 | 3<=KdStarGStarP3kStarP2] | KdStarGStarP3kP3<=Enz]]] | ~ [[[PtP3<=3 & Pip2<=KdStarG] & [PtP2<=5 | GStarPgP3<=PtP3]]]] & ~ [[[~ [KdStarGStarP3kStar<=0] & ~ [[5<=KdStarGStarPgStarP3P2 | Pg<=KdStarG]]] | [[[GStarP3<=DAG | Akt<=0] & ~ [KdStarPg<=KdStarGP3]] | [[6<=GStarP3 & Gab1<=8] & ~ [KdStarGStarP3kP3<=5]]]]]]] & [8<=Pip2 | ~ [[~ [14<=GStarP3] & Gab1<=KdStarGStarPgStar]]]]]]
normalized: ~ [E [true U ~ [[[[8<=Pip2 | ~ [[Gab1<=KdStarGStarPgStar & ~ [14<=GStarP3]]]] & ~ [[~ [[[[~ [KdStarGStarP3kP3<=5] & [6<=GStarP3 & Gab1<=8]] | [~ [KdStarPg<=KdStarGP3] & [GStarP3<=DAG | Akt<=0]]] | [~ [[5<=KdStarGStarPgStarP3P2 | Pg<=KdStarG]] & ~ [KdStarGStarP3kStar<=0]]]] & [~ [[[PtP2<=5 | GStarPgP3<=PtP3] & [PtP3<=3 & Pip2<=KdStarG]]] | ~ [[DAGE<=KdStarGStarP3kStarP2 | [KdStarGStarP3kP3<=Enz | [15<=KdStarGStarPgStarP2 | 3<=KdStarGStarP3kStarP2]]]]]]]] | [~ [[[[[GStarPgP3<=5 & PtP2<=11] | [PtP3P2<=12 & Pten<=14]] & [11<=KdStarGStarPgStarP2 & [Enz<=PtP3 | Pg<=13]]] | ~ [[[Enz<=GStarPgP3 & KdStarGStarPgStarP2<=13] | ~ [KdStarGStarP3kStar<=13]]]]] | ~ [[7<=KdStarGStarP3kStarP3 & KdStarGStarP3kStar<=PtP3]]]]]]]

abstracting: (KdStarGStarP3kStar<=PtP3)
states: 728,714,338,626,354 (14)
abstracting: (7<=KdStarGStarP3kStarP3)
states: 45,526,343,748 (10)
abstracting: (KdStarGStarP3kStar<=13)
states: 1,115,538,929,125,769 (15)
abstracting: (KdStarGStarPgStarP2<=13)
states: 1,115,538,966,667,804 (15)
abstracting: (Enz<=GStarPgP3)
states: 41,475,184 (7)
abstracting: (Pg<=13)
states: 1,108,296,427,601,675 (15)
abstracting: (Enz<=PtP3)
states: 125,312,304 (8)
abstracting: (11<=KdStarGStarPgStarP2)
states: 11,529,936 (7)
abstracting: (Pten<=14)
states: 961,964,332,200,555 (14)
abstracting: (PtP3P2<=12)
states: 1,115,538,966,669,107 (15)
abstracting: (PtP2<=11)
states: 1,115,531,753,135,285 (15)
abstracting: (GStarPgP3<=5)
states: 1,114,279,815,047,934 (15)
abstracting: (3<=KdStarGStarP3kStarP2)
states: 23,142,140,564,210 (13)
abstracting: (15<=KdStarGStarPgStarP2)
states: 16
abstracting: (KdStarGStarP3kP3<=Enz)
states: 1,115,538,966,669,107 (15)
abstracting: (DAGE<=KdStarGStarP3kStarP2)
states: 619,283,310,433,147 (14)
abstracting: (Pip2<=KdStarG)
states: 737,943,634,784,362 (14)
abstracting: (PtP3<=3)
states: 1,046,973,252,537,514 (15)
abstracting: (GStarPgP3<=PtP3)
states: 828,552,007,548,487 (14)
abstracting: (PtP2<=5)
states: 1,103,296,387,673,998 (15)
abstracting: (KdStarGStarP3kStar<=0)
states: 513,119,528,964,594 (14)
abstracting: (Pg<=KdStarG)
states: 18,194,473,369,055 (13)
abstracting: (5<=KdStarGStarPgStarP3P2)
states: 9,085,029,769 (9)
abstracting: (Akt<=0)
states: 74,535,506,948,012 (13)
abstracting: (GStarP3<=DAG)
states: 825,712,464,832,458 (14)
abstracting: (KdStarPg<=KdStarGP3)
states: 485,645,380,848,593 (14)
abstracting: (Gab1<=8)
states: 1,106,371,166,665,012 (15)
abstracting: (6<=GStarP3)
states: 1,957,819,827,888 (12)
abstracting: (KdStarGStarP3kP3<=5)
states: 1,115,289,486,455,235 (15)

before gc: list nodes free: 278675

after gc: idd nodes used:38498217, unused:25501783; list nodes free:246255431
abstracting: (14<=GStarP3)
states: 130,824 (5)
abstracting: (Gab1<=KdStarGStarPgStar)
states: 446,740,144,513,491 (14)
abstracting: (8<=Pip2)
states: 1,623,568,498,911 (12)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 1113460 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16097400 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 ReachabilityCardinality -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


sat_reach.icc:155: Timeout: after 221 sec


sat_reach.icc:155: Timeout: after 207 sec


sat_reach.icc:155: Timeout: after 194 sec


sat_reach.icc:155: Timeout: after 194 sec


sat_reach.icc:155: Timeout: after 181 sec


sat_reach.icc:155: Timeout: after 169 sec


sat_reach.icc:155: Timeout: after 158 sec


sat_reach.icc:155: Timeout: after 147 sec


sat_reach.icc:155: Timeout: after 137 sec


sat_reach.icc:155: Timeout: after 128 sec


sat_reach.icc:155: Timeout: after 120 sec


sat_reach.icc:155: Timeout: after 111 sec


sat_reach.icc:155: Timeout: after 104 sec


sat_reach.icc:155: Timeout: after 97 sec


sat_reach.icc:155: Timeout: after 90 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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167813598900342"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;