Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r157-smll-171636265300242.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Eratosthenes-PT-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265300242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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-050-CTLFireability-2024-00
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-01
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-02
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-03
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-04
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-05
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-06
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-07
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-08
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-09
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-10
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2024-11
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2023-12
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2023-13
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2023-14
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716555504762

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 12:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 12:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:58:27] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-24 12:58:27] [INFO ] Transformed 49 places.
[2024-05-24 12:58:27] [INFO ] Transformed 108 transitions.
[2024-05-24 12:58:27] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 30 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 48 place count 33 transition count 33
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 31 transition count 31
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 31 transition count 31
Applied a total of 52 rules in 49 ms. Remains 31 /34 variables (removed 3) and now considering 31/80 (removed 49) transitions.
// Phase 1: matrix 31 rows 31 cols
[2024-05-24 12:58:28] [INFO ] Computed 0 invariants in 6 ms
[2024-05-24 12:58:28] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-24 12:58:28] [INFO ] Invariant cache hit.
[2024-05-24 12:58:28] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 31/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 31/34 places, 31/80 transitions.
Support contains 30 out of 31 places after structural reductions.
[2024-05-24 12:58:28] [INFO ] Flatten gal took : 35 ms
[2024-05-24 12:58:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 140 steps (0 resets) in 90 ms. (1 steps per ms) remains 0/54 properties
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 6 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 7 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 31 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 31
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-050-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 1 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Applied a total of 1 rules in 15 ms. Remains 1 /31 variables (removed 30) and now considering 1/31 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 1/31 places, 1/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 0 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 9 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Applied a total of 1 rules in 3 ms. Remains 9 /31 variables (removed 22) and now considering 9/31 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 9/31 places, 9/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 1 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /31 variables (removed 30) and now considering 1/31 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 1/31 places, 1/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 0 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 19 transition count 19
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 19 transition count 19
Applied a total of 24 rules in 2 ms. Remains 19 /31 variables (removed 12) and now considering 19/31 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 19/31 places, 19/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 3 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 3 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 4 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /31 variables (removed 27) and now considering 4/31 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 4/31 places, 4/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 10 transition count 10
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 10 transition count 10
Applied a total of 42 rules in 3 ms. Remains 10 /31 variables (removed 21) and now considering 10/31 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 10/31 places, 10/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 7 transition count 7
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 7 transition count 7
Applied a total of 48 rules in 3 ms. Remains 7 /31 variables (removed 24) and now considering 7/31 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 7/31 places, 7/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 11 transition count 11
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 11 transition count 11
Applied a total of 40 rules in 2 ms. Remains 11 /31 variables (removed 20) and now considering 11/31 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 11/31 places, 11/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 6 transition count 6
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 6 transition count 6
Applied a total of 50 rules in 3 ms. Remains 6 /31 variables (removed 25) and now considering 6/31 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 6/31 places, 6/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 12 transition count 12
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 12 transition count 12
Applied a total of 38 rules in 2 ms. Remains 12 /31 variables (removed 19) and now considering 12/31 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 12/31 places, 12/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 16 transition count 16
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 16 transition count 16
Applied a total of 30 rules in 2 ms. Remains 16 /31 variables (removed 15) and now considering 16/31 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 16/31 places, 16/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 6 transition count 6
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 6 transition count 6
Applied a total of 50 rules in 2 ms. Remains 6 /31 variables (removed 25) and now considering 6/31 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 6/31 places, 6/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 2 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /31 variables (removed 29) and now considering 2/31 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/31 places, 2/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 0 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 8 transition count 8
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 8 transition count 8
Applied a total of 46 rules in 2 ms. Remains 8 /31 variables (removed 23) and now considering 8/31 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 8/31 places, 8/31 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 12:58:29] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 12:58:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 12:58:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-05-24 12:58:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 31 transitions and 31 arcs took 8 ms.
Total runtime 2173 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Eratosthenes-PT-050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 31
TRANSITIONS: 31
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 527
MODEL NAME: /home/mcc/execution/414/model
31 places, 31 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Eratosthenes-PT-050-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Eratosthenes-PT-050-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716555510860

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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-050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Eratosthenes-PT-050, 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 r157-smll-171636265300242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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