About the Execution of Smart+red for Medical-PT-16
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16223.252 | 1039730.00 | 1063698.00 | 16182.30 | FFFFTT?FTFFFTT?? | 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.r235-tall-167856422200710.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 Medical-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422200710
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 14:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 14:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 14:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 5 18:22 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 Medical-PT-16-ReachabilityCardinality-00
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-01
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-02
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-03
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-04
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-05
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-06
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-07
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-08
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-09
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-10
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-11
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-12
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-13
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-14
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678684446739
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=Medical-PT-16
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 05:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 05:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:14:08] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-03-13 05:14:08] [INFO ] Transformed 312 places.
[2023-03-13 05:14:08] [INFO ] Transformed 5431 transitions.
[2023-03-13 05:14:08] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 18 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-16-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 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 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 325649 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325649 steps, saw 186193 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 05:14:12] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2023-03-13 05:14:12] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-13 05:14:12] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 05:14:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 05:14:12] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 05:14:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-13 05:14:12] [INFO ] After 32ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 13 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-13 05:14:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 800 ms
[2023-03-13 05:14:13] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2023-03-13 05:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-13 05:14:13] [INFO ] After 910ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 05:14:13] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA Medical-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Medical-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 67 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 65 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 64 transition count 225
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 62 transition count 223
Applied a total of 11 rules in 34 ms. Remains 62 /69 variables (removed 7) and now considering 223/227 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 62/69 places, 223/227 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 480025 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 480025 steps, saw 287789 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 05:14:16] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2023-03-13 05:14:16] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-13 05:14:16] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 05:14:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 05:14:16] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 05:14:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-13 05:14:16] [INFO ] After 37ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 05:14:16] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2023-03-13 05:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-13 05:14:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-13 05:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-13 05:14:16] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-13 05:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-13 05:14:16] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 05:14:17] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-13 05:14:17] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2023-03-13 05:14:17] [INFO ] Invariant cache hit.
[2023-03-13 05:14:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-13 05:14:17] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2023-03-13 05:14:17] [INFO ] Invariant cache hit.
[2023-03-13 05:14:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-13 05:14:17] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-13 05:14:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 05:14:17] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2023-03-13 05:14:17] [INFO ] Invariant cache hit.
[2023-03-13 05:14:17] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 62/62 places, 223/223 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 62 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 51 place count 62 transition count 171
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 61 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 61 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 59 transition count 169
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 59 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 58 transition count 180
Applied a total of 59 rules in 17 ms. Remains 58 /62 variables (removed 4) and now considering 180/223 (removed 43) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 180 rows 58 cols
[2023-03-13 05:14:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-13 05:14:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 05:14:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 05:14:17] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 05:14:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 05:14:17] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 05:14:17] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-13 05:14:17] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 05:14:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-13 05:14:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 223 transitions and 1138 arcs took 3 ms.
[2023-03-13 05:14:17] [INFO ] Flatten gal took : 53 ms
Total runtime 9675 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Medical (PT), instance 16
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: 62 places, 223 transitions, 1138 arcs.
Final Score: 1194.444
Took : 11 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Medical-PT-16-ReachabilityCardinality-06 (reachable & potential(( (! ( (tk(P47)) <= ( 0 ) )) | (! ( (tk(P57)) <= ( 0 ) )) )))
PROPERTY: Medical-PT-16-ReachabilityCardinality-14 (reachable &!potential( ( (! ( (tk(P36)) <= ( 0 ) )) | ( ( (tk(P26)) <= ( 0 ) ) | ( (tk(P24)) <= ( 0 ) ) ) )))
PROPERTY: Medical-PT-16-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P54)) <= (tk(P6)) )))
BK_STOP 1678685486469
--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 577 Killed ${SMART}/smart ${INPUT_SM}
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="Medical-PT-16"
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 Medical-PT-16, 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 r235-tall-167856422200710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-16.tgz
mv Medical-PT-16 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 '
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 ;