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.r170-tall-167838856800138.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 Eratosthenes-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.5K 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 Eratosthenes-PT-010-CTLFireability-00
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-01
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-02
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-03
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-04
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-05
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-06
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-07
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-08
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-09
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-10
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-11
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-12
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-13
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-14
FORMULA_NAME Eratosthenes-PT-010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493289059

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=Eratosthenes-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:08:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:08:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:08:10] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-11 00:08:10] [INFO ] Transformed 9 places.
[2023-03-11 00:08:10] [INFO ] Transformed 8 transitions.
[2023-03-11 00:08:10] [INFO ] Parsed PT model containing 9 places and 8 transitions and 24 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA Eratosthenes-PT-010-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 6/6 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 5
Applied a total of 1 rules in 9 ms. Remains 5 /5 variables (removed 0) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:08:10] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-11 00:08:10] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 00:08:10] [INFO ] Invariant cache hit.
[2023-03-11 00:08:11] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-11 00:08:11] [INFO ] Invariant cache hit.
[2023-03-11 00:08:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/5 places, 5/6 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 5/5 places, 5/6 transitions.
Support contains 5 out of 5 places after structural reductions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 12 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Incomplete random walk after 10000 steps, including 1666 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:08:11] [INFO ] Invariant cache hit.
[2023-03-11 00:08:11] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 2 formulas.
FORMULA Eratosthenes-PT-010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/5 places, 4/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/5 places, 4/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 2 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 3/5 places, 3/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 5/5 places, 5/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Graph (complete) has 0 edges and 5 vertex of which 1 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /5 variables (removed 4) and now considering 1/5 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 1/5 places, 1/5 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:08:11] [INFO ] Input system was already deterministic with 1 transitions.
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:08:11] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:08:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5 places, 5 transitions and 5 arcs took 0 ms.
Total runtime 1003 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: 5 NrTr: 5 NrArc: 5)

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

net check time: 0m 0.000sec

init dd package: 0m 2.702sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 5 (5.0e+00) #states 32



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

checking: EG [1<=p0]
normalized: EG [1<=p0]

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

FORMULA Eratosthenes-PT-010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p3)
states: 16
abstracting: (p0<=0)
states: 16
abstracting: (p4<=0)
states: 16
..
EG iterations: 1
....
EG iterations: 4
abstracting: (1<=p3)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p1)
states: 16
..
EG iterations: 1
abstracting: (1<=p1)
states: 16
.abstracting: (1<=p1)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p2)
states: 16
.abstracting: (1<=p2)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p1)
states: 16
.-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EG [A [E [p2<=0 U 1<=p2] U [p1<=0 & [1<=p3 & [1<=p2 | [1<=p4 | 1<=p0]]]]]]]
normalized: EX [EG [[~ [EG [~ [[[[[1<=p4 | 1<=p0] | 1<=p2] & 1<=p3] & p1<=0]]]] & ~ [E [~ [[[[[1<=p4 | 1<=p0] | 1<=p2] & 1<=p3] & p1<=0]] U [~ [E [p2<=0 U 1<=p2]] & ~ [[[[[1<=p4 | 1<=p0] | 1<=p2] & 1<=p3] & p1<=0]]]]]]]]

abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p2<=0)
states: 16
abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
.
EG iterations: 1
....
EG iterations: 4
.-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p4<=0)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 16
.
EG iterations: 1
.....
EG iterations: 5
.-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p4<=0)
states: 16
abstracting: (p3<=0)
states: 16
abstracting: (p0<=0)
states: 16
abstracting: (p3<=0)
states: 16
.abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p3)
states: 16
......
EG iterations: 6
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16
.
EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [A [[[[p4<=0 | AX [[1<=p1 & 1<=p2]]] & [[1<=p4 | 1<=p1] & 1<=p4]] | 1<=p4] U AX [~ [[[1<=p3 | [1<=p4 | 1<=p4]] & p1<=0]]]]]
normalized: ~ [[~ [EG [EX [[[[1<=p4 | 1<=p4] | 1<=p3] & p1<=0]]]] & ~ [E [EX [[[[1<=p4 | 1<=p4] | 1<=p3] & p1<=0]] U [~ [[[[[1<=p4 | 1<=p1] & 1<=p4] & [~ [EX [~ [[1<=p1 & 1<=p2]]]] | p4<=0]] | 1<=p4]] & EX [[[[1<=p4 | 1<=p4] | 1<=p3] & p1<=0]]]]]]]

abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p4)
states: 16
.abstracting: (1<=p4)
states: 16
abstracting: (p4<=0)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
.abstracting: (1<=p4)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p4)
states: 16
.abstracting: (p1<=0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p4)
states: 16
......
EG iterations: 5
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p4)
states: 16
.
EG iterations: 1
......
EG iterations: 6
.abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p1)
states: 16
.
EG iterations: 1
abstracting: (p4<=0)
states: 16
.abstracting: (1<=p0)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p4<=0)
states: 16
abstracting: (1<=p0)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p2)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p4<=0)
states: 16
abstracting: (1<=p0)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p2)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p4<=0)
states: 16
abstracting: (1<=p0)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p2)
states: 16
.
EG iterations: 1
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 16
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p2)
states: 16
abstracting: (1<=p3)
states: 16
.abstracting: (1<=p2)
states: 16
abstracting: (1<=p2)
states: 16

EG iterations: 0
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p4)
states: 16
.abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p1)
states: 16
......
EG iterations: 5
abstracting: (1<=p4)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p0<=0)
states: 16
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p0)
states: 16
......
EG iterations: 6
abstracting: (1<=p4)
states: 16
abstracting: (1<=p0)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p4)
states: 16
.
EG iterations: 1
abstracting: (1<=p2)
states: 16
abstracting: (1<=p1)
states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 996 (1.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 668 782 1450
used/not used/entry size/cache size: 1477 67107387 16 1024MB
basic ops cache: hits/miss/sum: 991 1068 2059
used/not used/entry size/cache size: 1935 16775281 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: 155 35 190
used/not used/entry size/cache size: 35 8388573 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 67107949
1 849
2 51
3 15
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.260sec


BK_STOP 1678493296643

--------------------
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:10 (2), effective:5 (1)

initing FirstDep: 0m 0.000sec


iterations count:10 (2), effective:5 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:5 (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="Eratosthenes-PT-010"
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 Eratosthenes-PT-010, 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 r170-tall-167838856800138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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