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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K 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.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 6 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 FMS-PT-00010-CTLFireability-00
FORMULA_NAME FMS-PT-00010-CTLFireability-01
FORMULA_NAME FMS-PT-00010-CTLFireability-02
FORMULA_NAME FMS-PT-00010-CTLFireability-03
FORMULA_NAME FMS-PT-00010-CTLFireability-04
FORMULA_NAME FMS-PT-00010-CTLFireability-05
FORMULA_NAME FMS-PT-00010-CTLFireability-06
FORMULA_NAME FMS-PT-00010-CTLFireability-07
FORMULA_NAME FMS-PT-00010-CTLFireability-08
FORMULA_NAME FMS-PT-00010-CTLFireability-09
FORMULA_NAME FMS-PT-00010-CTLFireability-10
FORMULA_NAME FMS-PT-00010-CTLFireability-11
FORMULA_NAME FMS-PT-00010-CTLFireability-12
FORMULA_NAME FMS-PT-00010-CTLFireability-13
FORMULA_NAME FMS-PT-00010-CTLFireability-14
FORMULA_NAME FMS-PT-00010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493952223

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=FMS-PT-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:19:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:19:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:19:14] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-11 00:19:14] [INFO ] Transformed 22 places.
[2023-03-11 00:19:14] [INFO ] Transformed 20 transitions.
[2023-03-11 00:19:14] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00010-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:19:14] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-11 00:19:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 00:19:14] [INFO ] Invariant cache hit.
[2023-03-11 00:19:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-11 00:19:14] [INFO ] Invariant cache hit.
[2023-03-11 00:19:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 187 steps, including 0 resets, run visited all 32 properties in 24 ms. (steps per millisecond=7 )
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 10 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 13 transition count 15
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 20 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 7 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 5/22 places, 6/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 9 edges and 18 vertex of which 6 / 18 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 15 place count 12 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 12 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 7 transition count 7
Applied a total of 25 rules in 5 ms. Remains 7 /22 variables (removed 15) and now considering 7/20 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 7/22 places, 7/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 21 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 18 transition count 17
Applied a total of 7 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 17/20 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 18/22 places, 17/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 17 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 18 place count 12 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 10 transition count 11
Applied a total of 21 rules in 2 ms. Remains 10 /22 variables (removed 12) and now considering 11/20 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/22 places, 11/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 8 place count 19 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 11 place count 16 transition count 15
Applied a total of 11 rules in 1 ms. Remains 16 /22 variables (removed 6) and now considering 15/20 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/22 places, 15/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 9 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 7 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 6 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Application raised an uncaught exception Index 10 out of bounds for length 4
java.lang.IndexOutOfBoundsException: Index 10 out of bounds for length 4
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:266)
at java.base/java.util.Objects.checkIndex(Objects.java:359)
at java.base/java.util.ArrayList.get(ArrayList.java:427)
at fr.lip6.move.gal.structural.StructuralReduction.ensureUnique(StructuralReduction.java:916)
at fr.lip6.move.gal.structural.StructuralReduction.ruleReducePlaces(StructuralReduction.java:1056)
at fr.lip6.move.gal.structural.StructuralReduction.reduce(StructuralReduction.java:240)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:452)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:649)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 963 ms.
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: FMS_PT_00010
(NrP: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.766sec


RS generation: 0m 0.085sec


-> reachability set: #nodes 4565 (4.6e+03) #states 2,501,413,200 (9)



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

checking: AX [~ [AG [~ [IS_FIREABLE [tM3]]]]]
normalized: ~ [EX [~ [E [true U IS_FIREABLE [tM3]]]]]

.-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: ~ [EF [~ [EF [IS_FIREABLE [tP12M3]]]]]
normalized: ~ [E [true U ~ [E [true U IS_FIREABLE [tP12M3]]]]]

-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [EG [[[IS_FIREABLE [tx] | AF [~ [IS_FIREABLE [tP1j]]]] | IS_FIREABLE [tP1e]]]]
normalized: ~ [E [true U ~ [EG [[IS_FIREABLE [tP1e] | [IS_FIREABLE [tx] | ~ [EG [IS_FIREABLE [tP1j]]]]]]]]]

.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: A [IS_FIREABLE [tP1s] U AG [~ [AX [[IS_FIREABLE [tP2M2] & EG [IS_FIREABLE [tP2M2]]]]]]]
normalized: [~ [EG [E [true U ~ [EX [~ [[IS_FIREABLE [tP2M2] & EG [IS_FIREABLE [tP2M2]]]]]]]]] & ~ [E [E [true U ~ [EX [~ [[IS_FIREABLE [tP2M2] & EG [IS_FIREABLE [tP2M2]]]]]]] U [~ [IS_FIREABLE [tP1s]] & E [true U ~ [EX [~ [[IS_FIREABLE [tP2M2] & EG [IS_FIREABLE [tP2M2]]]]]]]]]]]

........................................
EG iterations: 40
.........................................
EG iterations: 40
.........................................
EG iterations: 40
..
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: EF [AG [[IS_FIREABLE [tP1e] & ~ [E [AG [IS_FIREABLE [tP12s]] U AF [IS_FIREABLE [tP1M1]]]]]]]
normalized: E [true U ~ [E [true U ~ [[IS_FIREABLE [tP1e] & ~ [E [~ [E [true U ~ [IS_FIREABLE [tP12s]]]] U ~ [EG [~ [IS_FIREABLE [tP1M1]]]]]]]]]]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.123sec

checking: [EX [AX [AF [E [IS_FIREABLE [tP2] U IS_FIREABLE [tP12s]]]]] & AF [IS_FIREABLE [tP2M2]]]
normalized: [~ [EG [~ [IS_FIREABLE [tP2M2]]]] & EX [~ [EX [EG [~ [E [IS_FIREABLE [tP2] U IS_FIREABLE [tP12s]]]]]]]]

.
EG iterations: 1
...
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AG [[AX [IS_FIREABLE [tM2]] | EX [[[~ [AX [IS_FIREABLE [tP3s]]] & AG [IS_FIREABLE [tP3M2]]] & IS_FIREABLE [tP2e]]]]]
normalized: ~ [E [true U ~ [[EX [[IS_FIREABLE [tP2e] & [~ [E [true U ~ [IS_FIREABLE [tP3M2]]]] & EX [~ [IS_FIREABLE [tP3s]]]]]] | ~ [EX [~ [IS_FIREABLE [tM2]]]]]]]]

...-> the formula is FALSE

FORMULA FMS-PT-00010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

checking: E [EF [IS_FIREABLE [tM2]] U [EX [AX [A [IS_FIREABLE [tP12s] U IS_FIREABLE [tP3M2]]]] & AX [[~ [EF [IS_FIREABLE [tM3]]] | ~ [EG [IS_FIREABLE [tP3]]]]]]]
normalized: E [E [true U IS_FIREABLE [tM2]] U [~ [EX [~ [[~ [EG [IS_FIREABLE [tP3]]] | ~ [E [true U IS_FIREABLE [tM3]]]]]]] & EX [~ [EX [~ [[~ [EG [~ [IS_FIREABLE [tP3M2]]]] & ~ [E [~ [IS_FIREABLE [tP3M2]] U [~ [IS_FIREABLE [tP12s]] & ~ [IS_FIREABLE [tP3M2]]]]]]]]]]]]

......................................
EG iterations: 38
...
EG iterations: 1
.-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.211sec

checking: ~ [E [EG [[[[IS_FIREABLE [tP1s] | IS_FIREABLE [tP2e]] & EG [IS_FIREABLE [tP2s]]] & IS_FIREABLE [tP1j]]] U EF [AG [~ [IS_FIREABLE [tP2e]]]]]]
normalized: ~ [E [EG [[IS_FIREABLE [tP1j] & [EG [IS_FIREABLE [tP2s]] & [IS_FIREABLE [tP1s] | IS_FIREABLE [tP2e]]]]] U E [true U ~ [E [true U IS_FIREABLE [tP2e]]]]]]

.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: A [IS_FIREABLE [tP1M1] U [EF [[EX [IS_FIREABLE [tP3]] & EG [[IS_FIREABLE [tP1j] | IS_FIREABLE [tP12s]]]]] & ~ [AG [EX [IS_FIREABLE [tP3]]]]]]
normalized: [~ [EG [~ [[E [true U ~ [EX [IS_FIREABLE [tP3]]]] & E [true U [EG [[IS_FIREABLE [tP1j] | IS_FIREABLE [tP12s]]] & EX [IS_FIREABLE [tP3]]]]]]]] & ~ [E [~ [[E [true U ~ [EX [IS_FIREABLE [tP3]]]] & E [true U [EG [[IS_FIREABLE [tP1j] | IS_FIREABLE [tP12s]]] & EX [IS_FIREABLE [tP3]]]]]] U [~ [IS_FIREABLE [tP1M1]] & ~ [[E [true U ~ [EX [IS_FIREABLE [tP3]]]] & E [true U [EG [[IS_FIREABLE [tP1j] | IS_FIREABLE [tP12s]]] & EX [IS_FIREABLE [tP3]]]]]]]]]]

..
EG iterations: 1
...
EG iterations: 1
...
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: A [A [IS_FIREABLE [tP2e] U ~ [EF [[[IS_FIREABLE [tP12s] & IS_FIREABLE [tP2M2]] | A [IS_FIREABLE [tP1e] U IS_FIREABLE [tP12M3]]]]]] U AX [~ [EX [[[IS_FIREABLE [tP3] | IS_FIREABLE [tP1M1]] & E [IS_FIREABLE [tx] U IS_FIREABLE [tP12s]]]]]]]
normalized: [~ [EG [EX [EX [[E [IS_FIREABLE [tx] U IS_FIREABLE [tP12s]] & [IS_FIREABLE [tP3] | IS_FIREABLE [tP1M1]]]]]]] & ~ [E [EX [EX [[E [IS_FIREABLE [tx] U IS_FIREABLE [tP12s]] & [IS_FIREABLE [tP3] | IS_FIREABLE [tP1M1]]]]] U [~ [[~ [EG [E [true U [[~ [EG [~ [IS_FIREABLE [tP12M3]]]] & ~ [E [~ [IS_FIREABLE [tP12M3]] U [~ [IS_FIREABLE [tP1e]] & ~ [IS_FIREABLE [tP12M3]]]]]] | [IS_FIREABLE [tP12s] & IS_FIREABLE [tP2M2]]]]]] & ~ [E [E [true U [[~ [EG [~ [IS_FIREABLE [tP12M3]]]] & ~ [E [~ [IS_FIREABLE [tP12M3]] U [~ [IS_FIREABLE [tP1e]] & ~ [IS_FIREABLE [tP12M3]]]]]] | [IS_FIREABLE [tP12s] & IS_FIREABLE [tP2M2]]]] U [~ [IS_FIREABLE [tP2e]] & E [true U [[~ [EG [~ [IS_FIREABLE [tP12M3]]]] & ~ [E [~ [IS_FIREABLE [tP12M3]] U [~ [IS_FIREABLE [tP1e]] & ~ [IS_FIREABLE [tP12M3]]]]]] | [IS_FIREABLE [tP12s] & IS_FIREABLE [tP2M2]]]]]]]]] & EX [EX [[E [IS_FIREABLE [tx] U IS_FIREABLE [tP12s]] & [IS_FIREABLE [tP3] | IS_FIREABLE [tP1M1]]]]]]]]]

...
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
.....
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.518sec

checking: EG [[AG [[AX [IS_FIREABLE [tP2]] | AF [[IS_FIREABLE [tP12s] & IS_FIREABLE [tP3s]]]]] | [[IS_FIREABLE [tM3] & [E [[IS_FIREABLE [tP2j] & IS_FIREABLE [tP1M1]] U ~ [IS_FIREABLE [tP12]]] & AF [[IS_FIREABLE [tP3] & IS_FIREABLE [tP3M2]]]]] | IS_FIREABLE [tP1s]]]]
normalized: EG [[[IS_FIREABLE [tP1s] | [IS_FIREABLE [tM3] & [~ [EG [~ [[IS_FIREABLE [tP3] & IS_FIREABLE [tP3M2]]]]] & E [[IS_FIREABLE [tP2j] & IS_FIREABLE [tP1M1]] U ~ [IS_FIREABLE [tP12]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[IS_FIREABLE [tP12s] & IS_FIREABLE [tP3s]]]]] | ~ [EX [~ [IS_FIREABLE [tP2]]]]]]]]]]

