fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r298-tajo-171654454800091
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S04J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2688.500 49765.00 81541.00 71.50 T normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717103465596

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:11:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-30 21:11:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:11:07] [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:11:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:11:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 971 ms
[2024-05-30 21:11:08] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 28 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 21:11:08] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-30 21:11:08] [INFO ] Skeletonized 1 HLPN properties in 0 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:11:08] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 126 ms.
[2024-05-30 21:11:08] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.18877KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Ensure Unique test removed 4 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 614 transition count 1510
Reduce places removed 54 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 560 transition count 1510
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 112 place count 560 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 256 place count 488 transition count 1438
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 376 place count 428 transition count 1378
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 376 rules in 403 ms. Remains 428 /618 variables (removed 190) and now considering 1378/1564 (removed 186) transitions.
Running 1374 sub problems to find dead transitions.
[2024-05-30 21:11:08] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 428 cols
[2024-05-30 21:11:09] [INFO ] Computed 50 invariants in 71 ms
[2024-05-30 21:11:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-30 21:11:25] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 41 ms to minimize.
[2024-05-30 21:11:25] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 1 ms to minimize.
[2024-05-30 21:11:25] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 1 ms to minimize.
[2024-05-30 21:11:25] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 16 ms to minimize.
[2024-05-30 21:11:26] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 1 ms to minimize.
[2024-05-30 21:11:26] [INFO ] Deduced a trap composed of 178 places in 473 ms of which 28 ms to minimize.
[2024-05-30 21:11:27] [INFO ] Deduced a trap composed of 180 places in 266 ms of which 5 ms to minimize.
[2024-05-30 21:11:27] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 2 ms to minimize.
[2024-05-30 21:11:28] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
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 424/1782 variables, and 55 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/428 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-30 21:11:37] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-30 21:11:50] [INFO ] Deduced a trap composed of 132 places in 313 ms of which 3 ms to minimize.
[2024-05-30 21:11:51] [INFO ] Deduced a trap composed of 145 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/428 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 12/12 constraints]
After SMT, in 46175ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 46244ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 46754 ms. Remains : 428/618 places, 1378/1564 transitions.
Finished random walk after 3614 steps, including 0 resets, run found a deadlock after 38 ms. (steps per millisecond=95 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 48217 ms.
ITS solved all properties within timeout

BK_STOP 1717103515361

--------------------
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 ReachabilityDeadlock -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-S04J06T06"
export BK_EXAMINATION="ReachabilityDeadlock"
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-S04J06T06, examination is ReachabilityDeadlock"
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-171654454800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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