Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247300370.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Murphy-PT-D4N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K Mar 31 16:48 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 Murphy-PT-D4N050-CTLFireability-00
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-01
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-02
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-03
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-04
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-05
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-06
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-07
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-08
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-09
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-10
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-11
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-12
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-13
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-14
FORMULA_NAME Murphy-PT-D4N050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680893569744

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=Murphy-PT-D4N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:52:51] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-04-07 18:52:51] [INFO ] Transformed 30 places.
[2023-04-07 18:52:51] [INFO ] Transformed 35 transitions.
[2023-04-07 18:52:51] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D4N050-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:52:51] [INFO ] Computed 6 invariants in 10 ms
[2023-04-07 18:52:51] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
[2023-04-07 18:52:51] [INFO ] Invariant cache hit.
[2023-04-07 18:52:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 18:52:51] [INFO ] Invariant cache hit.
[2023-04-07 18:52:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 18:52:51] [INFO ] Invariant cache hit.
[2023-04-07 18:52:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:52:51] [INFO ] Flatten gal took : 17 ms
[2023-04-07 18:52:51] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:52:51] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 40) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:52:52] [INFO ] Invariant cache hit.
[2023-04-07 18:52:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:52:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:52:52] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:52:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:52:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:52:52] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:52:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:52] [INFO ] After 19ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:52:52] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 18:52:52] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 15 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 9 ms. Remains 15 /30 variables (removed 15) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-04-07 18:52:52] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:52:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 15/30 places, 20/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 171 ms. (steps per millisecond=348 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 95 ms. (steps per millisecond=627 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA Murphy-PT-D4N050-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:52:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 6 ms
FORMULA Murphy-PT-D4N050-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:52:53] [INFO ] Computed 6 invariants in 1 ms
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:53] [INFO ] Invariant cache hit.
[2023-04-07 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:53] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 18:52:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 2474 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: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.749sec


RS generation: 1m16.936sec


-> reachability set: #nodes 80010 (8.0e+04) #states 7,258,754,799,509,878,656 (18)



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

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

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

FORMULA Murphy-PT-D4N050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.574sec

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

abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
.-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.160sec

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

abstracting: (p24<=0)
states: 2,419,584,933,169,959,552 (18)
.-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.830sec

checking: AX [[EX [p25<=2] & 3<=p26]]
normalized: ~ [EX [~ [[3<=p26 & EX [p25<=2]]]]]

abstracting: (p25<=2)
states: 6,048,962,332,924,898,880 (18)
.abstracting: (3<=p26)
states: 1,209,792,466,584,979,776 (18)
.-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.334sec

checking: A [AX [p19<=0] U 1<=p19]
normalized: [~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [EX [~ [p19<=0]] & ~ [1<=p19]]]]]

abstracting: (1<=p19)
states: 3,629,377,399,754,939,328 (18)
abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
.abstracting: (1<=p19)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p19)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.454sec

checking: AG [A [~ [[AF [1<=p15] | [[[1<=p8 & 1<=p13] & 1<=p3] | p15<=0]]] U EX [AF [p19<=0]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [~ [EG [~ [p19<=0]]]]]]] & ~ [E [~ [EX [~ [EG [~ [p19<=0]]]]] U [[[p15<=0 | [1<=p3 & [1<=p8 & 1<=p13]]] | ~ [EG [~ [1<=p15]]]] & ~ [EX [~ [EG [~ [p19<=0]]]]]]]]]]]]

abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (p15<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
.abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.098sec

checking: EF [AG [[[p2<=0 | p7<=0] | [p12<=0 | [[2<=p15 & 1<=p20] | [[3<=p4 & 1<=p14] & [1<=p24 & [1<=p3 & 1<=p8]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[p12<=0 | [[[1<=p24 & [1<=p3 & 1<=p8]] & [3<=p4 & 1<=p14]] | [2<=p15 & 1<=p20]]] | [p2<=0 | p7<=0]]]]]]

abstracting: (p7<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p2<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (1<=p20)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p12<=0)
states: 243,763,691,243,892,192 (17)
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.284sec

checking: EX [[AX [[1<=p4 & 1<=p9]] | [[EF [1<=p20] & [1<=p23 & 3<=p2]] & [1<=p12 & [1<=p22 & [[1<=p1 & 1<=p6] | [3<=p1 & [1<=p11 & 1<=p21]]]]]]]]
normalized: EX [[[[1<=p12 & [1<=p22 & [[3<=p1 & [1<=p11 & 1<=p21]] | [1<=p1 & 1<=p6]]]] & [[1<=p23 & 3<=p2] & E [true U 1<=p20]]] | ~ [EX [~ [[1<=p4 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p4)
states: 7,014,991,108,265,986,464 (18)
.abstracting: (1<=p20)
states: 4,839,169,866,339,919,104 (18)
abstracting: (3<=p2)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p21)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p1)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p22)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p12)
states: 7,014,991,108,265,986,464 (18)
.-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.220sec

checking: [EG [[[~ [A [[1<=p1 & [1<=p6 & 1<=p11]] U [1<=p0 & [1<=p5 & 1<=p10]]]] & EF [p26<=2]] & [AF [[p1<=0 | p6<=0]] & E [EX [AF [1<=p15]] U [AX [1<=p17] | 1<=p17]]]]] | EG [[EF [AX [[p4<=0 | p9<=0]]] & 3<=p27]]]
normalized: [EG [[3<=p27 & E [true U ~ [EX [~ [[p4<=0 | p9<=0]]]]]]] | EG [[[E [EX [~ [EG [~ [1<=p15]]]] U [1<=p17 | ~ [EX [~ [1<=p17]]]]] & ~ [EG [~ [[p1<=0 | p6<=0]]]]] & [E [true U p26<=2] & ~ [[~ [EG [~ [[1<=p0 & [1<=p5 & 1<=p10]]]]] & ~ [E [~ [[1<=p0 & [1<=p5 & 1<=p10]]] U [~ [[1<=p1 & [1<=p6 & 1<=p11]]] & ~ [[1<=p0 & [1<=p5 & 1<=p10]]]]]]]]]]]]

abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (p26<=2)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p6<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p1<=0)
states: 243,763,691,243,892,192 (17)
.
EG iterations: 1
abstracting: (1<=p17)
states: 3,629,377,399,754,939,328 (18)
.abstracting: (1<=p17)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p15)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (p9<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p4<=0)
states: 243,763,691,243,892,192 (17)
.abstracting: (3<=p27)
states: 1,209,792,466,584,979,776 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m29.169sec

checking: AX [[EG [AG [[[1<=p3 & 1<=p8] | 1<=p17]]] | [AX [[[[1<=p1 & [1<=p6 & 1<=p11]] | [1<=p3 & [1<=p8 & 1<=p13]]] & [p3<=0 | [p8<=0 | p13<=0]]]] | AF [[p4<=2 | [p14<=0 | p24<=0]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[p4<=2 | [p14<=0 | p24<=0]]]]] | ~ [EX [~ [[[p3<=0 | [p8<=0 | p13<=0]] & [[1<=p3 & [1<=p8 & 1<=p13]] | [1<=p1 & [1<=p6 & 1<=p11]]]]]]]] | EG [~ [E [true U ~ [[1<=p17 | [1<=p3 & 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p17)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (p13<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p8<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p3<=0)
states: 243,763,691,243,892,192 (17)
.abstracting: (p24<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p14<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p4<=2)
states: 716,629,420,963,697,760 (17)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.832sec

checking: A [[[AF [[1<=p4 & 1<=p9]] & 3<=p2] & [1<=p12 & 1<=p22]] U A [[EX [EF [1<=p16]] | A [~ [A [3<=p25 U [1<=p0 & 1<=p5]]] U [EG [[1<=p0 & [1<=p5 & 1<=p10]]] & AX [1<=0]]]] U [~ [AG [AF [[1<=p2 & 1<=p7]]]] | [1<=p18 | [[[EF [[1<=p1 & [1<=p6 & 1<=p11]]] & 3<=p4] & [1<=p14 & 1<=p24]] & [[1<=p1 & 1<=p6] & [1<=p3 & [1<=p8 & 1<=p13]]]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]] & ~ [E [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]] U [~ [[[~ [EG [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]] & ~ [E [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]] U [[~ [EG [~ [[1<=p0 & 1<=p5]]]] & ~ [E [~ [[1<=p0 & 1<=p5]] U [~ [3<=p25] & ~ [[1<=p0 & 1<=p5]]]]]] & ~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]]]] | EX [E [true U 1<=p16]]]] & ~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]] & ~ [E [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]] U [~ [[[~ [EG [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]] & ~ [E [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]] U [[~ [EG [~ [[1<=p0 & 1<=p5]]]] & ~ [E [~ [[1<=p0 & 1<=p5]] U [~ [3<=p25] & ~ [[1<=p0 & 1<=p5]]]]]] & ~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]]]] | EX [E [true U 1<=p16]]]] & ~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]]]]] U [~ [[[1<=p12 & 1<=p22] & [3<=p2 & ~ [EG [~ [[1<=p4 & 1<=p9]]]]]]] & ~ [[~ [EG [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]] & ~ [E [~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]] U [~ [[[~ [EG [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]] & ~ [E [~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]] U [[~ [EG [~ [[1<=p0 & 1<=p5]]]] & ~ [E [~ [[1<=p0 & 1<=p5]] U [~ [3<=p25] & ~ [[1<=p0 & 1<=p5]]]]]] & ~ [[~ [EX [~ [1<=0]]] & EG [[1<=p0 & [1<=p5 & 1<=p10]]]]]]]]] | EX [E [true U 1<=p16]]]] & ~ [[[1<=p18 | [[[1<=p3 & [1<=p8 & 1<=p13]] & [1<=p1 & 1<=p6]] & [[1<=p14 & 1<=p24] & [3<=p4 & E [true U [1<=p1 & [1<=p6 & 1<=p11]]]]]]] | E [true U EG [~ [[1<=p2 & 1<=p7]]]]]]]]]]]]]]]

abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p16)
states: 3,629,377,399,754,939,328 (18)
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
abstracting: (1<=p9)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p4)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (3<=p2)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p22)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p12)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p16)
states: 3,629,377,399,754,939,328 (18)
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p16)
states: 3,629,377,399,754,939,328 (18)
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p4)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.580sec

checking: E [EF [[~ [EX [AG [[3<=p0 & [1<=p20 & 1<=p10]]]]] & 1<=p20]] U [AG [[[1<=p1 & [1<=p6 & 3<=p28]] | [AG [[1<=p3 & 1<=p8]] | EF [3<=p25]]]] & [AF [[EF [3<=p27] & AG [[1<=p1 & [1<=p6 & 1<=p11]]]]] & [~ [[AX [~ [[1<=p0 & 1<=p5]]] & 3<=p27]] | EF [[AF [[1<=p4 & 1<=p9]] & [[1<=p21 | [1<=p2 & [1<=p7 & 1<=p12]]] & [[1<=p4 & [1<=p9 & 1<=p14]] | [1<=p0 & 1<=p5]]]]]]]]]
normalized: E [E [true U [1<=p20 & ~ [EX [~ [E [true U ~ [[3<=p0 & [1<=p20 & 1<=p10]]]]]]]]] U [[[E [true U [[[[1<=p0 & 1<=p5] | [1<=p4 & [1<=p9 & 1<=p14]]] & [1<=p21 | [1<=p2 & [1<=p7 & 1<=p12]]]] & ~ [EG [~ [[1<=p4 & 1<=p9]]]]]] | ~ [[3<=p27 & ~ [EX [[1<=p0 & 1<=p5]]]]]] & ~ [EG [~ [[~ [E [true U ~ [[1<=p1 & [1<=p6 & 1<=p11]]]]] & E [true U 3<=p27]]]]]] & ~ [E [true U ~ [[[E [true U 3<=p25] | ~ [E [true U ~ [[1<=p3 & 1<=p8]]]]] | [1<=p1 & [1<=p6 & 3<=p28]]]]]]]]

abstracting: (3<=p28)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (3<=p27)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p6)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p1)
states: 7,014,991,108,265,986,464 (18)

EG iterations: 0
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
.abstracting: (3<=p27)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p9)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p4)
states: 7,014,991,108,265,986,464 (18)
.
EG iterations: 1
abstracting: (1<=p12)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p21)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p14)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p9)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p4)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)

BK_STOP 1680894050195

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:45332 (1295), effective:8976 (256)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:1358 (38), effective:264 (7)

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

iterations count:535 (15), effective:125 (3)

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

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

iterations count:2285 (65), effective:375 (10)

iterations count:1039 (29), effective:126 (3)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

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

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

iterations count:120 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

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

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

iterations count:120 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

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

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

iterations count:120 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

iterations count:139 (3), effective:19 (0)

iterations count:1035 (29), effective:125 (3)

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

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

iterations count:535 (15), effective:125 (3)

iterations count:347 (9), effective:61 (1)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 523 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Murphy-PT-D4N050"
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 Murphy-PT-D4N050, 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 r522-tall-167987247300370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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