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

About the Execution of Smart+red for Szymanski-PT-b06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16219.888 3600000.00 3662400.00 17998.50 ???TFF?TTTTT?TFT 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.r491-tall-167912710500470.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 Szymanski-PT-b06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679257158434

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 20:19:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 20:19:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:19:20] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-19 20:19:20] [INFO ] Transformed 568 places.
[2023-03-19 20:19:20] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:19:20] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 21 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10004 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 128128 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128128 steps, saw 67959 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-19 20:19:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:19:24] [INFO ] Computed 3 place invariants in 43 ms
[2023-03-19 20:19:25] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 20:19:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 20:19:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:19:28] [INFO ] After 3355ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-19 20:19:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:19:35] [INFO ] After 6460ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2023-03-19 20:19:50] [INFO ] After 21436ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 20:19:50] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA Szymanski-PT-b06-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 23 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 306 transition count 7941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 305 transition count 7813
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 305 transition count 7813
Applied a total of 126 rules in 542 ms. Remains 305 /308 variables (removed 3) and now considering 7813/8064 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 305/308 places, 7813/8064 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 142917 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142917 steps, saw 73934 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-19 20:19:54] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 20:19:54] [INFO ] Computed 1 place invariants in 27 ms
[2023-03-19 20:19:54] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 20:19:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 20:19:57] [INFO ] After 2847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 20:19:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:20:16] [INFO ] After 19178ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 20:20:19] [INFO ] After 22054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 20:20:19] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 64 ms.
Support contains 23 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 254 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 270 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 20:20:20] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 20:20:20] [INFO ] Invariant cache hit.
[2023-03-19 20:20:20] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 20:20:20] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 20:20:20] [INFO ] Invariant cache hit.
[2023-03-19 20:20:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:20:27] [INFO ] Implicit Places using invariants and state equation in 6716 ms returned []
Implicit Place search using SMT with State Equation took 7163 ms to find 0 implicit places.
[2023-03-19 20:20:28] [INFO ] Redundant transitions in 895 ms returned []
[2023-03-19 20:20:28] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 20:20:28] [INFO ] Invariant cache hit.
[2023-03-19 20:20:30] [INFO ] Dead Transitions using invariants and state equation in 2290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10632 ms. Remains : 305/305 places, 7813/7813 transitions.
Graph (trivial) has 4424 edges and 305 vertex of which 14 / 305 are part of one of the 6 SCC in 5 ms
Free SCC test removed 8 places
Drop transitions removed 1472 transitions
Ensure Unique test removed 3748 transitions
Reduce isomorphic transitions removed 5220 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 297 transition count 2590
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 294 transition count 2590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 294 transition count 2585
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 289 transition count 2585
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 288 transition count 2584
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 288 transition count 2581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 285 transition count 2581
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 285 transition count 2580
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 285 transition count 2579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 284 transition count 2579
Applied a total of 28 rules in 345 ms. Remains 284 /305 variables (removed 21) and now considering 2579/7813 (removed 5234) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 2579 rows 284 cols
[2023-03-19 20:20:30] [INFO ] Computed 1 place invariants in 24 ms
[2023-03-19 20:20:30] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 20:20:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:20:33] [INFO ] After 2032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 20:20:34] [INFO ] After 4010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2972 ms.
[2023-03-19 20:20:37] [INFO ] After 7076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-19 20:20:37] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-19 20:20:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7813 transitions and 31370 arcs took 34 ms.
[2023-03-19 20:20:38] [INFO ] Flatten gal took : 462 ms
Total runtime 78208 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b06
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 305 places, 7813 transitions, 31370 arcs.
Final Score: 125417.817
Took : 127 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Szymanski-PT-b06-ReachabilityCardinality-00 (reachable & potential(( ( (! ( (tk(P276)) <= (tk(P248)) )) & (! ( (tk(P78)) <= (tk(P24)) )) ) & ( ( ( (tk(P151)) <= ( 3 ) ) | (! ( ( 2 ) <= (tk(P211)) )) ) & ( (! ( ( 6 ) <= (tk(P74)) )) | (! ( (tk(P210)) <= ( 0 ) )) ) ) )))
PROPERTY: Szymanski-PT-b06-ReachabilityCardinality-01 (reachable &!potential( ( (! ( (tk(P119)) <= (tk(P107)) )) | ( ( ( (tk(P176)) <= ( 3 ) ) | ( (tk(P170)) <= ( 2 ) ) ) & ( (! ( ( 1 ) <= (tk(P130)) )) | ( (! ( (tk(P297)) <= ( 2 ) )) | ( ( (tk(P278)) <= (tk(P180)) ) & ( ( 2 ) <= (tk(P294)) ) ) ) ) ) )))
PROPERTY: Szymanski-PT-b06-ReachabilityCardinality-02 (reachable & potential(( ( ( 4 ) <= (tk(P294)) ) & ( ( ( 4 ) <= (tk(P211)) ) | (! ( (tk(P135)) <= ( 0 ) )) ) )))
PROPERTY: Szymanski-PT-b06-ReachabilityCardinality-06 (reachable & potential(( (! ( (tk(P184)) <= ( 0 ) )) | ( (! ( (tk(P223)) <= ( 4 ) )) | (! ( (tk(P70)) <= ( 1 ) )) ) )))
PROPERTY: Szymanski-PT-b06-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P224)) <= (tk(P233)) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 157316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039476 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:
++ 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.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
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="Szymanski-PT-b06"
export BK_EXAMINATION="ReachabilityCardinality"
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 Szymanski-PT-b06, 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 r491-tall-167912710500470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 ;