fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873952100718
Last Updated
May 14, 2023

About the Execution of Marcie+red for PolyORBNT-PT-S05J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8610.888 3600000.00 3632359.00 9166.80 FFTFFTFTFFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952100718.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PolyORBNT-PT-S05J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 18K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 294K Feb 25 23:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 83K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 402K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679646592708

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 08:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 08:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 08:29:54] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-24 08:29:54] [INFO ] Transformed 349 places.
[2023-03-24 08:29:54] [INFO ] Transformed 1210 transitions.
[2023-03-24 08:29:54] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :3
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 08:29:55] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-24 08:29:55] [INFO ] Computed 62 place invariants in 35 ms
[2023-03-24 08:29:56] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 08:29:56] [INFO ] [Nat]Absence check using 42 positive place invariants in 10 ms returned sat
[2023-03-24 08:29:56] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-24 08:29:58] [INFO ] After 2507ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2023-03-24 08:29:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 08:30:00] [INFO ] After 1267ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :12 sat :1
[2023-03-24 08:30:02] [INFO ] After 3773ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2023-03-24 08:30:03] [INFO ] After 7555ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 25 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 344 transition count 533
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 51 place count 322 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 320 transition count 531
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 53 place count 320 transition count 509
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 97 place count 298 transition count 509
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 297 transition count 508
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 297 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 295 transition count 506
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 295 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 294 transition count 505
Applied a total of 105 rules in 144 ms. Remains 294 /349 variables (removed 55) and now considering 505/555 (removed 50) transitions.
[2023-03-24 08:30:03] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
// Phase 1: matrix 501 rows 294 cols
[2023-03-24 08:30:03] [INFO ] Computed 57 place invariants in 15 ms
[2023-03-24 08:30:04] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 294/349 places, 410/555 transitions.
Applied a total of 0 rules in 18 ms. Remains 294 /294 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 294/349 places, 410/555 transitions.
Finished random walk after 438 steps, including 17 resets, run visited all 1 properties in 3 ms. (steps per millisecond=146 )
FORMULA PolyORBNT-PT-S05J20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9924 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PolyORBNT_PT_S05J20
(NrP: 349 NrTr: 1210 NrArc: 8824)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.090sec

net check time: 0m 0.001sec

init dd package: 0m 2.740sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7534056 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098688 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.014sec

70074 561462 1447078 1722797 1787748 2189233 2310296

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="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBNT-PT-S05J20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952100718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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