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.r488-tall-171631133100647.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 ltsminxred
Input is DoubleLock-PT-p3s3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100647
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 DoubleLock-PT-p3s3-ReachabilityFireability-2024-00
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-01
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-02
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-03
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-04
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-05
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2023-06
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-07
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-08
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-09
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-10
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2023-11
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2023-12
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-13
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-14
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717203325221

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:55:26] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-06-01 00:55:26] [INFO ] Transformed 306 places.
[2024-06-01 00:55:26] [INFO ] Transformed 3136 transitions.
[2024-06-01 00:55:26] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 68 places in 19 ms
Reduce places removed 68 places and 128 transitions.
RANDOM walk for 40008 steps (377 resets) in 1716 ms. (23 steps per ms) remains 12/16 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 339 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (70 resets) in 119 ms. (333 steps per ms) remains 10/12 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (69 resets) in 795 ms. (50 steps per ms) remains 9/10 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (57 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (54 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (68 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (62 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
[2024-06-01 00:55:27] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2024-06-01 00:55:28] [INFO ] Computed 4 invariants in 39 ms
[2024-06-01 00:55:28] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2024-04 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2023-06 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2023-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2024-08 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2023-12 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2023-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 83/236 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2121/2358 variables, 237/241 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2358 variables, 143/384 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2358 variables, 0/384 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/2359 variables, 1/385 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2359/2359 variables, and 385 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 9/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 133/235 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:55:30] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 16 ms to minimize.
[2024-06-01 00:55:30] [INFO ] Deduced a trap composed of 100 places in 282 ms of which 3 ms to minimize.
[2024-06-01 00:55:31] [INFO ] Deduced a trap composed of 99 places in 309 ms of which 2 ms to minimize.
[2024-06-01 00:55:31] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 2 ms to minimize.
[2024-06-01 00:55:31] [INFO ] Deduced a trap composed of 99 places in 294 ms of which 2 ms to minimize.
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 161 places in 299 ms of which 2 ms to minimize.
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2024-03 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2023-11 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2023-11 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 107 places in 287 ms of which 2 ms to minimize.
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 108 places in 295 ms of which 3 ms to minimize.
[2024-06-01 00:55:32] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 1 ms to minimize.
Problem DoubleLock-PT-p3s3-ReachabilityFireability-2024-14 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 9/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2121/2357 variables, 236/249 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2357 variables, 143/392 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2357 variables, 1/393 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2357 variables, 0/393 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/2359 variables, 2/395 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2359 variables, 0/395 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2359 variables, 0/395 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2359/2359 variables, and 395 constraints, problems are : Problem set: 7 solved, 2 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 6300ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 327 ms.
Support contains 39 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 129 ms. Remains 235 /238 variables (removed 3) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 235/238 places, 3008/3008 transitions.
RANDOM walk for 40019 steps (375 resets) in 167 ms. (238 steps per ms) remains 1/2 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 34008 steps (66 resets) in 72 ms. (465 steps per ms) remains 0/1 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 8507 ms.
ITS solved all properties within timeout

BK_STOP 1717203334881

--------------------
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 ReachabilityFireability -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="DoubleLock-PT-p3s3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleLock-PT-p3s3, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631133100647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s3.tgz
mv DoubleLock-PT-p3s3 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;