..
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.299sec

checking: E [~ [EG [IS_FIREABLE [tP2j]]] U ~ [[~ [EF [~ [[IS_FIREABLE [tP3M2] & IS_FIREABLE [tx]]]]] | A [[[~ [IS_FIREABLE [tM1]] & IS_FIREABLE [tP1e]] & [EG [IS_FIREABLE [tP3s]] & [IS_FIREABLE [tM1] | IS_FIREABLE [tM2]]]] U AF [E [IS_FIREABLE [tP3] U IS_FIREABLE [tP12]]]]]]]
normalized: E [~ [EG [IS_FIREABLE [tP2j]]] U ~ [[[~ [EG [EG [~ [E [IS_FIREABLE [tP3] U IS_FIREABLE [tP12]]]]]] & ~ [E [EG [~ [E [IS_FIREABLE [tP3] U IS_FIREABLE [tP12]]]] U [~ [[[[IS_FIREABLE [tM1] | IS_FIREABLE [tM2]] & EG [IS_FIREABLE [tP3s]]] & [IS_FIREABLE [tP1e] & ~ [IS_FIREABLE [tM1]]]]] & EG [~ [E [IS_FIREABLE [tP3] U IS_FIREABLE [tP12]]]]]]]] | ~ [E [true U ~ [[IS_FIREABLE [tP3M2] & IS_FIREABLE [tx]]]]]]]]

