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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Feb 26 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 14:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 26 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 14:53 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 34K 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-01-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678683756587

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Angiogenesis-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:02:39] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-13 05:02:39] [INFO ] Transformed 39 places.
[2023-03-13 05:02:39] [INFO ] Transformed 64 transitions.
[2023-03-13 05:02:39] [INFO ] Found NUPN structural information;
[2023-03-13 05:02:39] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-01-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Applied a total of 1 rules in 11 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:02:39] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 05:02:39] [INFO ] Implicit Places using invariants in 247 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 290 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 37/39 places, 64/64 transitions.
Support contains 33 out of 37 places after structural reductions.
[2023-03-13 05:02:39] [INFO ] Flatten gal took : 44 ms
[2023-03-13 05:02:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 05:02:39] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 47) seen :30
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 64 rows 37 cols
[2023-03-13 05:02:40] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 05:02:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-13 05:02:40] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :11 sat :1 real:5
[2023-03-13 05:02:40] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 7 ms to minimize.
[2023-03-13 05:02:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 05:02:40] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :12 sat :0 real:5
[2023-03-13 05:02:40] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0 real:5
[2023-03-13 05:02:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 05:02:40] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :5
[2023-03-13 05:02:40] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2023-03-13 05:02:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 05:02:40] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :17 sat :0
[2023-03-13 05:02:40] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :0
Fused 17 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 17 atomic propositions for a total of 15 simplifications.
FORMULA Angiogenesis-PT-01-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:02:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 9 ms
[2023-03-13 05:02:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Angiogenesis-PT-01-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 7 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Graph (trivial) has 11 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 13 ms. Remains 36 /37 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 36/37 places, 63/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Graph (trivial) has 8 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 36 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 36 transition count 62
Applied a total of 5 rules in 11 ms. Remains 36 /37 variables (removed 1) and now considering 62/64 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 36/37 places, 62/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Graph (trivial) has 11 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 36 /37 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 36/37 places, 63/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 64
Applied a total of 4 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Graph (trivial) has 8 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 36 transition count 63
Applied a total of 7 rules in 3 ms. Remains 36 /37 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 36/37 places, 63/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 37/37 places, 64/64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:40] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:02:41] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 05:02:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 64 transitions and 181 arcs took 1 ms.
Total runtime 2095 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 37 NrTr: 64 NrArc: 181)

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

net check time: 0m 0.000sec

init dd package: 0m 2.949sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 187 (1.9e+02) #states 110



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

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

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

