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.r138-smll-167819421400642.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 EGFr-PT-02010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421400642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 19:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 19:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 19:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 59K 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 EGFr-PT-02010-CTLFireability-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-11
FORMULA_NAME EGFr-PT-02010-CTLFireability-12
FORMULA_NAME EGFr-PT-02010-CTLFireability-13
FORMULA_NAME EGFr-PT-02010-CTLFireability-14
FORMULA_NAME EGFr-PT-02010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679018943536

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=EGFr-PT-02010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 02:09:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 02:09:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 02:09:07] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-17 02:09:07] [INFO ] Transformed 40 places.
[2023-03-17 02:09:07] [INFO ] Transformed 68 transitions.
[2023-03-17 02:09:07] [INFO ] Found NUPN structural information;
[2023-03-17 02:09:07] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
FORMULA EGFr-PT-02010-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 23 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-17 02:09:07] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2023-03-17 02:09:07] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-17 02:09:08] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-17 02:09:08] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:09:08] [INFO ] Invariant cache hit.
[2023-03-17 02:09:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 02:09:08] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-17 02:09:08] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:09:08] [INFO ] Invariant cache hit.
[2023-03-17 02:09:08] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 40/40 places, 68/68 transitions.
Support contains 40 out of 40 places after structural reductions.
[2023-03-17 02:09:08] [INFO ] Flatten gal took : 66 ms
[2023-03-17 02:09:08] [INFO ] Flatten gal took : 37 ms
[2023-03-17 02:09:09] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 451 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 39) seen :24
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-17 02:09:09] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:09:09] [INFO ] Invariant cache hit.
[2023-03-17 02:09:10] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-17 02:09:10] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-17 02:09:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-17 02:09:10] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2023-03-17 02:09:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 02:09:10] [INFO ] After 43ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :7 sat :8
[2023-03-17 02:09:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 6 ms to minimize.
[2023-03-17 02:09:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-17 02:09:10] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :7
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-17 02:09:10] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :7
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 68/68 transitions.
Graph (complete) has 137 edges and 40 vertex of which 36 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 19 ms. Remains 36 /40 variables (removed 4) and now considering 63/68 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 36/40 places, 63/68 transitions.
Incomplete random walk after 10000 steps, including 491 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Probably explored full state space saw : 2985 states, properties seen :0
Probabilistic random walk after 17107 steps, saw 2985 distinct states, run finished after 124 ms. (steps per millisecond=137 ) properties seen :0
Explored full state space saw : 2985 states, properties seen :0
Exhaustive walk after 17107 steps, saw 2985 distinct states, run finished after 92 ms. (steps per millisecond=185 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
FORMULA EGFr-PT-02010-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 02:09:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 20 ms
[2023-03-17 02:09:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 02:09:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-02010-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 8 ms
FORMULA EGFr-PT-02010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 25 out of 40 places (down from 30) after GAL structural reductions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 7 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Input system was already deterministic with 68 transitions.
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Flatten gal took : 6 ms
[2023-03-17 02:09:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-17 02:09:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 68 transitions and 338 arcs took 1 ms.
Total runtime 4617 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: 40 NrTr: 68 NrArc: 338)

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

net check time: 0m 0.000sec

init dd package: 0m 3.547sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 180 (1.8e+02) #states 4,200 (3)



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

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

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

FORMULA EGFr-PT-02010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: E [[[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]] U AX [1<=0]]
normalized: E [[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p26)
states: 960
abstracting: (p26<=1)
states: 4,200 (3)
-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [EF [[[p15<=1 & 1<=p15] & [p30<=1 & 1<=p30]]]]
normalized: EG [E [true U [[p30<=1 & 1<=p30] & [p15<=1 & 1<=p15]]]]

abstracting: (1<=p15)
states: 4,017 (3)
abstracting: (p15<=1)
states: 4,200 (3)
abstracting: (1<=p30)
states: 1,507 (3)
abstracting: (p30<=1)
states: 4,200 (3)
........................
EG iterations: 24
-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EX [EX [[EG [[[[1<=p6 & p6<=1] & [p9<=1 & 1<=p9]] | [[p33<=0 & 0<=p33] | [p37<=0 & 0<=p37]]]] | [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]]]
normalized: EX [EX [[[[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]] | EG [[[[p37<=0 & 0<=p37] | [p33<=0 & 0<=p33]] | [[p9<=1 & 1<=p9] & [1<=p6 & p6<=1]]]]]]]

abstracting: (p6<=1)
states: 4,200 (3)
abstracting: (1<=p6)
states: 2,985 (3)
abstracting: (1<=p9)
states: 2,187 (3)
abstracting: (p9<=1)
states: 4,200 (3)
abstracting: (0<=p33)
states: 4,200 (3)
abstracting: (p33<=0)
states: 672
abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p26)
states: 960
abstracting: (p26<=1)
states: 4,200 (3)
..-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: A [AF [AG [[[[p4<=1 & 1<=p4] & [p39<=1 & 1<=p39]] | [[p0<=1 & 1<=p0] & [p15<=1 & 1<=p15]]]]] U [[p0<=1 & 1<=p0] & [p23<=1 & 1<=p23]]]
normalized: [~ [EG [~ [[[p23<=1 & 1<=p23] & [p0<=1 & 1<=p0]]]]] & ~ [E [~ [[[p23<=1 & 1<=p23] & [p0<=1 & 1<=p0]]] U [~ [[[p23<=1 & 1<=p23] & [p0<=1 & 1<=p0]]] & EG [E [true U ~ [[[[p15<=1 & 1<=p15] & [p0<=1 & 1<=p0]] | [[p39<=1 & 1<=p39] & [p4<=1 & 1<=p4]]]]]]]]]]

abstracting: (1<=p4)
states: 3,471 (3)
abstracting: (p4<=1)
states: 4,200 (3)
abstracting: (1<=p39)
states: 243
abstracting: (p39<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p15)
states: 4,017 (3)
abstracting: (p15<=1)
states: 4,200 (3)

EG iterations: 0
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p23)
states: 1,399 (3)
abstracting: (p23<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p23)
states: 1,399 (3)
abstracting: (p23<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p23)
states: 1,399 (3)
abstracting: (p23<=1)
states: 4,200 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [AX [[EG [AF [AX [[[p33<=1 & 1<=p33] & [p37<=1 & 1<=p37]]]]] | AG [[[p15<=0 & 0<=p15] | [[p30<=0 & 0<=p30] | [[p5<=1 & 1<=p5] & [p37<=1 & 1<=p37]]]]]]] | EG [AG [[[p1<=1 & 1<=p1] & [p37<=1 & 1<=p37]]]]]
normalized: [EG [~ [E [true U ~ [[[p37<=1 & 1<=p37] & [p1<=1 & 1<=p1]]]]]] | ~ [EX [~ [[~ [E [true U ~ [[[[[p37<=1 & 1<=p37] & [p5<=1 & 1<=p5]] | [p30<=0 & 0<=p30]] | [p15<=0 & 0<=p15]]]]] | EG [~ [EG [EX [~ [[[p37<=1 & 1<=p37] & [p33<=1 & 1<=p33]]]]]]]]]]]]

abstracting: (1<=p33)
states: 3,528 (3)
abstracting: (p33<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.........................
EG iterations: 24

EG iterations: 0
abstracting: (0<=p15)
states: 4,200 (3)
abstracting: (p15<=0)
states: 183
abstracting: (0<=p30)
states: 4,200 (3)
abstracting: (p30<=0)
states: 2,693 (3)
abstracting: (1<=p5)
states: 729
abstracting: (p5<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AX [A [[AF [~ [[[p15<=1 & 1<=p15] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]] & [AF [[[[p5<=1 & 1<=p5] & [p37<=1 & 1<=p37]] | [[p1<=1 & 1<=p1] & [[p22<=1 & 1<=p22] & [p28<=1 & 1<=p28]]]]] | ~ [A [[[p19<=1 & 1<=p19] & [p30<=1 & 1<=p30]] U [[p1<=1 & 1<=p1] & [[p22<=1 & 1<=p22] & [p28<=1 & 1<=p28]]]]]]] U [AG [EX [[[p33<=1 & 1<=p33] & [p37<=1 & 1<=p37]]]] | AX [1<=0]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[~ [EX [~ [1<=0]]] | ~ [E [true U ~ [EX [[[p37<=1 & 1<=p37] & [p33<=1 & 1<=p33]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [1<=0]]] | ~ [E [true U ~ [EX [[[p37<=1 & 1<=p37] & [p33<=1 & 1<=p33]]]]]]]] U [~ [[[~ [[~ [EG [~ [[[[p28<=1 & 1<=p28] & [p22<=1 & 1<=p22]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[[p28<=1 & 1<=p28] & [p22<=1 & 1<=p22]] & [p1<=1 & 1<=p1]]] U [~ [[[p30<=1 & 1<=p30] & [p19<=1 & 1<=p19]]] & ~ [[[[p28<=1 & 1<=p28] & [p22<=1 & 1<=p22]] & [p1<=1 & 1<=p1]]]]]]]] | ~ [EG [~ [[[[[p28<=1 & 1<=p28] & [p22<=1 & 1<=p22]] & [p1<=1 & 1<=p1]] | [[p37<=1 & 1<=p37] & [p5<=1 & 1<=p5]]]]]]] & ~ [EG [[[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [p15<=1 & 1<=p15]]]]]] & ~ [[~ [EX [~ [1<=0]]] | ~ [E [true U ~ [EX [[[p37<=1 & 1<=p37] & [p33<=1 & 1<=p33]]]]]]]]]]]]]]]

abstracting: (1<=p33)
states: 3,528 (3)
abstracting: (p33<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p15)
states: 4,017 (3)
abstracting: (p15<=1)
states: 4,200 (3)
abstracting: (1<=p18)
states: 2,655 (3)
abstracting: (p18<=1)
states: 4,200 (3)
abstracting: (1<=p25)
states: 3,261 (3)
abstracting: (p25<=1)
states: 4,200 (3)
.....................
EG iterations: 21
abstracting: (1<=p5)
states: 729
abstracting: (p5<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p22)
states: 2,801 (3)
abstracting: (p22<=1)
states: 4,200 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p22)
states: 2,801 (3)
abstracting: (p22<=1)
states: 4,200 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
abstracting: (1<=p19)
states: 1,545 (3)
abstracting: (p19<=1)
states: 4,200 (3)
abstracting: (1<=p30)
states: 1,507 (3)
abstracting: (p30<=1)
states: 4,200 (3)
abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p22)
states: 2,801 (3)
abstracting: (p22<=1)
states: 4,200 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
abstracting: (1<=p1)
states: 2,862 (3)
abstracting: (p1<=1)
states: 4,200 (3)
abstracting: (1<=p22)
states: 2,801 (3)
abstracting: (p22<=1)
states: 4,200 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (1<=p33)
states: 3,528 (3)
abstracting: (p33<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p33)
states: 3,528 (3)
abstracting: (p33<=1)
states: 4,200 (3)
abstracting: (1<=p37)
states: 1,580 (3)
abstracting: (p37<=1)
states: 4,200 (3)
.abstracting: (1<=0)
states: 0
.........................
EG iterations: 24
.-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: AF [[~ [A [~ [[AF [[[[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [[p32<=1 & 1<=p32] & [p36<=1 & 1<=p36]]]]] | E [[[p15<=1 & 1<=p15] & [[p16<=1 & 1<=p16] & [p21<=1 & 1<=p21]]] U [[p15<=1 & 1<=p15] & [[p18<=1 & 1<=p18] & [p25<=1 & 1<=p25]]]]]] U AG [EF [[[p0<=1 & 1<=p0] & [p17<=1 & 1<=p17]]]]]] | [[[p4<=1 & 1<=p4] & [p9<=1 & 1<=p9]] & [[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]]]]]
normalized: ~ [EG [~ [[[[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [[p9<=1 & 1<=p9] & [p4<=1 & 1<=p4]]] | ~ [[~ [EG [E [true U ~ [E [true U [[p17<=1 & 1<=p17] & [p0<=1 & 1<=p0]]]]]]] & ~ [E [E [true U ~ [E [true U [[p17<=1 & 1<=p17] & [p0<=1 & 1<=p0]]]]] U [[E [[[[p21<=1 & 1<=p21] & [p16<=1 & 1<=p16]] & [p15<=1 & 1<=p15]] U [[[p25<=1 & 1<=p25] & [p18<=1 & 1<=p18]] & [p15<=1 & 1<=p15]]] | ~ [EG [~ [[[[[p36<=1 & 1<=p36] & [p32<=1 & 1<=p32]] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]]]] & E [true U ~ [E [true U [[p17<=1 & 1<=p17] & [p0<=1 & 1<=p0]]]]]]]]]]]]]]

abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p17)
states: 1,545 (3)
abstracting: (p17<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p2)
states: 3,646 (3)
abstracting: (p2<=1)
states: 4,200 (3)
abstracting: (1<=p4)
states: 3,471 (3)
abstracting: (p4<=1)
states: 4,200 (3)
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (1<=p36)
states: 2,620 (3)
abstracting: (p36<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (1<=p15)
states: 4,017 (3)
abstracting: (p15<=1)
states: 4,200 (3)
abstracting: (1<=p18)
states: 2,655 (3)
abstracting: (p18<=1)
states: 4,200 (3)
abstracting: (1<=p25)
states: 3,261 (3)
abstracting: (p25<=1)
states: 4,200 (3)
abstracting: (1<=p15)
states: 4,017 (3)
abstracting: (p15<=1)
states: 4,200 (3)
abstracting: (1<=p16)
states: 2,655 (3)
abstracting: (p16<=1)
states: 4,200 (3)
abstracting: (1<=p21)
states: 3,261 (3)
abstracting: (p21<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p17)
states: 1,545 (3)
abstracting: (p17<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (1<=p17)
states: 1,545 (3)
abstracting: (p17<=1)
states: 4,200 (3)

EG iterations: 0
abstracting: (1<=p4)
states: 3,471 (3)
abstracting: (p4<=1)
states: 4,200 (3)
abstracting: (1<=p9)
states: 2,187 (3)
abstracting: (p9<=1)
states: 4,200 (3)
abstracting: (1<=p34)
states: 2,620 (3)
abstracting: (p34<=1)
states: 4,200 (3)
abstracting: (1<=p36)
states: 2,620 (3)
abstracting: (p36<=1)
states: 4,200 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

totally nodes used: 133695 (1.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 62728 315804 378532
used/not used/entry size/cache size: 433955 66674909 16 1024MB
basic ops cache: hits/miss/sum: 17084 59497 76581
used/not used/entry size/cache size: 107486 16669730 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: 635 1975 2610
used/not used/entry size/cache size: 1975 8386633 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 66979032
1 126201
2 3403
3 224
4 4
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.605sec


BK_STOP 1679018958717

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

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


initing FirstDep: 0m 0.000sec


iterations count:998 (14), effective:57 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

iterations count:249 (3), effective:18 (0)

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

iterations count:249 (3), effective:18 (0)

iterations count:249 (3), effective:18 (0)

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

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

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

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

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

iterations count:86 (1), effective:4 (0)

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

iterations count:99 (1), effective:3 (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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r138-smll-167819421400642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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