fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r276-smll-171654415900100
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PermAdmissibility-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
351.859 11040.00 24456.00 169.00 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r276-smll-171654415900100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PermAdmissibility-PT-01, examination is OneSafe
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 484K 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 OneSafe

=== Now, execution of the tool begins

BK_START 1716815841748

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=OneSafe
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PermAdmissibility-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:17:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, OneSafe, -timeout, 180, -rebuildPNML]
[2024-05-27 13:17:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:17:24] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2024-05-27 13:17:24] [INFO ] Transformed 168 places.
[2024-05-27 13:17:24] [INFO ] Transformed 592 transitions.
[2024-05-27 13:17:24] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 490 ms.
Structural unfed/single firing approximation deduced that 9/168 places are one safe.
// Phase 1: matrix 592 rows 168 cols
[2024-05-27 13:17:24] [INFO ] Computed 32 invariants in 52 ms
[2024-05-27 13:17:24] [INFO ] Rough structural analysis with invariants proved 0 places are one safe in 70 ms (including invariant computation).
[2024-05-27 13:17:25] [INFO ] [Real]Absence check using 0 positive place invariants in 236 ms proved 0 places are One-Safe.
[2024-05-27 13:17:25] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 240 ms proved 168 places are One-Safe.
RANDOM walk for 40000 steps (2352 resets) in 4357 ms. (9 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 159/159 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 159/159 properties
Probabilistic random walk after 100000 steps, saw 49306 distinct states, run finished after 2954 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-27 13:17:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Problem osplace_0 is UNSAT
Problem osplace_1 is UNSAT
Problem osplace_2 is UNSAT
Problem osplace_3 is UNSAT
Problem osplace_4 is UNSAT
Problem osplace_6 is UNSAT
Problem osplace_7 is UNSAT
Problem osplace_8 is UNSAT
Problem osplace_9 is UNSAT
Problem osplace_10 is UNSAT
Problem osplace_11 is UNSAT
Problem osplace_12 is UNSAT
Problem osplace_13 is UNSAT
Problem osplace_15 is UNSAT
Problem osplace_16 is UNSAT
Problem osplace_17 is UNSAT
Problem osplace_18 is UNSAT
Problem osplace_19 is UNSAT
Problem osplace_20 is UNSAT
Problem osplace_21 is UNSAT
Problem osplace_22 is UNSAT
Problem osplace_23 is UNSAT
Problem osplace_24 is UNSAT
Problem osplace_25 is UNSAT
Problem osplace_26 is UNSAT
Problem osplace_27 is UNSAT
Problem osplace_28 is UNSAT
Problem osplace_29 is UNSAT
Problem osplace_30 is UNSAT
Problem osplace_31 is UNSAT
Problem osplace_32 is UNSAT
Problem osplace_33 is UNSAT
Problem osplace_34 is UNSAT
Problem osplace_35 is UNSAT
Problem osplace_36 is UNSAT
Problem osplace_37 is UNSAT
Problem osplace_38 is UNSAT
Problem osplace_39 is UNSAT
Problem osplace_40 is UNSAT
Problem osplace_41 is UNSAT
Problem osplace_42 is UNSAT
Problem osplace_43 is UNSAT
Problem osplace_44 is UNSAT
Problem osplace_45 is UNSAT
Problem osplace_46 is UNSAT
Problem osplace_47 is UNSAT
Problem osplace_48 is UNSAT
Problem osplace_49 is UNSAT
Problem osplace_50 is UNSAT
Problem osplace_51 is UNSAT
Problem osplace_52 is UNSAT
Problem osplace_53 is UNSAT
Problem osplace_55 is UNSAT
Problem osplace_56 is UNSAT
Problem osplace_57 is UNSAT
Problem osplace_58 is UNSAT
Problem osplace_59 is UNSAT
Problem osplace_60 is UNSAT
Problem osplace_61 is UNSAT
Problem osplace_62 is UNSAT
Problem osplace_63 is UNSAT
Problem osplace_64 is UNSAT
Problem osplace_65 is UNSAT
Problem osplace_66 is UNSAT
Problem osplace_68 is UNSAT
Problem osplace_69 is UNSAT
Problem osplace_70 is UNSAT
Problem osplace_71 is UNSAT
Problem osplace_72 is UNSAT
Problem osplace_73 is UNSAT
Problem osplace_74 is UNSAT
Problem osplace_75 is UNSAT
Problem osplace_76 is UNSAT
Problem osplace_77 is UNSAT
Problem osplace_78 is UNSAT
Problem osplace_79 is UNSAT
Problem osplace_80 is UNSAT
Problem osplace_81 is UNSAT
Problem osplace_82 is UNSAT
Problem osplace_83 is UNSAT
Problem osplace_84 is UNSAT
Problem osplace_85 is UNSAT
Problem osplace_86 is UNSAT
Problem osplace_87 is UNSAT
Problem osplace_88 is UNSAT
Problem osplace_89 is UNSAT
Problem osplace_90 is UNSAT
Problem osplace_91 is UNSAT
Problem osplace_92 is UNSAT
Problem osplace_93 is UNSAT
Problem osplace_94 is UNSAT
Problem osplace_95 is UNSAT
Problem osplace_96 is UNSAT
Problem osplace_97 is UNSAT
Problem osplace_98 is UNSAT
Problem osplace_99 is UNSAT
Problem osplace_100 is UNSAT
Problem osplace_101 is UNSAT
Problem osplace_102 is UNSAT
Problem osplace_103 is UNSAT
Problem osplace_104 is UNSAT
Problem osplace_106 is UNSAT
Problem osplace_107 is UNSAT
Problem osplace_108 is UNSAT
Problem osplace_109 is UNSAT
Problem osplace_111 is UNSAT
Problem osplace_112 is UNSAT
Problem osplace_113 is UNSAT
Problem osplace_114 is UNSAT
Problem osplace_115 is UNSAT
Problem osplace_116 is UNSAT
Problem osplace_118 is UNSAT
Problem osplace_119 is UNSAT
Problem osplace_120 is UNSAT
Problem osplace_121 is UNSAT
Problem osplace_122 is UNSAT
Problem osplace_123 is UNSAT
Problem osplace_124 is UNSAT
Problem osplace_125 is UNSAT
Problem osplace_126 is UNSAT
Problem osplace_127 is UNSAT
Problem osplace_128 is UNSAT
Problem osplace_129 is UNSAT
Problem osplace_130 is UNSAT
Problem osplace_131 is UNSAT
Problem osplace_132 is UNSAT
Problem osplace_133 is UNSAT
Problem osplace_134 is UNSAT
Problem osplace_135 is UNSAT
Problem osplace_136 is UNSAT
Problem osplace_138 is UNSAT
Problem osplace_139 is UNSAT
Problem osplace_140 is UNSAT
Problem osplace_141 is UNSAT
Problem osplace_143 is UNSAT
Problem osplace_144 is UNSAT
Problem osplace_150 is UNSAT
Problem osplace_151 is UNSAT
Problem osplace_152 is UNSAT
Problem osplace_153 is UNSAT
Problem osplace_154 is UNSAT
Problem osplace_155 is UNSAT
Problem osplace_156 is UNSAT
Problem osplace_157 is UNSAT
Problem osplace_158 is UNSAT
Problem osplace_159 is UNSAT
Problem osplace_162 is UNSAT
Problem osplace_163 is UNSAT
Problem osplace_165 is UNSAT
At refinement iteration 2 (OVERLAPS) 8/167 variables, 22/31 constraints. Problems are: Problem set: 149 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/31 constraints. Problems are: Problem set: 149 solved, 10 unsolved
Problem osplace_5 is UNSAT
Problem osplace_14 is UNSAT
Problem osplace_54 is UNSAT
Problem osplace_67 is UNSAT
Problem osplace_105 is UNSAT
Problem osplace_110 is UNSAT
Problem osplace_117 is UNSAT
Problem osplace_137 is UNSAT
Problem osplace_142 is UNSAT
Problem osplace_149 is UNSAT
After SMT solving in domain Real declared 168/760 variables, and 32 constraints, problems are : Problem set: 159 solved, 0 unsolved in 2256 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 2476ms problems are : Problem set: 159 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Able to resolve query OneSafe after proving 327 properties.
FORMULA OneSafe TRUE TECHNIQUES SMT_REFINEMENT SAT_SMT STRUCTURAL
Total runtime 8704 ms.
ITS solved all properties within timeout

BK_STOP 1716815852788

--------------------
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 OneSafe -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="PermAdmissibility-PT-01"
export BK_EXAMINATION="OneSafe"
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 PermAdmissibility-PT-01, examination is OneSafe"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654415900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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