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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 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 Liveness

=== Now, execution of the tool begins

BK_START 1717103364687

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:09:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:09:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:09:26] [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:09:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:09:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1037 ms
[2024-05-30 21:09:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 49 ms.
[2024-05-30 21:09:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 10 ms.
[2024-05-30 21:09:27] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:09:27] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 73 ms.
[2024-05-30 21:09:27] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:09:27] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 27 ms.
[2024-05-30 21:09:27] [INFO ] Unfolded 65 HLPN properties in 2 ms.
[2024-05-30 21:09:27] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:09:27] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 21:09:27] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-30 21:09:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 2 ms.
[2024-05-30 21:09:27] [INFO ] Skeletonized 65 HLPN properties in 5 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 21:09:27] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 27 ms.
[2024-05-30 21:09:27] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:09:27] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:09:27] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 21:09:27] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.18661KB 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 105 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:09:28] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-30 21:09:28] [INFO ] Computed 50 invariants in 67 ms
[2024-05-30 21:09:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:09:37] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 30 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 5 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 11 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 1 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 16 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 280 places in 383 ms of which 5 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 280 places in 278 ms of which 4 ms to minimize.
[2024-05-30 21:09:39] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 3 ms to minimize.
[2024-05-30 21:09:40] [INFO ] Deduced a trap composed of 292 places in 286 ms of which 4 ms to minimize.
[2024-05-30 21:09:40] [INFO ] Deduced a trap composed of 298 places in 214 ms of which 3 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 268 places in 252 ms of which 4 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 261 places in 295 ms of which 4 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:09:51] [INFO ] Deduced a trap composed of 277 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:09:52] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-30 21:09:57] [INFO ] Deduced a trap composed of 37 places in 335 ms of which 4 ms to minimize.
[2024-05-30 21:09:57] [INFO ] Deduced a trap composed of 371 places in 203 ms of which 4 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 361 places in 293 ms of which 5 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 369 places in 274 ms of which 4 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 362 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 353 places in 226 ms of which 4 ms to minimize.
[2024-05-30 21:10:03] [INFO ] Deduced a trap composed of 260 places in 292 ms of which 4 ms to minimize.
[2024-05-30 21:10:03] [INFO ] Deduced a trap composed of 282 places in 287 ms of which 6 ms to minimize.
[2024-05-30 21:10:04] [INFO ] Deduced a trap composed of 263 places in 260 ms of which 4 ms to minimize.
[2024-05-30 21:10:04] [INFO ] Deduced a trap composed of 250 places in 232 ms of which 16 ms to minimize.
[2024-05-30 21:10:04] [INFO ] Deduced a trap composed of 289 places in 229 ms of which 3 ms to minimize.
[2024-05-30 21:10:04] [INFO ] Deduced a trap composed of 293 places in 176 ms of which 3 ms to minimize.
[2024-05-30 21:10:05] [INFO ] Deduced a trap composed of 264 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 15/74 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 74 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 28/28 constraints]
After SMT, in 41728ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41847ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42027 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 87 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-30 21:10:10] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:10:10] [INFO ] Invariant cache hit.
[2024-05-30 21:10:10] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-30 21:10:10] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:10:10] [INFO ] Invariant cache hit.
[2024-05-30 21:10:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-30 21:10:11] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-05-30 21:10:11] [INFO ] Redundant transitions in 53 ms returned []
Running 966 sub problems to find dead transitions.
[2024-05-30 21:10:11] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-30 21:10:11] [INFO ] Invariant cache hit.
[2024-05-30 21:10:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:10:20] [INFO ] Deduced a trap composed of 294 places in 229 ms of which 4 ms to minimize.
[2024-05-30 21:10:21] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:10:21] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 3 ms to minimize.
[2024-05-30 21:10:21] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-30 21:10:21] [INFO ] Deduced a trap composed of 286 places in 261 ms of which 3 ms to minimize.
[2024-05-30 21:10:22] [INFO ] Deduced a trap composed of 269 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:10:22] [INFO ] Deduced a trap composed of 286 places in 251 ms of which 4 ms to minimize.
[2024-05-30 21:10:22] [INFO ] Deduced a trap composed of 317 places in 270 ms of which 4 ms to minimize.
[2024-05-30 21:10:23] [INFO ] Deduced a trap composed of 368 places in 250 ms of which 4 ms to minimize.
[2024-05-30 21:10:23] [INFO ] Deduced a trap composed of 339 places in 192 ms of which 3 ms to minimize.
[2024-05-30 21:10:23] [INFO ] Deduced a trap composed of 297 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:10:23] [INFO ] Deduced a trap composed of 292 places in 268 ms of which 4 ms to minimize.
[2024-05-30 21:10:24] [INFO ] Deduced a trap composed of 260 places in 275 ms of which 4 ms to minimize.
[2024-05-30 21:10:32] [INFO ] Deduced a trap composed of 275 places in 303 ms of which 3 ms to minimize.
[2024-05-30 21:10:32] [INFO ] Deduced a trap composed of 269 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-30 21:10:41] [INFO ] Deduced a trap composed of 270 places in 219 ms of which 3 ms to minimize.
[2024-05-30 21:10:41] [INFO ] Deduced a trap composed of 275 places in 264 ms of which 5 ms to minimize.
[2024-05-30 21:10:42] [INFO ] Deduced a trap composed of 280 places in 253 ms of which 6 ms to minimize.
[2024-05-30 21:10:42] [INFO ] Deduced a trap composed of 262 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:10:42] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:10:42] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 31630ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 31642ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 32918 ms. Remains : 536/536 places, 968/968 transitions.
Finished random walk after 1346 steps, including 0 resets, run found a deadlock after 13 ms. (steps per millisecond=103 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 76631 ms.
ITS solved all properties within timeout

BK_STOP 1717103442970

--------------------
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 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-COL-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-COL-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-171654454800064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-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 ;