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

About the Execution of GreatSPN+red for IBM319-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
377.688 5764.00 12964.00 229.60 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.r210-smll-171649594000208.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 IBM319-PT-none, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-171649594000208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 06:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 06:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 184K May 18 16:42 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716629335262

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 09:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-25 09:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:28:57] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-25 09:28:57] [INFO ] Transformed 253 places.
[2024-05-25 09:28:57] [INFO ] Transformed 178 transitions.
[2024-05-25 09:28:57] [INFO ] Found NUPN structural information;
[2024-05-25 09:28:57] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 460 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 12 ms.
RANDOM walk for 40000 steps (834 resets) in 2092 ms. (19 steps per ms) remains 9/243 properties
BEST_FIRST walk for 40001 steps (441 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (454 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (446 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (454 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (422 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (461 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (460 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (445 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (430 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
// Phase 1: matrix 178 rows 253 cols
[2024-05-25 09:28:59] [INFO ] Computed 84 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 127/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 103/239 variables, 69/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 103/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 12/251 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 12/335 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 177/428 variables, 251/586 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 3/431 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/431 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 590 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1268 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem smplace_26 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 1489ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 178/178 transitions.
Graph (complete) has 354 edges and 253 vertex of which 230 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Ensure Unique test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 159 transition count 55
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 122 rules applied. Total rules applied 305 place count 51 transition count 41
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 316 place count 43 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 318 place count 41 transition count 38
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 318 place count 41 transition count 26
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 344 place count 27 transition count 26
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 346 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 349 place count 25 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 350 place count 24 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 350 place count 24 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 23 transition count 22
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 362 place count 18 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 363 place count 18 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 365 place count 17 transition count 15
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 368 place count 17 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 371 place count 14 transition count 12
Applied a total of 371 rules in 75 ms. Remains 14 /253 variables (removed 239) and now considering 12/178 (removed 166) transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 14 cols
[2024-05-25 09:29:00] [INFO ] Computed 3 invariants in 1 ms
Problem TDEAD10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD11 is UNSAT
After SMT solving in domain Real declared 14/26 variables, and 13 constraints, problems are : Problem set: 8 solved, 0 unsolved in 51 ms.
Refiners :[Domain max(s): 11/14 constraints, Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 8 solved, 0 unsolved
Search for dead transitions found 8 dead transitions in 66ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 14/253 places, 4/178 transitions.
Graph (complete) has 4 edges and 14 vertex of which 9 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 1 rules in 0 ms. Remains 9 /14 variables (removed 5) and now considering 0/4 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 170 ms. Remains : 9/253 places, 0/178 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 3599 ms.
ITS solved all properties within timeout

BK_STOP 1716629341026

--------------------
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 StableMarking -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="IBM319-PT-none"
export BK_EXAMINATION="StableMarking"
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 IBM319-PT-none, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-171649594000208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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