FORMULA Angiogenesis-PT-01-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AG [EF [[p8<=1 & 1<=p8]]]
normalized: ~ [E [true U ~ [E [true U [p8<=1 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 2
abstracting: (p8<=1)
states: 110
-> the formula is FALSE

FORMULA Angiogenesis-PT-01-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [AX [EF [AX [[p15<=1 & 1<=p15]]]]]
normalized: ~ [EX [EX [~ [E [true U ~ [EX [~ [[p15<=1 & 1<=p15]]]]]]]]]

abstracting: (1<=p15)
states: 2
abstracting: (p15<=1)
states: 110
...-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [EG [[[p6<=1 & 1<=p6] & [p31<=1 & 1<=p31]]]]
normalized: E [true U EG [[[p31<=1 & 1<=p31] & [p6<=1 & 1<=p6]]]]

abstracting: (1<=p6)
states: 6
abstracting: (p6<=1)
states: 110
abstracting: (1<=p31)
states: 72
abstracting: (p31<=1)
states: 110
..
EG iterations: 2
-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[[p13<=1 & 1<=p13] & [p32<=1 & 1<=p32]] U EF [~ [[~ [[p21<=1 & 1<=p21]] & ~ [[p20<=1 & 1<=p20]]]]]]
normalized: [~ [EG [~ [E [true U ~ [[~ [[p20<=1 & 1<=p20]] & ~ [[p21<=1 & 1<=p21]]]]]]]] & ~ [E [~ [E [true U ~ [[~ [[p20<=1 & 1<=p20]] & ~ [[p21<=1 & 1<=p21]]]]]] U [~ [[[p32<=1 & 1<=p32] & [p13<=1 & 1<=p13]]] & ~ [E [true U ~ [[~ [[p20<=1 & 1<=p20]] & ~ [[p21<=1 & 1<=p21]]]]]]]]]]

abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
abstracting: (1<=p20)
states: 13
abstracting: (p20<=1)
states: 110
abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
abstracting: (1<=p32)
states: 59
abstracting: (p32<=1)
states: 110
abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
abstracting: (1<=p20)
states: 13
abstracting: (p20<=1)
states: 110
abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
abstracting: (1<=p20)
states: 13
abstracting: (p20<=1)
states: 110
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EG [[E [EF [~ [[p1<=1 & 1<=p1]]] U [[~ [AG [[p17<=1 & 1<=p17]]] & ~ [[p14<=1 & 1<=p14]]] & AX [1<=0]]] | AG [[p10<=1 & 1<=p10]]]]
normalized: EG [[~ [E [true U ~ [[p10<=1 & 1<=p10]]]] | E [E [true U ~ [[p1<=1 & 1<=p1]]] U [~ [EX [~ [1<=0]]] & [~ [[p14<=1 & 1<=p14]] & E [true U ~ [[p17<=1 & 1<=p17]]]]]]]]

abstracting: (1<=p17)
states: 2
abstracting: (p17<=1)
states: 110
abstracting: (1<=p14)
states: 13
abstracting: (p14<=1)
states: 110
abstracting: (1<=0)
states: 0
.abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 110
abstracting: (1<=p10)
states: 4
abstracting: (p10<=1)
states: 110
.
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: E [AG [[[p8<=1 & 1<=p8] & [p9<=1 & 1<=p9]]] U ~ [E [[p13<=1 & 1<=p13] U AF [EX [[p10<=1 & 1<=p10]]]]]]
normalized: E [~ [E [true U ~ [[[p9<=1 & 1<=p9] & [p8<=1 & 1<=p8]]]]] U ~ [E [[p13<=1 & 1<=p13] U ~ [EG [~ [EX [[p10<=1 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 4
abstracting: (p10<=1)
states: 110
..
EG iterations: 1
abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
abstracting: (1<=p8)
states: 2
abstracting: (p8<=1)
states: 110
abstracting: (1<=p9)
states: 10
abstracting: (p9<=1)
states: 110
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: [EX [AF [AG [AF [[p1<=1 & 1<=p1]]]]] | EG [~ [E [AF [[p13<=1 & 1<=p13]] U AX [[[[p13<=1 & 1<=p13] & [p31<=1 & 1<=p31]] | [p36<=1 & 1<=p36]]]]]]]
normalized: [EG [~ [E [~ [EG [~ [[p13<=1 & 1<=p13]]]] U ~ [EX [~ [[[p36<=1 & 1<=p36] | [[p31<=1 & 1<=p31] & [p13<=1 & 1<=p13]]]]]]]]] | EX [~ [EG [E [true U EG [~ [[p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 110
.
EG iterations: 1

EG iterations: 0
.abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
abstracting: (1<=p31)
states: 72
abstracting: (p31<=1)
states: 110
abstracting: (1<=p36)
states: 0
abstracting: (p36<=1)
states: 110
.abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[[p21<=1 & 1<=p21] | AG [A [[p13<=1 & 1<=p13] U [[[p4<=1 & 1<=p4] & [p30<=1 & 1<=p30]] | [p34<=1 & 1<=p34]]]]]]
normalized: E [true U [~ [E [true U ~ [[~ [EG [~ [[[p34<=1 & 1<=p34] | [[p30<=1 & 1<=p30] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[p34<=1 & 1<=p34] | [[p30<=1 & 1<=p30] & [p4<=1 & 1<=p4]]]] U [~ [[p13<=1 & 1<=p13]] & ~ [[[p34<=1 & 1<=p34] | [[p30<=1 & 1<=p30] & [p4<=1 & 1<=p4]]]]]]]]]]] | [p21<=1 & 1<=p21]]]

abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
abstracting: (1<=p4)
states: 13
abstracting: (p4<=1)
states: 110
abstracting: (1<=p30)
states: 10
abstracting: (p30<=1)
states: 110
abstracting: (1<=p34)
states: 14
abstracting: (p34<=1)
states: 110
abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
abstracting: (1<=p4)
states: 13
abstracting: (p4<=1)
states: 110
abstracting: (1<=p30)
states: 10
abstracting: (p30<=1)
states: 110
abstracting: (1<=p34)
states: 14
abstracting: (p34<=1)
states: 110
abstracting: (1<=p4)
states: 13
abstracting: (p4<=1)
states: 110
abstracting: (1<=p30)
states: 10
abstracting: (p30<=1)
states: 110
abstracting: (1<=p34)
states: 14
abstracting: (p34<=1)
states: 110
.
EG iterations: 1
-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EF [[[p10<=0 & 0<=p10] | [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | [[p3<=0 & 0<=p3] & [[p30<=0 & 0<=p30] | [p34<=0 & 0<=p34]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[p34<=0 & 0<=p34] | [p30<=0 & 0<=p30]] & [p3<=0 & 0<=p3]] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] | [p10<=0 & 0<=p10]]]]]]

abstracting: (0<=p10)
states: 110
abstracting: (p10<=0)
states: 106
abstracting: (1<=p7)
states: 6
abstracting: (p7<=1)
states: 110
abstracting: (1<=p9)
states: 10
abstracting: (p9<=1)
states: 110
abstracting: (0<=p3)
states: 110
abstracting: (p3<=0)
states: 96
abstracting: (0<=p30)
states: 110
abstracting: (p30<=0)
states: 100
abstracting: (0<=p34)
states: 110
abstracting: (p34<=0)
states: 96
-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AX [[[[p22<=1 & 1<=p22] & [p29<=1 & 1<=p29]] & [[E [[p3<=1 & 1<=p3] U [p15<=1 & 1<=p15]] | [[p6<=0 & 0<=p6] | [p9<=0 & 0<=p9]]] & [EX [[[p9<=1 & 1<=p9] & [p32<=1 & 1<=p32]]] | [p21<=1 & 1<=p21]]]]]]
normalized: ~ [EX [EX [~ [[[[[p21<=1 & 1<=p21] | EX [[[p32<=1 & 1<=p32] & [p9<=1 & 1<=p9]]]] & [[[p9<=0 & 0<=p9] | [p6<=0 & 0<=p6]] | E [[p3<=1 & 1<=p3] U [p15<=1 & 1<=p15]]]] & [[p29<=1 & 1<=p29] & [p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 13
abstracting: (p22<=1)
states: 110
abstracting: (1<=p29)
states: 14
abstracting: (p29<=1)
states: 110
abstracting: (1<=p15)
states: 2
abstracting: (p15<=1)
states: 110
abstracting: (1<=p3)
states: 14
abstracting: (p3<=1)
states: 110
abstracting: (0<=p6)
states: 110
abstracting: (p6<=0)
states: 104
abstracting: (0<=p9)
states: 110
abstracting: (p9<=0)
states: 100
abstracting: (1<=p9)
states: 10
abstracting: (p9<=1)
states: 110
abstracting: (1<=p32)
states: 59
abstracting: (p32<=1)
states: 110
.abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
..-> the formula is FALSE

FORMULA Angiogenesis-PT-01-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EX [EF [AX [EG [[p7<=1 & 1<=p7]]]]] | [AG [[E [[p35<=1 & 1<=p35] U [p34<=1 & 1<=p34]] & [AF [[p26<=1 & 1<=p26]] & EG [[p17<=1 & 1<=p17]]]]] & [EG [[AX [[p15<=1 & 1<=p15]] | [AG [[p21<=1 & 1<=p21]] | E [[[[p0<=1 & 1<=p0] & [p30<=1 & 1<=p30]] | [p1<=1 & 1<=p1]] U [[p28<=1 & 1<=p28] | [p10<=1 & 1<=p10]]]]]] & AF [[EF [AG [[[p13<=1 & 1<=p13] & [p32<=1 & 1<=p32]]]] & [p8<=1 & 1<=p8]]]]]]
normalized: [[[~ [EG [~ [[[p8<=1 & 1<=p8] & E [true U ~ [E [true U ~ [[[p32<=1 & 1<=p32] & [p13<=1 & 1<=p13]]]]]]]]]] & EG [[[E [[[p1<=1 & 1<=p1] | [[p30<=1 & 1<=p30] & [p0<=1 & 1<=p0]]] U [[p10<=1 & 1<=p10] | [p28<=1 & 1<=p28]]] | ~ [E [true U ~ [[p21<=1 & 1<=p21]]]]] | ~ [EX [~ [[p15<=1 & 1<=p15]]]]]]] & ~ [E [true U ~ [[[EG [[p17<=1 & 1<=p17]] & ~ [EG [~ [[p26<=1 & 1<=p26]]]]] & E [[p35<=1 & 1<=p35] U [p34<=1 & 1<=p34]]]]]]] | EX [E [true U ~ [EX [~ [EG [[p7<=1 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 6
abstracting: (p7<=1)
states: 110
..
EG iterations: 2
..abstracting: (1<=p34)
states: 14
abstracting: (p34<=1)
states: 110
abstracting: (1<=p35)
states: 10
abstracting: (p35<=1)
states: 110
abstracting: (1<=p26)
states: 8
abstracting: (p26<=1)
states: 110
.
EG iterations: 1
abstracting: (1<=p17)
states: 2
abstracting: (p17<=1)
states: 110
..
EG iterations: 2
abstracting: (1<=p15)
states: 2
abstracting: (p15<=1)
states: 110
.abstracting: (1<=p21)
states: 2
abstracting: (p21<=1)
states: 110
abstracting: (1<=p28)
states: 1
abstracting: (p28<=1)
states: 110
abstracting: (1<=p10)
states: 4
abstracting: (p10<=1)
states: 110
abstracting: (1<=p0)
states: 61
abstracting: (p0<=1)
states: 110
abstracting: (1<=p30)
states: 10
abstracting: (p30<=1)
states: 110
abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 110
..
EG iterations: 2
abstracting: (1<=p13)
states: 2
abstracting: (p13<=1)
states: 110
abstracting: (1<=p32)
states: 59
abstracting: (p32<=1)
states: 110
abstracting: (1<=p8)
states: 2
abstracting: (p8<=1)
states: 110

EG iterations: 0
-> the formula is TRUE

FORMULA Angiogenesis-PT-01-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 9606 (9.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 32878 100972 133850
used/not used/entry size/cache size: 109533 66999331 16 1024MB
basic ops cache: hits/miss/sum: 8478 13946 22424
used/not used/entry size/cache size: 22837 16754379 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 378 1205 1583
used/not used/entry size/cache size: 1205 8387403 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67099295
1 9532
2 37
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.897sec


BK_STOP 1678683766197

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:755 (11), effective:53 (0)

initing FirstDep: 0m 0.000sec


iterations count:534 (8), effective:33 (0)

iterations count:533 (8), effective:32 (0)

iterations count:514 (8), effective:32 (0)

iterations count:534 (8), effective:33 (0)

iterations count:521 (8), effective:31 (0)

iterations count:449 (7), effective:27 (0)

iterations count:449 (7), effective:27 (0)

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

iterations count:449 (7), effective:27 (0)

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

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

iterations count:534 (8), effective:33 (0)

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

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

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

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

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

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

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

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

iterations count:532 (8), effective:32 (0)

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

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

iterations count:534 (8), effective:33 (0)

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

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

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

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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