............
EG iterations: 12
.
EG iterations: 1
............
EG iterations: 12
............
EG iterations: 12
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.136sec

checking: EF [AX [[[[[EG [IS_FIREABLE [tP1M1]] | IS_FIREABLE [tP1e]] | IS_FIREABLE [tP2j]] & ~ [[[IS_FIREABLE [tP2] | IS_FIREABLE [tP2s]] | [IS_FIREABLE [tP2s] & IS_FIREABLE [tP1e]]]]] | [[AG [IS_FIREABLE [tP12M3]] | [~ [IS_FIREABLE [tP2]] & AG [IS_FIREABLE [tP12]]]] | AX [AG [IS_FIREABLE [tP2M2]]]]]]]
normalized: E [true U ~ [EX [~ [[[~ [EX [E [true U ~ [IS_FIREABLE [tP2M2]]]]] | [[~ [E [true U ~ [IS_FIREABLE [tP12]]]] & ~ [IS_FIREABLE [tP2]]] | ~ [E [true U ~ [IS_FIREABLE [tP12M3]]]]]] | [~ [[[IS_FIREABLE [tP2s] & IS_FIREABLE [tP1e]] | [IS_FIREABLE [tP2] | IS_FIREABLE [tP2s]]]] & [IS_FIREABLE [tP2j] | [IS_FIREABLE [tP1e] | EG [IS_FIREABLE [tP1M1]]]]]]]]]]

