About the Execution of Smart+red for QuasiCertifProtocol-PT-28
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7513.128 | 3600000.00 | 3646154.00 | 8458.10 | TTFFTFFTTFFTFFTF | 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.r299-tall-167873953600903.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 smartxred
Input is QuasiCertifProtocol-PT-28, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953600903
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 749K 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 QuasiCertifProtocol-PT-28-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679564311852
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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:38:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:38:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:38:33] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-23 09:38:33] [INFO ] Transformed 2998 places.
[2023-03-23 09:38:33] [INFO ] Transformed 446 transitions.
[2023-03-23 09:38:33] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 303 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 16) seen :3
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 1198 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-23 09:38:36] [INFO ] Computed 2553 place invariants in 116 ms
[2023-03-23 09:38:39] [INFO ] [Real]Absence check using 32 positive place invariants in 40 ms returned sat
[2023-03-23 09:38:40] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 548 ms returned sat
[2023-03-23 09:38:41] [INFO ] After 2994ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-23 09:38:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 37 ms returned sat
[2023-03-23 09:38:42] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 526 ms returned sat
[2023-03-23 09:39:06] [INFO ] After 21443ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-23 09:39:06] [INFO ] After 21450ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-23 09:39:06] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 4 different solutions.
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 30 ms.
Support contains 1015 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2181 are kept as prefixes of interest. Removing 817 places using SCC suffix rule.16 ms
Discarding 817 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 2181 transition count 417
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 28 place count 2181 transition count 416
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 2180 transition count 416
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 54 place count 2156 transition count 392
Iterating global reduction 1 with 24 rules applied. Total rules applied 78 place count 2156 transition count 392
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 1 with 46 rules applied. Total rules applied 124 place count 2156 transition count 346
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 170 place count 2110 transition count 346
Applied a total of 170 rules in 492 ms. Remains 2110 /2998 variables (removed 888) and now considering 346/446 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 2110/2998 places, 346/446 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 867765 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 867765 steps, saw 110378 distinct states, run finished after 3002 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 346 rows 2110 cols
[2023-03-23 09:39:10] [INFO ] Computed 1765 place invariants in 28 ms
[2023-03-23 09:39:11] [INFO ] [Real]Absence check using 0 positive and 1765 generalized place invariants in 314 ms returned sat
[2023-03-23 09:39:11] [INFO ] After 906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 09:39:12] [INFO ] [Nat]Absence check using 0 positive and 1765 generalized place invariants in 322 ms returned sat
[2023-03-23 09:39:19] [INFO ] After 7107ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 09:39:22] [INFO ] After 10236ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 9567 ms.
[2023-03-23 09:39:32] [INFO ] After 20716ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 136 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=27 )
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 59033 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running QuasiCertifProtocol (PT), instance 28
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 2998 places, 446 transitions, 6489 arcs.
Final Score: 206522.853
Took : 57 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8636152 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102468 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 ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is QuasiCertifProtocol-PT-28, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tall-167873953600903"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;