fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r098-smll-174860112300222
Last Updated
June 24, 2025

About the Execution of 2024-gold for FireWire-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15692.390 65623.00 85660.00 411.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.r098-smll-174860112300222.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 FireWire-PT-15, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748683808421

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:30:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 09:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:30:10] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2025-05-31 09:30:10] [INFO ] Transformed 248 places.
[2025-05-31 09:30:10] [INFO ] Transformed 383 transitions.
[2025-05-31 09:30:10] [INFO ] Found NUPN structural information;
[2025-05-31 09:30:10] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 390 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 192 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 8 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 234 transition count 326
Reduce places removed 47 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 1 with 49 rules applied. Total rules applied 102 place count 187 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 186 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 103 place count 186 transition count 318
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 180 transition count 318
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 233 place count 121 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 121 transition count 258
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -116
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 266 place count 105 transition count 374
Applied a total of 266 rules in 183 ms. Remains 105 /248 variables (removed 143) and now considering 374/383 (removed 9) transitions.
[2025-05-31 09:30:11] [INFO ] Flow matrix only has 356 transitions (discarded 18 similar events)
// Phase 1: matrix 356 rows 105 cols
[2025-05-31 09:30:11] [INFO ] Computed 4 invariants in 41 ms
[2025-05-31 09:30:11] [INFO ] Implicit Places using invariants in 657 ms returned []
[2025-05-31 09:30:11] [INFO ] Flow matrix only has 356 transitions (discarded 18 similar events)
[2025-05-31 09:30:11] [INFO ] Invariant cache hit.
[2025-05-31 09:30:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 09:30:12] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-05-31 09:30:13] [INFO ] Flow matrix only has 356 transitions (discarded 18 similar events)
[2025-05-31 09:30:13] [INFO ] Invariant cache hit.
[2025-05-31 09:30:13] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 371 unsolved
[2025-05-31 09:30:19] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 24 ms to minimize.
[2025-05-31 09:30:20] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 2 ms to minimize.
[2025-05-31 09:30:20] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2025-05-31 09:30:20] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2025-05-31 09:30:20] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD92 is UNSAT
[2025-05-31 09:30:20] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2025-05-31 09:30:21] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2025-05-31 09:30:21] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
[2025-05-31 09:30:21] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 9/118 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/118 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 6 (OVERLAPS) 355/460 variables, 105/223 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 48/271 constraints. Problems are: Problem set: 19 solved, 352 unsolved
[2025-05-31 09:30:29] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/272 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/272 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 10 (OVERLAPS) 1/461 variables, 1/273 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/273 constraints. Problems are: Problem set: 19 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 273 constraints, problems are : Problem set: 19 solved, 352 unsolved in 30035 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 19 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/108 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/109 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 10/119 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/119 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 6 (OVERLAPS) 355/460 variables, 105/224 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 48/272 constraints. Problems are: Problem set: 19 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 352/624 constraints. Problems are: Problem set: 19 solved, 352 unsolved
[2025-05-31 09:30:53] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/625 constraints. Problems are: Problem set: 19 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/461 variables, and 625 constraints, problems are : Problem set: 19 solved, 352 unsolved in 30029 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 48/49 constraints, PredecessorRefiner: 352/371 constraints, Known Traps: 11/11 constraints]
After SMT, in 60951ms problems are : Problem set: 19 solved, 352 unsolved
Search for dead transitions found 19 dead transitions in 60999ms
Found 19 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 63422 ms.
ITS solved all properties within timeout

BK_STOP 1748683874044

--------------------
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 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="FireWire-PT-15"
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 FireWire-PT-15, 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 r098-smll-174860112300222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;