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.r330-tall-167889203200418.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 Referendum-COL-0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203200418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.8K Mar 5 18:23 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 Referendum-COL-0020-CTLFireability-00
FORMULA_NAME Referendum-COL-0020-CTLFireability-01
FORMULA_NAME Referendum-COL-0020-CTLFireability-02
FORMULA_NAME Referendum-COL-0020-CTLFireability-03
FORMULA_NAME Referendum-COL-0020-CTLFireability-04
FORMULA_NAME Referendum-COL-0020-CTLFireability-05
FORMULA_NAME Referendum-COL-0020-CTLFireability-06
FORMULA_NAME Referendum-COL-0020-CTLFireability-07
FORMULA_NAME Referendum-COL-0020-CTLFireability-08
FORMULA_NAME Referendum-COL-0020-CTLFireability-09
FORMULA_NAME Referendum-COL-0020-CTLFireability-10
FORMULA_NAME Referendum-COL-0020-CTLFireability-11
FORMULA_NAME Referendum-COL-0020-CTLFireability-12
FORMULA_NAME Referendum-COL-0020-CTLFireability-13
FORMULA_NAME Referendum-COL-0020-CTLFireability-14
FORMULA_NAME Referendum-COL-0020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679159964896

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=Referendum-COL-0020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 17:19:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 17:19:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:19:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 17:19:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:19:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 358 ms
[2023-03-18 17:19:26] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 61 PT places and 41.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2023-03-18 17:19:26] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 3 ms.
[2023-03-18 17:19:26] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 8 formulas.
FORMULA Referendum-COL-0020-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 12 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]]] introduces in Voters(20) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 20
[2023-03-18 17:19:27] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 8 ms.
[2023-03-18 17:19:27] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 5 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 17:19:27] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 17:19:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-18 17:19:27] [INFO ] Invariant cache hit.
[2023-03-18 17:19:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-18 17:19:27] [INFO ] Invariant cache hit.
[2023-03-18 17:19:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 2 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 2 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10004 steps, including 434 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10004 steps, including 434 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10004 steps, including 434 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 17:19:27] [INFO ] Invariant cache hit.
[2023-03-18 17:19:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
FORMULA Referendum-COL-0020-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 2 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Input system was already deterministic with 2 transitions.
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:19:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:19:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 17:19:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2 places, 2 transitions and 3 arcs took 0 ms.
Total runtime 1283 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: 2 NrTr: 2 NrArc: 3)

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

net check time: 0m 0.000sec

init dd package: 0m 2.789sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 3 (3.0e+00) #states 22



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

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

abstracting: (1<=p1)
states: 20
..-> the formula is TRUE

FORMULA Referendum-COL-0020-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AF [1<=p0] & EF [[1<=p1 & AX [EX [1<=p1]]]]]]
normalized: EX [[~ [EG [~ [1<=p0]]] & E [true U [~ [EX [~ [EX [1<=p1]]]] & 1<=p1]]]]

abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
..abstracting: (1<=p0)
states: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AX [[EX [1<=p0] | [AX [1<=p1] | p1<=0]]]]
normalized: EG [~ [EX [~ [[[~ [EX [~ [1<=p1]]] | p1<=0] | EX [1<=p0]]]]]]

abstracting: (1<=p0)
states: 1
.abstracting: (p1<=0)
states: 2
abstracting: (1<=p1)
states: 20
......................
EG iterations: 20
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [[1<=p1 | AF [[AX [p1<=0] & p0<=0]]]]
normalized: EG [[~ [EG [~ [[~ [EX [~ [p1<=0]]] & p0<=0]]]] | 1<=p1]]

abstracting: (1<=p1)
states: 20
abstracting: (p0<=0)
states: 21
abstracting: (p1<=0)
states: 2
......................
EG iterations: 21

EG iterations: 0
-> the formula is TRUE

FORMULA Referendum-COL-0020-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [E [1<=p0 U 1<=p1]] & [1<=p0 & p1<=0]]]
normalized: E [true U [[1<=p0 & p1<=0] & ~ [E [1<=p0 U 1<=p1]]]]

abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
abstracting: (p1<=0)
states: 2
abstracting: (1<=p0)
states: 1
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[p1<=0 & [EG [1<=p1] & [AG [EF [p0<=0]] | EG [EF [p0<=0]]]]]]
normalized: ~ [EG [~ [[[[EG [E [true U p0<=0]] | ~ [E [true U ~ [E [true U p0<=0]]]]] & EG [1<=p1]] & p1<=0]]]]

abstracting: (p1<=0)
states: 2
abstracting: (1<=p1)
states: 20
.....................
EG iterations: 21
abstracting: (p0<=0)
states: 21
abstracting: (p0<=0)
states: 21

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [1<=p1 U A [A [1<=p1 U 1<=p1] U EG [EF [1<=p0]]]]]
normalized: ~ [E [1<=p1 U [~ [EG [~ [EG [E [true U 1<=p0]]]]] & ~ [E [~ [EG [E [true U 1<=p0]]] U [~ [[~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]] & ~ [EG [~ [1<=p1]]]]] & ~ [EG [E [true U 1<=p0]]]]]]]]]

abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 20
..
EG iterations: 2
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
..
EG iterations: 2

EG iterations: 0
abstracting: (1<=p1)
states: 20
-> the formula is TRUE

