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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 17K 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 DoubleExponent-PT-001-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678839780106

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=DoubleExponent-PT-001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:23:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 00:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:23:03] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-15 00:23:03] [INFO ] Transformed 57 places.
[2023-03-15 00:23:03] [INFO ] Transformed 48 transitions.
[2023-03-15 00:23:03] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-001-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 25 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-15 00:23:04] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-15 00:23:04] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-15 00:23:04] [INFO ] Invariant cache hit.
[2023-03-15 00:23:04] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-15 00:23:04] [INFO ] Invariant cache hit.
[2023-03-15 00:23:04] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 53/57 places, 48/48 transitions.
Support contains 46 out of 53 places after structural reductions.
[2023-03-15 00:23:05] [INFO ] Flatten gal took : 48 ms
[2023-03-15 00:23:05] [INFO ] Flatten gal took : 18 ms
[2023-03-15 00:23:05] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 344 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 42) seen :35
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 370 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 301 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-15 00:23:07] [INFO ] Invariant cache hit.
[2023-03-15 00:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 00:23:07] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-15 00:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 00:23:07] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-15 00:23:07] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 00:23:07] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 53 transition count 37
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 42 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 42 transition count 35
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 40 transition count 35
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 52 place count 27 transition count 22
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 27 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 25 transition count 20
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 25 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 24 transition count 19
Applied a total of 59 rules in 22 ms. Remains 24 /53 variables (removed 29) and now considering 19/48 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 24/53 places, 19/48 transitions.
Finished random walk after 5438 steps, including 676 resets, run visited all 1 properties in 20 ms. (steps per millisecond=271 )
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA DoubleExponent-PT-001-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:23:07] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:23:07] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 37 out of 53 places (down from 38) after GAL structural reductions.
FORMULA DoubleExponent-PT-001-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 82 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 45 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 45 transition count 37
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 42 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 34 transition count 29
Applied a total of 35 rules in 18 ms. Remains 34 /53 variables (removed 19) and now considering 29/48 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 34/53 places, 29/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 39 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 33 transition count 28
Applied a total of 38 rules in 12 ms. Remains 33 /53 variables (removed 20) and now considering 28/48 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 33/53 places, 28/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 15 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 43 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 43 transition count 36
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 35 transition count 30
Applied a total of 33 rules in 16 ms. Remains 35 /53 variables (removed 18) and now considering 30/48 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 35/53 places, 30/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 43 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 43 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 33 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 33 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 32 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 32 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 31 transition count 26
Applied a total of 43 rules in 20 ms. Remains 31 /53 variables (removed 22) and now considering 26/48 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 31/53 places, 26/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 43 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 43 transition count 34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 39 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 32 transition count 27
Applied a total of 39 rules in 15 ms. Remains 32 /53 variables (removed 21) and now considering 27/48 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 32/53 places, 27/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/53 places, 48/48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:23:08] [INFO ] Input system was already deterministic with 48 transitions.
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:23:08] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-15 00:23:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 48 transitions and 131 arcs took 1 ms.
Total runtime 4888 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: 53 NrTr: 48 NrArc: 131)

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

net check time: 0m 0.000sec

init dd package: 0m 3.640sec


RS generation: 0m 0.012sec


-> reachability set: #nodes 733 (7.3e+02) #states 149



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

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

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

FORMULA DoubleExponent-PT-001-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

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

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

FORMULA DoubleExponent-PT-001-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EX [1<=p15]
normalized: EX [1<=p15]

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

FORMULA DoubleExponent-PT-001-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [~ [AF [1<=p38]] U 1<=p13]
normalized: [~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [EG [~ [1<=p38]]] & ~ [1<=p13]]]]]

abstracting: (1<=p13)
states: 4
abstracting: (1<=p38)
states: 3
...
EG iterations: 3
abstracting: (1<=p13)
states: 4
abstracting: (1<=p13)
states: 4
...............
EG iterations: 15
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: A [AF [[~ [AF [1<=p21]] & 1<=p24]] U 1<=p25]
normalized: [~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [EG [~ [[EG [~ [1<=p21]] & 1<=p24]]] & ~ [1<=p25]]]]]

