Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876523900092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Medical-PT-24, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876523900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Medical-PT-24-LTLFireability-00
FORMULA_NAME Medical-PT-24-LTLFireability-01
FORMULA_NAME Medical-PT-24-LTLFireability-02
FORMULA_NAME Medical-PT-24-LTLFireability-03
FORMULA_NAME Medical-PT-24-LTLFireability-04
FORMULA_NAME Medical-PT-24-LTLFireability-05
FORMULA_NAME Medical-PT-24-LTLFireability-06
FORMULA_NAME Medical-PT-24-LTLFireability-07
FORMULA_NAME Medical-PT-24-LTLFireability-08
FORMULA_NAME Medical-PT-24-LTLFireability-09
FORMULA_NAME Medical-PT-24-LTLFireability-10
FORMULA_NAME Medical-PT-24-LTLFireability-11
FORMULA_NAME Medical-PT-24-LTLFireability-12
FORMULA_NAME Medical-PT-24-LTLFireability-13
FORMULA_NAME Medical-PT-24-LTLFireability-14
FORMULA_NAME Medical-PT-24-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748837130388

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 04:05:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 04:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 04:05:34] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2025-06-02 04:05:34] [INFO ] Transformed 312 places.
[2025-06-02 04:05:34] [INFO ] Transformed 5431 transitions.
[2025-06-02 04:05:34] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 242 places in 63 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Medical-PT-24-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 30 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2025-06-02 04:05:34] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2025-06-02 04:05:34] [INFO ] Computed 8 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:05:35] [INFO ] Implicit Places using invariants in 630 ms returned []
[2025-06-02 04:05:35] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 04:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:05:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 04:05:35] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-02 04:05:35] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 04:05:35] [INFO ] Invariant cache hit.
[2025-06-02 04:05:35] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:38] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 8 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:40] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/75 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:48] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/134 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:49] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:50] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 3/137 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 137 constraints, problems are : Problem set: 6 solved, 216 unsolved in 19169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/9 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/11 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 182/247 variables, 65/76 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 56/132 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 133/265 constraints. Problems are: Problem set: 12 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:59] [INFO ] Deduced a trap along path composed of 6 places in 52 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:59] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:59] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:05:59] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:01] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:01] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:01] [INFO ] Deduced a trap along path composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 7/272 constraints. Problems are: Problem set: 15 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:03] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:06] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:06] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 3/275 constraints. Problems are: Problem set: 24 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/275 constraints. Problems are: Problem set: 24 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 2/249 variables, 2/277 constraints. Problems are: Problem set: 24 solved, 198 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 76/353 constraints. Problems are: Problem set: 28 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 3/356 constraints. Problems are: Problem set: 28 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:21] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 2/358 constraints. Problems are: Problem set: 28 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 358 constraints, problems are : Problem set: 28 solved, 194 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 209/222 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 49700ms problems are : Problem set: 28 solved, 194 unsolved
Search for dead transitions found 28 dead transitions in 49727ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 199/227 transitions.
Reduce places removed 7 places and 47 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 152
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 57 transition count 123
Reduce places removed 2 places and 13 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 55 transition count 110
Reduce places removed 3 places and 18 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 52 transition count 92
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 16 place count 51 transition count 88
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 17 place count 50 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 17 rules in 5 ms. Remains 50 /67 variables (removed 17) and now considering 83/199 (removed 116) transitions.
[2025-06-02 04:06:25] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 50 cols
[2025-06-02 04:06:25] [INFO ] Computed 9 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:06:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 04:06:25] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2025-06-02 04:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:06:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 04:06:25] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/69 places, 83/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51286 ms. Remains : 50/69 places, 83/227 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 0 out of 49 places after structural reductions.
FORMULA Medical-PT-24-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 04:06:26] [INFO ] Flatten gal took : 66 ms
[2025-06-02 04:06:26] [INFO ] Flatten gal took : 28 ms
[2025-06-02 04:06:26] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Computed a total of 6 stabilizing places and 12 stable transitions
All properties solved by simple procedures.
Total runtime 53248 ms.

BK_STOP 1748837186321

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Medical-PT-24"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is Medical-PT-24, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876523900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-24.tgz
mv Medical-PT-24 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;