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

About the Execution of GreatSPN+red for PolyORBNT-COL-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
945.023 45508.00 71616.00 104.60 F 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-171654455100234.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 PolyORBNT-COL-S05J30, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455100234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.8K Apr 12 09:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 12 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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 1717104389840

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:26:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:26:31] [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:26:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:26:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 829 ms
[2024-05-30 21:26:32] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 21 ms.
[2024-05-30 21:26:32] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-30 21:26:32] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:26:32] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 64 ms.
[2024-05-30 21:26:32] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:26:32] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 17 ms.
[2024-05-30 21:26:32] [INFO ] Unfolded 38 HLPN properties in 0 ms.
[2024-05-30 21:26:32] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-30 21:26:32] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-30 21:26:32] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-30 21:26:32] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 0 ms.
[2024-05-30 21:26:32] [INFO ] Skeletonized 38 HLPN properties in 2 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 Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-30 21:26:32] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 68 ms.
[2024-05-30 21:26:32] [INFO ] Unfolded 38 HLPN properties in 0 ms.
[2024-05-30 21:26:32] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-30 21:26:32] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-30 21:26:32] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.28517KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 489/489 places, 745/745 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 121 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2024-05-30 21:26:32] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-30 21:26:33] [INFO ] Computed 82 invariants in 68 ms
[2024-05-30 21:26:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-30 21:26:53] [INFO ] Deduced a trap composed of 24 places in 451 ms of which 66 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 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 487/1230 variables, and 81 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20154 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 78 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 66/66 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 5/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 3 (OVERLAPS) 9/487 variables, 9/80 constraints. Problems are: Problem set: 78 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/81 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-30 21:27:04] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:27:04] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 2/83 constraints. Problems are: Problem set: 78 solved, 661 unsolved
[2024-05-30 21:27:10] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/84 constraints. Problems are: Problem set: 78 solved, 661 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 Int declared 487/1230 variables, and 84 constraints, problems are : Problem set: 78 solved, 661 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/489 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/739 constraints, Known Traps: 4/4 constraints]
After SMT, in 42138ms problems are : Problem set: 78 solved, 661 unsolved
Search for dead transitions found 78 dead transitions in 42207ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 489/489 places, 667/745 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 54 ms. Remains 489 /489 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42463 ms. Remains : 489/489 places, 667/745 transitions.
Finished random walk after 12 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=12 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 43846 ms.
ITS solved all properties within timeout

BK_STOP 1717104435348

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

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