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-171654454700047.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-COL-S02J04T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717103303536

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:08:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:08:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:08:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 806 ms
[2024-05-30 21:08:25] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 27 ms.
[2024-05-30 21:08:25] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 43 ms.
[2024-05-30 21:08:25] [INFO ] Unfolded 65 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-30 21:08:26] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:08:26] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 21:08:26] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (14 resets) in 2398 ms. (16 steps per ms) remains 7/64 properties
BEST_FIRST walk for 40001 steps (10 resets) in 509 ms. (78 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
[2024-05-30 21:08:27] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-30 21:08:27] [INFO ] Computed 46 invariants in 41 ms
[2024-05-30 21:08:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 117/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem qltransition_35 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
SMT process timed out in 601ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 474 transition count 782
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 432 transition count 782
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 86 place count 432 transition count 734
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 182 place count 384 transition count 734
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 278 place count 336 transition count 686
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 284 place count 336 transition count 680
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 290 place count 330 transition count 680
Applied a total of 290 rules in 163 ms. Remains 330 /476 variables (removed 146) and now considering 680/824 (removed 144) transitions.
Running 678 sub problems to find dead transitions.
[2024-05-30 21:08:28] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 330 cols
[2024-05-30 21:08:28] [INFO ] Computed 44 invariants in 19 ms
[2024-05-30 21:08:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 17 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-30 21:08:33] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 3 ms to minimize.
[2024-05-30 21:08:34] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 3 ms to minimize.
[2024-05-30 21:08:34] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-30 21:08:37] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:08:38] [INFO ] Deduced a trap composed of 180 places in 124 ms of which 2 ms to minimize.
[2024-05-30 21:08:38] [INFO ] Deduced a trap composed of 171 places in 117 ms of which 2 ms to minimize.
[2024-05-30 21:08:38] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 2 ms to minimize.
[2024-05-30 21:08:38] [INFO ] Deduced a trap composed of 148 places in 168 ms of which 3 ms to minimize.
[2024-05-30 21:08:38] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-30 21:08:41] [INFO ] Deduced a trap composed of 192 places in 185 ms of which 3 ms to minimize.
[2024-05-30 21:08:43] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 2 ms to minimize.
[2024-05-30 21:08:44] [INFO ] Deduced a trap composed of 119 places in 188 ms of which 4 ms to minimize.
[2024-05-30 21:08:44] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/998 variables, and 61 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/330 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-30 21:08:54] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2024-05-30 21:08:59] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-05-30 21:09:05] [INFO ] Deduced a trap composed of 126 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/998 variables, and 64 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/330 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 22/22 constraints]
After SMT, in 40994ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 41007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41191 ms. Remains : 330/476 places, 680/824 transitions.
Total runtime 44605 ms.
ITS solved all properties within timeout

BK_STOP 1717103349643

--------------------
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 QuasiLiveness -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-COL-S02J04T06"
export BK_EXAMINATION="QuasiLiveness"
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-COL-S02J04T06, examination is QuasiLiveness"
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-171654454700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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