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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
337.403 4618.00 10310.00 45.40 FFFTFFTFTFFTFTFT 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.r289-tajo-171654445800366.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-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.0K Apr 12 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 09:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 09:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 09:53 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

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716874900077

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:41:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:41:41] [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-28 05:41:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 05:41:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 685 ms
[2024-05-28 05:41:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 05:41:42] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 05:41:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40005 steps (3199 resets) in 1375 ms. (29 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40003 steps (1701 resets) in 408 ms. (97 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1006 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (849 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (996 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1389 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (990 resets) in 205 ms. (194 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1386 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (994 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (986 resets) in 1001 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1004 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1015 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (892 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (981 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 05:41:43] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 05:41:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-00 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/47 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-01 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-05 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-08 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-11 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-14 is UNSAT
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/48 variables, 5/13 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 12 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 2/6 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 2/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 12 solved, 1 unsolved
[2024-05-28 05:41:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 7 ms to minimize.
[2024-05-28 05:41:44] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 05:41:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 05:41:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Problem PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-13 is UNSAT
After SMT solving in domain Int declared 47/86 variables, and 17 constraints, problems are : Problem set: 13 solved, 0 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 591ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 05:41:44] [INFO ] Flatten gal took : 20 ms
[2024-05-28 05:41:44] [INFO ] Flatten gal took : 7 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
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-28 05:41:44] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 51 ms.
[2024-05-28 05:41:44] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 6152 steps (423 resets) in 223 ms. (27 steps per ms) remains 0/3 properties
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3251 ms.
ITS solved all properties within timeout

BK_STOP 1716874904695

--------------------
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 ReachabilityCardinality -timeout 360 -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-S05J20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-S05J20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445800366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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