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

About the Execution of Smart+red for ShieldIIPs-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
447.128 12389.00 24836.00 24.90 TTFTFTFTTTTTTTTF 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.r395-oct2-167903718300030.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-002B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718300030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 33K 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 ShieldIIPs-PT-002B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679552741931

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=ShieldIIPs-PT-002B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 06:25:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 06:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:25:44] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-23 06:25:44] [INFO ] Transformed 123 places.
[2023-03-23 06:25:44] [INFO ] Transformed 121 transitions.
[2023-03-23 06:25:44] [INFO ] Found NUPN structural information;
[2023-03-23 06:25:44] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 28 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 11) seen :8
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 123 cols
[2023-03-23 06:25:44] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-23 06:25:44] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 06:25:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-23 06:25:45] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 4 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 457 ms
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-23 06:25:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 67 ms
[2023-03-23 06:25:45] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-23 06:25:45] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 121/121 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 3 place count 123 transition count 118
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 120 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 118 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 118 transition count 106
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 108 transition count 106
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 38 place count 100 transition count 98
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 100 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 100 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 99 transition count 97
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 88 place count 79 transition count 77
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 79 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 78 transition count 76
Applied a total of 99 rules in 40 ms. Remains 78 /123 variables (removed 45) and now considering 76/121 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 78/123 places, 76/121 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2734788 steps, run timeout after 3001 ms. (steps per millisecond=911 ) properties seen :{}
Probabilistic random walk after 2734788 steps, saw 517783 distinct states, run finished after 3010 ms. (steps per millisecond=908 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 78 cols
[2023-03-23 06:25:48] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-23 06:25:49] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 06:25:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-23 06:25:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 06:25:49] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-23 06:25:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-23 06:25:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-23 06:25:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-23 06:25:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2023-03-23 06:25:49] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-23 06:25:49] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 78/78 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-23 06:25:49] [INFO ] Invariant cache hit.
[2023-03-23 06:25:49] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-23 06:25:49] [INFO ] Invariant cache hit.
[2023-03-23 06:25:49] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-23 06:25:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 06:25:49] [INFO ] Invariant cache hit.
[2023-03-23 06:25:49] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 06:25:49] [INFO ] Invariant cache hit.
[2023-03-23 06:25:50] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 06:25:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-23 06:25:50] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-23 06:25:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 346 ms
[2023-03-23 06:25:50] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-23 06:25:50] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 06:25:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-23 06:25:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 76 transitions and 290 arcs took 2 ms.
[2023-03-23 06:25:50] [INFO ] Flatten gal took : 49 ms
Total runtime 6680 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 002B
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: 78 places, 76 transitions, 290 arcs.
Final Score: 645.907
Took : 2 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-002B-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( (tk(P67)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P67)) ) ) | ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) ) | ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) | ( ( ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) | ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) & ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( ( (tk(P61)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P61)) ) ) | ( ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) & ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) ) ) ) | ( ( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) | ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) ) & ( ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) | ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) | ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) ) | ( ( ( (tk(P22)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P22)) ) ) | ( ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) & ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) ) | ( ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) & ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) | ( ( (tk(P46)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P46)) ) ) ) ) & ( ( ( ( (tk(P36)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P36)) ) ) | ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) & ( ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) & ( ( (tk(P9)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P9)) ) ) ) ) ) & ( ( ( (tk(P73)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P73)) ) ) | ( ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) | ( ( (tk(P26)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P26)) ) ) ) ) ) ) ) ) ) ) ) ) )))
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679552754320

--------------------
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

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="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, 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 r395-oct2-167903718300030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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