abstracting: (1<=p25)
states: 6
abstracting: (1<=p24)
states: 6
abstracting: (1<=p21)
states: 1
...
EG iterations: 3
..
EG iterations: 2
abstracting: (1<=p25)
states: 6
abstracting: (1<=p25)
states: 6
...
EG iterations: 3
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [EG [[p6<=0 & E [[1<=p4 & 1<=p26] U 1<=p45]]]]
normalized: ~ [EG [~ [EG [[E [[1<=p4 & 1<=p26] U 1<=p45] & p6<=0]]]]]

abstracting: (p6<=0)
states: 147
abstracting: (1<=p45)
states: 9
abstracting: (1<=p26)
states: 6
abstracting: (1<=p4)
states: 134
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[p37<=0 & AG [EF [~ [E [[1<=p36 & 1<=p52] U 1<=p34]]]]]]
normalized: EG [[~ [E [true U ~ [E [true U ~ [E [[1<=p36 & 1<=p52] U 1<=p34]]]]]] & p37<=0]]

abstracting: (p37<=0)
states: 146
abstracting: (1<=p34)
states: 1
abstracting: (1<=p52)
states: 120
abstracting: (1<=p36)
states: 5
..
EG iterations: 2
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [[AF [[AG [[1<=p20 | 1<=p17]] & EF [p37<=0]]] | [1<=p33 & 1<=p51]]]
normalized: ~ [EX [~ [[[1<=p33 & 1<=p51] | ~ [EG [~ [[E [true U p37<=0] & ~ [E [true U ~ [[1<=p20 | 1<=p17]]]]]]]]]]]]

abstracting: (1<=p17)
states: 4
abstracting: (1<=p20)
states: 2
abstracting: (p37<=0)
states: 146

EG iterations: 0
abstracting: (1<=p51)
states: 91
abstracting: (1<=p33)
states: 2
.-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [[[1<=p22 & 1<=p14] | [AF [EG [A [1<=p47 U 1<=p34]]] & [p16<=0 | p42<=0]]]]
normalized: EG [[[[p16<=0 | p42<=0] & ~ [EG [~ [EG [[~ [EG [~ [1<=p34]]] & ~ [E [~ [1<=p34] U [~ [1<=p47] & ~ [1<=p34]]]]]]]]]] | [1<=p22 & 1<=p14]]]

abstracting: (1<=p14)
states: 74
abstracting: (1<=p22)
states: 2
abstracting: (1<=p34)
states: 1
abstracting: (1<=p47)
states: 3
abstracting: (1<=p34)
states: 1
abstracting: (1<=p34)
states: 1
..
EG iterations: 2
..
EG iterations: 2

EG iterations: 0
abstracting: (p42<=0)
states: 148
abstracting: (p16<=0)
states: 112
..
EG iterations: 2
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [[EF [1<=p15] | EG [[[AG [1<=p43] & [AF [[1<=p3 & 1<=p44]] & AF [1<=p40]]] | [AF [p31<=0] | EX [p45<=0]]]]]]
normalized: EG [[EG [[[EX [p45<=0] | ~ [EG [~ [p31<=0]]]] | [[~ [EG [~ [1<=p40]]] & ~ [EG [~ [[1<=p3 & 1<=p44]]]]] & ~ [E [true U ~ [1<=p43]]]]]] | E [true U 1<=p15]]]

abstracting: (1<=p15)
states: 2
abstracting: (1<=p43)
states: 1
abstracting: (1<=p44)
states: 9
abstracting: (1<=p3)
states: 48
.
EG iterations: 1
abstracting: (1<=p40)
states: 3
.....
EG iterations: 5
abstracting: (p31<=0)
states: 147
..
EG iterations: 2
abstracting: (p45<=0)
states: 140
.
EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [A [AG [[[A [1<=p6 U 1<=p31] & [p32<=0 | EX [[1<=p1 & 1<=p7]]]] | AX [E [1<=p50 U 1<=p15]]]] U 1<=p8]]
normalized: ~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [E [true U ~ [[~ [EX [~ [E [1<=p50 U 1<=p15]]]] | [[p32<=0 | EX [[1<=p1 & 1<=p7]]] & [~ [EG [~ [1<=p31]]] & ~ [E [~ [1<=p31] U [~ [1<=p6] & ~ [1<=p31]]]]]]]]] & ~ [1<=p8]]]]]]