FORMULA Referendum-COL-0020-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EX [E [[E [1<=p0 U 1<=p1] | E [1<=p1 U 1<=p0]] U EG [1<=p1]]]]
normalized: ~ [EX [~ [EX [E [[E [1<=p1 U 1<=p0] | E [1<=p0 U 1<=p1]] U EG [1<=p1]]]]]]

abstracting: (1<=p1)
states: 20
.....................
EG iterations: 21
abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 20
..-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AF [[A [p1<=0 U EF [1<=p1]] & E [[1<=p0 | [1<=p1 | 1<=p1]] U AX [1<=p1]]]]]
normalized: ~ [E [true U EG [~ [[E [[1<=p0 | [1<=p1 | 1<=p1]] U ~ [EX [~ [1<=p1]]]] & [~ [EG [~ [E [true U 1<=p1]]]] & ~ [E [~ [E [true U 1<=p1]] U [~ [p1<=0] & ~ [E [true U 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 20
abstracting: (p1<=0)
states: 2
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 20
.abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [[~ [AF [EG [1<=p1]]] & EG [E [AG [1<=p1] U 1<=p0]]] U EX [[~ [EX [E [1<=p0 U 1<=p1]]] | 1<=p0]]]
normalized: E [[EG [E [~ [E [true U ~ [1<=p1]]] U 1<=p0]] & EG [~ [EG [1<=p1]]]] U EX [[~ [EX [E [1<=p0 U 1<=p1]]] | 1<=p0]]]

abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
..abstracting: (1<=p1)
states: 20
.....................
EG iterations: 21

EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 20
..
EG iterations: 2
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[EF [[AF [[1<=p1 | 1<=p0]] & [1<=p1 | EF [1<=p1]]]] | AG [[[1<=p1 | EG [1<=p0]] & EF [1<=p1]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[E [true U 1<=p1] & [EG [1<=p0] | 1<=p1]]]]] | E [true U [[E [true U 1<=p1] | 1<=p1] & ~ [EG [~ [[1<=p1 | 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 20
.
EG iterations: 1
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (1<=p1)
states: 20
-> the formula is FALSE

FORMULA Referendum-COL-0020-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [E [~ [EF [1<=p0]] U [AF [1<=p1] & AX [~ [E [1<=p0 U 1<=p0]]]]] & AF [[EG [[EG [p1<=0] | EF [p1<=0]]] | EF [~ [E [1<=p1 U 1<=p0]]]]]]
normalized: [~ [EG [~ [[E [true U ~ [E [1<=p1 U 1<=p0]]] | EG [[E [true U p1<=0] | EG [p1<=0]]]]]]] & E [~ [E [true U 1<=p0]] U [~ [EX [E [1<=p0 U 1<=p0]]] & ~ [EG [~ [1<=p1]]]]]]

abstracting: (1<=p1)
states: 20
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p0)
states: 1
abstracting: (p1<=0)
states: 2
..
EG iterations: 2
abstracting: (p1<=0)
states: 2

EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 20
.
EG iterations: 1
-> the formula is TRUE

FORMULA Referendum-COL-0020-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [[~ [E [1<=p0 U 1<=p1]] | [1<=p0 & EX [p1<=0]]]] & E [p1<=0 U E [[1<=p1 | AX [A [1<=p1 U 1<=p1]]] U ~ [[AX [1<=p0] & 1<=p1]]]]]
normalized: [E [p1<=0 U E [[~ [EX [~ [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]]]]]] | 1<=p1] U ~ [[~ [EX [~ [1<=p0]]] & 1<=p1]]]] & E [true U [[EX [p1<=0] & 1<=p0] | ~ [E [1<=p0 U 1<=p1]]]]]

abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
abstracting: (p1<=0)
states: 2
.abstracting: (1<=p1)
states: 20
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
abstracting: (1<=p1)
states: 20
..
EG iterations: 2
.abstracting: (p1<=0)
states: 2
-> the formula is TRUE

FORMULA Referendum-COL-0020-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 249 (2.5e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 332 485 817
used/not used/entry size/cache size: 461 67108403 16 1024MB
basic ops cache: hits/miss/sum: 858 325 1183
used/not used/entry size/cache size: 660 16776556 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: 71 8 79
used/not used/entry size/cache size: 8 8388600 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 67108802
1 30
2 25
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 7

Total processing time: 0m 4.359sec


BK_STOP 1679159972943

--------------------
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:43 (21), effective:21 (10)

initing FirstDep: 0m 0.000sec


iterations count:41 (20), effective:20 (10)

iterations count:43 (21), effective:21 (10)

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

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

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

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

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

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

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

iterations count:42 (21), effective:20 (10)

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

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

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

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

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

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

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

iterations count:43 (21), effective:21 (10)

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

iterations count:42 (21), effective:20 (10)

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

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

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

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

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

iterations count:42 (21), effective:20 (10)

iterations count:43 (21), effective:21 (10)

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

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

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

iterations count:42 (21), effective:20 (10)

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

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

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

iterations count:43 (21), effective:21 (10)

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

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

iterations count:2 (1), effective:0 (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="Referendum-COL-0020"
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 Referendum-COL-0020, 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 r330-tall-167889203200418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0020.tgz
mv Referendum-COL-0020 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 ;