.
EG iterations: 1
..-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.226sec

checking: [E [[E [~ [EF [IS_FIREABLE [tP1]]] U [A [IS_FIREABLE [tP2] U IS_FIREABLE [tP12s]] | [IS_FIREABLE [tM2] & EG [IS_FIREABLE [tP2e]]]]] | IS_FIREABLE [tP1j]] U ~ [[[E [[IS_FIREABLE [tP1] | IS_FIREABLE [tP3]] U ~ [IS_FIREABLE [tP1M1]]] | ~ [IS_FIREABLE [tP1e]]] & EF [~ [IS_FIREABLE [tP2]]]]]] & EF [IS_FIREABLE [tP1j]]]
normalized: [E [true U IS_FIREABLE [tP1j]] & E [[IS_FIREABLE [tP1j] | E [~ [E [true U IS_FIREABLE [tP1]]] U [[IS_FIREABLE [tM2] & EG [IS_FIREABLE [tP2e]]] | [~ [EG [~ [IS_FIREABLE [tP12s]]]] & ~ [E [~ [IS_FIREABLE [tP12s]] U [~ [IS_FIREABLE [tP2]] & ~ [IS_FIREABLE [tP12s]]]]]]]]] U ~ [[E [true U ~ [IS_FIREABLE [tP2]]] & [~ [IS_FIREABLE [tP1e]] | E [[IS_FIREABLE [tP1] | IS_FIREABLE [tP3]] U ~ [IS_FIREABLE [tP1M1]]]]]]]]

.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.382sec

