About the Execution of 2024-gold for Parking-PT-832
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15690.710 | 13231.00 | 26100.00 | 156.30 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r154-tall-174876825400273.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Parking-PT-832, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825400273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 251K May 29 14:32 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 1748842777185
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:39:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 05:39:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:39:38] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-02 05:39:38] [INFO ] Transformed 737 places.
[2025-06-02 05:39:38] [INFO ] Transformed 993 transitions.
[2025-06-02 05:39:38] [INFO ] Found NUPN structural information;
[2025-06-02 05:39:38] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 214 ms.
Structural test allowed to assert that 305 places are NOT stable. Took 11 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
RANDOM walk for 40000 steps (200 resets) in 3492 ms. (11 steps per ms) remains 126/432 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 17 ms. (22 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
// Phase 1: matrix 609 rows 737 cols
[2025-06-02 05:39:39] [INFO ] Computed 184 invariants in 24 ms
[2025-06-02 05:39:39] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 254/380 variables, 31/157 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 254/411 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 308/688 variables, 145/556 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 308/864 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 49/737 variables, 8/872 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 49/921 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/1346 variables, and 921 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5051 ms.
Refiners :[Domain max(s): 737/737 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/737 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 254/380 variables, 31/157 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 254/411 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 308/688 variables, 145/556 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 308/864 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 49/737 variables, 8/872 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 49/921 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2025-06-02 05:39:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 11 ms to minimize.
[2025-06-02 05:39:49] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2025-06-02 05:39:49] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/1346 variables, and 924 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5015 ms.
Refiners :[Domain max(s): 737/737 constraints, Positive P Invariants (semi-flows): 176/176 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/737 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 0/126 constraints, Known Traps: 3/3 constraints]
After SMT, in 10177ms problems are : Problem set: 0 solved, 126 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 609/609 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 737 transition count 593
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 721 transition count 593
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 721 transition count 577
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 705 transition count 577
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 698 transition count 570
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 698 transition count 570
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 126 place count 674 transition count 546
Free-agglomeration rule applied 128 times.
Iterating global reduction 2 with 128 rules applied. Total rules applied 254 place count 674 transition count 418
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 382 place count 546 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 545 transition count 417
Reduce places removed 127 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 3 with 257 rules applied. Total rules applied 640 place count 418 transition count 287
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 160 rules applied. Total rules applied 800 place count 288 transition count 257
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 816 place count 272 transition count 257
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 816 place count 272 transition count 216
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 898 place count 231 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 902 place count 229 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 904 place count 229 transition count 212
Applied a total of 904 rules in 243 ms. Remains 229 /737 variables (removed 508) and now considering 212/609 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 229/737 places, 212/609 transitions.
RANDOM walk for 3732 steps (0 resets) in 124 ms. (29 steps per ms) remains 0/126 properties
Able to resolve query StableMarking after proving 433 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 11978 ms.
ITS solved all properties within timeout
BK_STOP 1748842790416
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Parking-PT-832"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Parking-PT-832, 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 r154-tall-174876825400273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-832.tgz
mv Parking-PT-832 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.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 '
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 ;