Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455000154.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J06T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717103765832

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:16:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:16:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:16:07] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-30 21:16:07] [INFO ] Transformed 536 places.
[2024-05-30 21:16:07] [INFO ] Transformed 1064 transitions.
[2024-05-30 21:16:07] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 392 ms.
Discarding 96 transitions out of 1064. Remains 968
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 36 ms.23386KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 536/536 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 162 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-30 21:16:08] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-30 21:16:08] [INFO ] Computed 50 invariants in 107 ms
[2024-05-30 21:16:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 50 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 2 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 4 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 4 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 272 places in 235 ms of which 5 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-30 21:16:21] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-05-30 21:16:21] [INFO ] Deduced a trap composed of 253 places in 201 ms of which 3 ms to minimize.
[2024-05-30 21:16:21] [INFO ] Deduced a trap composed of 249 places in 251 ms of which 18 ms to minimize.
[2024-05-30 21:16:23] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-30 21:16:24] [INFO ] Deduced a trap composed of 264 places in 340 ms of which 20 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 250 places in 333 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 14/14 constraints]
After SMT, in 41839ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41908ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42146 ms. Remains : 536/536 places, 968/968 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 536/536 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 116 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-30 21:16:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:16:50] [INFO ] Invariant cache hit.
[2024-05-30 21:16:50] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-30 21:16:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:16:50] [INFO ] Invariant cache hit.
[2024-05-30 21:16:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-30 21:16:51] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2024-05-30 21:16:51] [INFO ] Redundant transitions in 110 ms returned []
Running 966 sub problems to find dead transitions.
[2024-05-30 21:16:51] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:16:51] [INFO ] Invariant cache hit.
[2024-05-30 21:16:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-30 21:17:00] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-30 21:17:01] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-30 21:17:01] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-05-30 21:17:01] [INFO ] Deduced a trap composed of 235 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:17:02] [INFO ] Deduced a trap composed of 258 places in 298 ms of which 4 ms to minimize.
[2024-05-30 21:17:02] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:17:03] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-05-30 21:17:06] [INFO ] Deduced a trap composed of 263 places in 214 ms of which 3 ms to minimize.
[2024-05-30 21:17:06] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:17:07] [INFO ] Deduced a trap composed of 253 places in 205 ms of which 4 ms to minimize.
[2024-05-30 21:17:08] [INFO ] Deduced a trap composed of 269 places in 325 ms of which 7 ms to minimize.
[2024-05-30 21:17:09] [INFO ] Deduced a trap composed of 247 places in 267 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 62 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:17:37] [INFO ] Deduced a trap composed of 98 places in 234 ms of which 4 ms to minimize.
[2024-05-30 21:17:38] [INFO ] Deduced a trap composed of 278 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 64 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 61362ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61375ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62712 ms. Remains : 536/536 places, 968/968 transitions.
Finished random walk after 532 steps, including 0 resets, run found a deadlock after 8 ms. (steps per millisecond=66 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 105620 ms.
ITS solved all properties within timeout

BK_STOP 1717103873062

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 Liveness -timeout 180 -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="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-PT-S02J06T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654455000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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