About the Execution of 2024-gold for Champagne-PT-H05T2O
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15673.390 | 7354.00 | 14130.00 | 92.50 | 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/mcc2025-input.r266-tall-174931349900027.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 Champagne-PT-H05T2O, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-tall-174931349900027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 101K Jun 5 20:08 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1749318815089
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Champagne-PT-H05T2O
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 17:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-07 17:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:36] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-07 17:53:36] [INFO ] Transformed 569 places.
[2025-06-07 17:53:36] [INFO ] Transformed 686 transitions.
[2025-06-07 17:53:36] [INFO ] Found NUPN structural information;
[2025-06-07 17:53:36] [INFO ] Parsed PT model containing 569 places and 686 transitions and 1566 arcs in 193 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 569/569 places, 686/686 transitions.
Graph (trivial) has 595 edges and 569 vertex of which 301 / 569 are part of one of the 15 SCC in 5 ms
Free SCC test removed 286 places
Ensure Unique test removed 313 transitions
Reduce isomorphic transitions removed 313 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 283 transition count 234
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 165 rules applied. Total rules applied 305 place count 144 transition count 208
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 318 place count 131 transition count 208
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 474 place count 53 transition count 130
Applied a total of 474 rules in 79 ms. Remains 53 /569 variables (removed 516) and now considering 130/686 (removed 556) transitions.
[2025-06-07 17:53:36] [INFO ] Flow matrix only has 62 transitions (discarded 68 similar events)
// Phase 1: matrix 62 rows 53 cols
[2025-06-07 17:53:36] [INFO ] Computed 15 invariants in 5 ms
[2025-06-07 17:53:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-07 17:53:36] [INFO ] Flow matrix only has 62 transitions (discarded 68 similar events)
[2025-06-07 17:53:36] [INFO ] Invariant cache hit.
[2025-06-07 17:53:36] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-07 17:53:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-07 17:53:36] [INFO ] Flow matrix only has 62 transitions (discarded 68 similar events)
[2025-06-07 17:53:37] [INFO ] Invariant cache hit.
[2025-06-07 17:53:37] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 61/114 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 144 constraints, problems are : Problem set: 0 solved, 129 unsolved in 2618 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 61/114 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 129/272 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 273 constraints, problems are : Problem set: 0 solved, 129 unsolved in 2323 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 5014ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 5030ms
Starting structural reductions in LIVENESS mode, iteration 1 : 53/569 places, 130/686 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5451 ms. Remains : 53/569 places, 130/686 transitions.
Discarding 50 transitions out of 130. Remains 80
Initial state reduction rules removed 1 formulas.
RANDOM walk for 31629 steps (1113 resets) in 820 ms. (38 steps per ms) remains 0/79 properties
Able to resolve query QuasiLiveness after proving 80 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 6054 ms.
ITS solved all properties within timeout
BK_STOP 1749318822443
--------------------
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 QuasiLiveness -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="Champagne-PT-H05T2O"
export BK_EXAMINATION="QuasiLiveness"
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 Champagne-PT-H05T2O, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-tall-174931349900027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H05T2O.tgz
mv Champagne-PT-H05T2O execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;