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

About the Execution of GreatSPN+red for PolyORBNT-PT-S10J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
530.199 12868.00 30318.00 79.00 TTTFFFTFFTTTFFTF 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-171654446100502.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-PT-S10J40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446100502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 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 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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-PT-S10J40-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716892282836

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:31:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 10:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:31:25] [INFO ] Load time of PNML (sax parser for PT used): 1003 ms
[2024-05-28 10:31:25] [INFO ] Transformed 854 places.
[2024-05-28 10:31:26] [INFO ] Transformed 12340 transitions.
[2024-05-28 10:31:26] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 1315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2237 resets) in 4816 ms. (8 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (40 resets) in 229 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (40 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (44 resets) in 120 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 179 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (40 resets) in 125 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (40 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (41 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 126 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 51229 steps, run timeout after 3012 ms. (steps per millisecond=17 ) properties seen :2 out of 15
Probabilistic random walk after 51229 steps, saw 15919 distinct states, run finished after 3033 ms. (steps per millisecond=16 ) properties seen :2
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-28 10:31:31] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-28 10:31:31] [INFO ] Computed 112 invariants in 152 ms
[2024-05-28 10:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/807 variables, 52/52 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/807 variables, 2/54 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/807 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 31/838 variables, 29/83 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 3/86 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 0/86 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 16/854 variables, 26/112 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/112 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2221/3075 variables, 854/966 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3075 variables, 1/967 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3075/3075 variables, and 967 constraints, problems are : Problem set: 12 solved, 1 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 854/854 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 241/810 variables, 80/81 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/810 variables, 2/83 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/83 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Problem PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 854/3075 variables, and 112 constraints, problems are : Problem set: 13 solved, 0 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/854 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 4149ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 10858 ms.
ITS solved all properties within timeout

BK_STOP 1716892295704

--------------------
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 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-PT-S10J40"
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-PT-S10J40, 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-171654446100502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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