checking: ~ [[AG [[~ [[IS_FIREABLE [tP2] | E [IS_FIREABLE [tP12] U IS_FIREABLE [tP2s]]]] & [AF [[IS_FIREABLE [tP1] & IS_FIREABLE [tP2e]]] | [[~ [IS_FIREABLE [tP2e]] & IS_FIREABLE [tP2]] | EX [IS_FIREABLE [tM3]]]]]] & AF [A [~ [[A [IS_FIREABLE [tP1M1] U IS_FIREABLE [tP2]] & [IS_FIREABLE [tP1e] | IS_FIREABLE [tP1j]]]] U E [EG [IS_FIREABLE [tP1M1]] U [IS_FIREABLE [tP2s] & IS_FIREABLE [tP12]]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [E [EG [IS_FIREABLE [tP1M1]] U [IS_FIREABLE [tP2s] & IS_FIREABLE [tP12]]]]]] & ~ [E [~ [E [EG [IS_FIREABLE [tP1M1]] U [IS_FIREABLE [tP2s] & IS_FIREABLE [tP12]]]] U [[[IS_FIREABLE [tP1e] | IS_FIREABLE [tP1j]] & [~ [EG [~ [IS_FIREABLE [tP2]]]] & ~ [E [~ [IS_FIREABLE [tP2]] U [~ [IS_FIREABLE [tP1M1]] & ~ [IS_FIREABLE [tP2]]]]]]] & ~ [E [EG [IS_FIREABLE [tP1M1]] U [IS_FIREABLE [tP2s] & IS_FIREABLE [tP12]]]]]]]]]]] & ~ [E [true U ~ [[[[EX [IS_FIREABLE [tM3]] | [IS_FIREABLE [tP2] & ~ [IS_FIREABLE [tP2e]]]] | ~ [EG [~ [[IS_FIREABLE [tP1] & IS_FIREABLE [tP2e]]]]]] & ~ [[IS_FIREABLE [tP2] | E [IS_FIREABLE [tP12] U IS_FIREABLE [tP2s]]]]]]]]]]

.
EG iterations: 1
..
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.435sec

totally nodes used: 1515415 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11703688 4915623 16619311
used/not used/entry size/cache size: 5920337 61188527 16 1024MB
basic ops cache: hits/miss/sum: 3716846 1498863 5215709
used/not used/entry size/cache size: 2309659 14467557 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: 11923 4565 16488
used/not used/entry size/cache size: 4565 8384043 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 65667525
1 1394649
2 38449
3 3770
4 1950
5 781
6 571
7 223
8 134
9 123
>= 10 689

Total processing time: 0m 7.535sec


BK_STOP 1678493963235

--------------------
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:790 (39), effective:170 (8)

initing FirstDep: 0m 0.000sec


iterations count:92 (4), effective:14 (0)

iterations count:84 (4), effective:14 (0)

iterations count:50 (2), effective:10 (0)

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

iterations count:30 (1), effective:10 (0)

iterations count:91 (4), effective:14 (0)

iterations count:64 (3), effective:15 (0)

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

iterations count:50 (2), effective:10 (0)

iterations count:92 (4), effective:14 (0)

iterations count:81 (4), effective:14 (0)

iterations count:241 (12), effective:81 (4)

iterations count:82 (4), effective:14 (0)

iterations count:79 (3), effective:15 (0)

iterations count:70 (3), effective:20 (1)

iterations count:79 (3), effective:15 (0)

iterations count:70 (3), effective:20 (1)

iterations count:79 (3), effective:15 (0)

iterations count:70 (3), effective:20 (1)

iterations count:91 (4), effective:14 (0)

iterations count:30 (1), effective:10 (0)

iterations count:95 (4), effective:18 (0)

iterations count:30 (1), effective:10 (0)

iterations count:95 (4), effective:18 (0)

iterations count:40 (2), effective:10 (0)

iterations count:30 (1), effective:10 (0)

iterations count:95 (4), effective:18 (0)

iterations count:91 (4), effective:14 (0)

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

iterations count:91 (4), effective:14 (0)

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

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

iterations count:64 (3), effective:15 (0)

iterations count:92 (4), effective:14 (0)

iterations count:92 (4), effective:14 (0)

iterations count:30 (1), effective:10 (0)

iterations count:92 (4), effective:14 (0)

iterations count:74 (3), effective:21 (1)

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

iterations count:40 (2), effective:10 (0)

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

iterations count:219 (10), effective:72 (3)

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

iterations count:60 (3), effective:10 (0)

iterations count:60 (3), effective:10 (0)

iterations count:74 (3), effective:14 (0)

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

iterations count:213 (10), effective:54 (2)

iterations count:76 (3), effective:14 (0)

iterations count:82 (4), effective:14 (0)

iterations count:73 (3), effective:16 (0)

iterations count:157 (7), effective:29 (1)

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

iterations count:157 (7), effective:29 (1)

iterations count:69 (3), effective:10 (0)

iterations count:157 (7), effective:29 (1)

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="FMS-PT-00010"
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 FMS-PT-00010, 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-167838856900202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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