abstracting: (1<=p8)
states: 4
abstracting: (1<=p31)
states: 2
abstracting: (1<=p6)
states: 2
abstracting: (1<=p31)
states: 2
abstracting: (1<=p31)
states: 2
.........
EG iterations: 9
abstracting: (1<=p7)
states: 4
abstracting: (1<=p1)
states: 125
.abstracting: (p32<=0)
states: 148
abstracting: (1<=p15)
states: 2
abstracting: (1<=p50)
states: 1
.abstracting: (1<=p8)
states: 4
abstracting: (1<=p8)
states: 4
...........
EG iterations: 11
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AX [[[[EF [AG [1<=p6]] & EX [[1<=p14 & 1<=p22]]] & [A [[1<=p17 | 1<=p20] U [1<=p34 | 1<=p25]] & [E [AX [[1<=p5 & 1<=p51]] U [1<=p27 | 1<=p43]] | [1<=p14 & 1<=p29]]]] | [EG [1<=p43] & [p34<=0 | AX [p21<=0]]]]]
normalized: ~ [EX [~ [[[[p34<=0 | ~ [EX [~ [p21<=0]]]] & EG [1<=p43]] | [[[[1<=p14 & 1<=p29] | E [~ [EX [~ [[1<=p5 & 1<=p51]]]] U [1<=p27 | 1<=p43]]] & [~ [EG [~ [[1<=p34 | 1<=p25]]]] & ~ [E [~ [[1<=p34 | 1<=p25]] U [~ [[1<=p17 | 1<=p20]] & ~ [[1<=p34 | 1<=p25]]]]]]] & [EX [[1<=p14 & 1<=p22]] & E [true U ~ [E [true U ~ [1<=p6]]]]]]]]]]

abstracting: (1<=p6)
states: 2
abstracting: (1<=p22)
states: 2
abstracting: (1<=p14)
states: 74
.abstracting: (1<=p25)
states: 6
abstracting: (1<=p34)
states: 1
abstracting: (1<=p20)
states: 2
abstracting: (1<=p17)
states: 4
abstracting: (1<=p25)
states: 6
abstracting: (1<=p34)
states: 1
abstracting: (1<=p25)
states: 6
abstracting: (1<=p34)
states: 1
...
EG iterations: 3
abstracting: (1<=p43)
states: 1
abstracting: (1<=p27)
states: 6
abstracting: (1<=p51)
states: 91
abstracting: (1<=p5)
states: 2
.abstracting: (1<=p29)
states: 2
abstracting: (1<=p14)
states: 74
abstracting: (1<=p43)
states: 1
..
EG iterations: 2
abstracting: (p21<=0)
states: 148
.abstracting: (p34<=0)
states: 148
.-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 38539 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 80599 188461 269060
used/not used/entry size/cache size: 230241 66878623 16 1024MB
basic ops cache: hits/miss/sum: 7034 34675 41709
used/not used/entry size/cache size: 56010 16721206 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: 505 2289 2794
used/not used/entry size/cache size: 2289 8386319 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 67072605
1 35206
2 959
3 43
4 9
5 4
6 7
7 0
8 2
9 5
>= 10 24

Total processing time: 0m 5.400sec


BK_STOP 1678839795202

--------------------
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:1080 (22), effective:112 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:715 (14), effective:72 (1)

iterations count:288 (6), effective:23 (0)

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

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

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

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

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

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

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

iterations count:444 (9), effective:49 (1)

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

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

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

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

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

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

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

iterations count:48 (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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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-167819420700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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