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

About the Execution of Smart+red for ShieldRVs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13484.352 3600000.00 3652706.00 676.70 FTFFFTTFFTFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979200126.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979200126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 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 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K 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 ShieldRVs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679379557600

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=ShieldRVs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 06:19:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 06:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:19:19] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-21 06:19:19] [INFO ] Transformed 1203 places.
[2023-03-21 06:19:19] [INFO ] Transformed 1353 transitions.
[2023-03-21 06:19:19] [INFO ] Found NUPN structural information;
[2023-03-21 06:19:19] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 15) seen :12
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-21 06:19:20] [INFO ] Computed 121 place invariants in 31 ms
[2023-03-21 06:19:21] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 06:19:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2023-03-21 06:19:22] [INFO ] After 878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 06:19:22] [INFO ] Deduced a trap composed of 18 places in 463 ms of which 19 ms to minimize.
[2023-03-21 06:19:23] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 1 ms to minimize.
[2023-03-21 06:19:23] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 2 ms to minimize.
[2023-03-21 06:19:23] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 2 ms to minimize.
[2023-03-21 06:19:24] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2023-03-21 06:19:24] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 1 ms to minimize.
[2023-03-21 06:19:25] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 0 ms to minimize.
[2023-03-21 06:19:25] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 1 ms to minimize.
[2023-03-21 06:19:25] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 1 ms to minimize.
[2023-03-21 06:19:26] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2023-03-21 06:19:26] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 1 ms to minimize.
[2023-03-21 06:19:26] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 1 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 1 ms to minimize.
[2023-03-21 06:19:27] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2023-03-21 06:19:28] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 0 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2023-03-21 06:19:29] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 0 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 0 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 1 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 0 ms to minimize.
[2023-03-21 06:19:30] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2023-03-21 06:19:31] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 1 ms to minimize.
[2023-03-21 06:19:31] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
[2023-03-21 06:19:31] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 0 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 1 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 1 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2023-03-21 06:19:32] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 4 ms to minimize.
[2023-03-21 06:19:33] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 1 ms to minimize.
[2023-03-21 06:19:34] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 1 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 0 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:19:35] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 0 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 1 ms to minimize.
[2023-03-21 06:19:36] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 14750 ms
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 1 ms to minimize.
[2023-03-21 06:19:37] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 17 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 2 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 0 ms to minimize.
[2023-03-21 06:19:38] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 1 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 1 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 1 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 2 ms to minimize.
[2023-03-21 06:19:39] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 1 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
[2023-03-21 06:19:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3182 ms
[2023-03-21 06:19:40] [INFO ] After 19168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-21 06:19:40] [INFO ] After 19814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 99 ms.
Support contains 7 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 1203 transition count 1236
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 1086 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 238 place count 1084 transition count 1234
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 238 place count 1084 transition count 1084
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 538 place count 934 transition count 1084
Discarding 205 places :
Symmetric choice reduction at 3 with 205 rule applications. Total rules 743 place count 729 transition count 879
Iterating global reduction 3 with 205 rules applied. Total rules applied 948 place count 729 transition count 879
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 948 place count 729 transition count 793
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1120 place count 643 transition count 793
Performed 212 Post agglomeration using F-continuation condition.Transition count delta: 212
Deduced a syphon composed of 212 places in 2 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 3 with 424 rules applied. Total rules applied 1544 place count 431 transition count 581
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 3 with 61 rules applied. Total rules applied 1605 place count 431 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1606 place count 430 transition count 580
Applied a total of 1606 rules in 482 ms. Remains 430 /1203 variables (removed 773) and now considering 580/1353 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 430/1203 places, 580/1353 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) 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 2) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 3039 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=276 )
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 22377 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 030B
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: 1203 places, 1353 transitions, 4320 arcs.
Final Score: 43715.741
Took : 42 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (! ( (tk(P1044)) <= (tk(P154)) )) & ( (tk(P603)) <= (tk(P845)) ) ) & ( ( (tk(P796)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P998)) )) & ( ( ( ( ( (tk(P16)) <= ( 1 ) ) & ( (tk(P431)) <= (tk(P181)) ) ) | (! ( (tk(P649)) <= ( 0 ) )) ) | ( (tk(P655)) <= (tk(P221)) ) ) | (! ( ( 1 ) <= (tk(P695)) )) ) ) ) ) | ( ( 1 ) <= (tk(P396)) ) ) | ( ( (tk(P989)) <= ( 0 ) ) | ( ( ( ( (! ( (! ( ( 1 ) <= (tk(P501)) )) & ( ( ( 1 ) <= (tk(P366)) ) & ( ( 1 ) <= (tk(P511)) ) ) )) & ( ( ( 1 ) <= (tk(P943)) ) | ( (! ( ( 1 ) <= (tk(P144)) )) & ( (tk(P346)) <= ( 1 ) ) ) ) ) | ( ( ( (tk(P271)) <= (tk(P974)) ) & ( (! ( (tk(P793)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P941)) )) ) ) & ( ( ( (tk(P784)) <= ( 1 ) ) | (! ( (tk(P605)) <= (tk(P1028)) )) ) | ( ( ( ( 1 ) <= (tk(P882)) ) | ( (tk(P410)) <= (tk(P356)) ) ) & (! ( (tk(P689)) <= ( 0 ) )) ) ) ) ) & ( (! ( ( (tk(P1186)) <= (tk(P722)) ) | ( (! ( (tk(P197)) <= (tk(P1066)) )) | ( ( (tk(P757)) <= (tk(P221)) ) & ( ( 1 ) <= (tk(P149)) ) ) ) )) & ( (! ( ( (tk(P717)) <= (tk(P1116)) ) & ( ( 1 ) <= (tk(P557)) ) )) | (! ( ( ( 1 ) <= (tk(P276)) ) | ( ( (tk(P913)) <= (tk(P299)) ) & ( (tk(P1091)) <= (tk(P11)) ) ) )) ) ) ) & ( (tk(P789)) <= ( 1 ) ) ) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-01 (reachable & potential(( ( ( 1 ) <= (tk(P833)) ) | ( ( 1 ) <= (tk(P197)) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-02 (reachable &!potential( ( (! ( ( (! ( ( ( (tk(P537)) <= ( 1 ) ) & ( ( (tk(P756)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P493)) ) ) ) | ( (tk(P539)) <= ( 1 ) ) )) | ( (! ( ( (tk(P870)) <= ( 0 ) ) | ( ( (tk(P68)) <= (tk(P827)) ) & ( (tk(P958)) <= (tk(P239)) ) ) )) & ( ( ( 1 ) <= (tk(P1026)) ) | ( ( ( (tk(P1159)) <= ( 1 ) ) & (! ( (tk(P1116)) <= (tk(P992)) )) ) | ( (tk(P773)) <= ( 0 ) ) ) ) ) ) | (! ( (tk(P483)) <= ( 1 ) )) )) | ( ( 1 ) <= (tk(P372)) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-03 (reachable &!potential( ( (! ( (tk(P135)) <= (tk(P683)) )) | ( ( ( ( ( ( ( ( ( (tk(P676)) <= ( 1 ) ) & ( (tk(P580)) <= (tk(P530)) ) ) | ( ( (tk(P820)) <= ( 1 ) ) & ( (tk(P705)) <= ( 1 ) ) ) ) & ( ( ( (tk(P667)) <= ( 1 ) ) | ( (tk(P548)) <= ( 1 ) ) ) | ( ( (tk(P50)) <= (tk(P889)) ) & ( (tk(P837)) <= ( 0 ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P324)) ) & ( ( (tk(P1194)) <= (tk(P781)) ) | ( (tk(P1152)) <= ( 0 ) ) ) ) | ( ( ( (tk(P307)) <= ( 1 ) ) | ( (tk(P1111)) <= (tk(P1170)) ) ) & ( ( ( 1 ) <= (tk(P496)) ) & ( (tk(P1039)) <= (tk(P758)) ) ) ) ) ) | ( (tk(P407)) <= (tk(P986)) ) ) | ( ( (tk(P1062)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P60)) ) ) ) & ( ( (tk(P566)) <= (tk(P356)) ) & ( ( (tk(P538)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P1030)) ) & ( ( ( 1 ) <= (tk(P1036)) ) & (! ( (tk(P116)) <= ( 0 ) )) ) ) ) ) ) & (! ( ( ( (! ( (tk(P748)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P100)) ) ) & ( ( ( (! ( (tk(P885)) <= ( 1 ) )) | ( (tk(P105)) <= ( 1 ) ) ) | (! ( ( (tk(P1014)) <= (tk(P620)) ) | ( (tk(P1166)) <= (tk(P300)) ) )) ) & (! ( ( ( (tk(P257)) <= (tk(P744)) ) | ( (tk(P902)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P396)) ) & ( ( 1 ) <= (tk(P766)) ) ) )) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P916)) ) & ( ( 1 ) <= (tk(P813)) ) ) | ( ( (tk(P731)) <= (tk(P1144)) ) | ( (tk(P249)) <= ( 0 ) ) ) )) | ( (! ( ( 1 ) <= (tk(P810)) )) & ( (tk(P616)) <= ( 0 ) ) ) ) )) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-04 (reachable &!potential( ( (! ( (! ( ( ( ( ( 1 ) <= (tk(P380)) ) & (! ( ( 1 ) <= (tk(P46)) )) ) & ( (! ( ( 1 ) <= (tk(P631)) )) | (! ( ( 1 ) <= (tk(P884)) )) ) ) | (! ( ( 1 ) <= (tk(P1048)) )) )) & (! ( (! ( ( ( ( 1 ) <= (tk(P906)) ) | ( (tk(P194)) <= ( 1 ) ) ) & (! ( (tk(P462)) <= ( 1 ) )) )) | (! ( ( 1 ) <= (tk(P715)) )) )) )) & ( ( (! ( ( ( (! ( (tk(P460)) <= ( 0 ) )) & (! ( (tk(P58)) <= (tk(P178)) )) ) & ( (! ( (tk(P490)) <= ( 1 ) )) & ( ( ( (tk(P203)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P67)) ) ) | (! ( (tk(P659)) <= (tk(P1095)) )) ) ) ) | ( ( (! ( (tk(P1163)) <= ( 0 ) )) | ( ( ( ( 1 ) <= (tk(P327)) ) & ( ( 1 ) <= (tk(P201)) ) ) & ( ( ( 1 ) <= (tk(P1197)) ) | ( (tk(P1021)) <= (tk(P157)) ) ) ) ) & (! ( ( ( 1 ) <= (tk(P1159)) ) | (! ( ( 1 ) <= (tk(P819)) )) )) ) )) | ( (tk(P336)) <= ( 0 ) ) ) & ( (tk(P734)) <= (tk(P6)) ) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P572)) <= ( 1 ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P227)) <= (tk(P906)) ))))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P824)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P660)) )) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P533)) <= (tk(P97)) ) & ( (! ( (! ( ( (tk(P961)) <= (tk(P698)) ) | (! ( ( 1 ) <= (tk(P259)) )) )) | ( ( 1 ) <= (tk(P828)) ) )) | ( ( (! ( (! ( (! ( (tk(P472)) <= ( 1 ) )) & ( ( (tk(P293)) <= ( 1 ) ) & ( (tk(P699)) <= (tk(P831)) ) ) )) | ( ( 1 ) <= (tk(P1128)) ) )) | ( ( ( (tk(P401)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P911)) ) ) & ( ( ( ( ( (tk(P93)) <= (tk(P256)) ) | ( (tk(P218)) <= (tk(P67)) ) ) | (! ( (tk(P859)) <= (tk(P297)) )) ) & (! ( ( ( 1 ) <= (tk(P1134)) ) & ( (tk(P285)) <= ( 0 ) ) )) ) & ( ( (tk(P970)) <= (tk(P369)) ) & ( ( ( ( 1 ) <= (tk(P683)) ) | ( (tk(P1180)) <= ( 0 ) ) ) | (! ( (tk(P330)) <= ( 0 ) )) ) ) ) ) ) & ( (tk(P482)) <= (tk(P210)) ) ) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-09 (reachable & potential(( ( (! ( (tk(P300)) <= (tk(P428)) )) & (! ( (! ( (tk(P997)) <= (tk(P662)) )) | ( ( ( (tk(P637)) <= ( 1 ) ) | ( ( (! ( (tk(P982)) <= ( 1 ) )) & ( ( (tk(P1066)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P1026)) ) ) ) & (! ( ( 1 ) <= (tk(P189)) )) ) ) & (! ( (tk(P1051)) <= ( 1 ) )) ) )) ) & ( ( 1 ) <= (tk(P615)) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P373)) <= (tk(P534)) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P86)) <= (tk(P1049)) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-12 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P125)) )) | (! ( ( 1 ) <= (tk(P136)) )) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-13 (reachable &!potential( ( ( (tk(P74)) <= (tk(P279)) ) & ( ( ( (tk(P100)) <= ( 1 ) ) & ( ( ( ( ( (tk(P22)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P1166)) ) | ( ( (tk(P75)) <= (tk(P279)) ) | ( (tk(P1038)) <= (tk(P882)) ) ) ) ) & ( ( (! ( (tk(P179)) <= ( 0 ) )) | ( ( (tk(P1072)) <= (tk(P728)) ) | ( ( 1 ) <= (tk(P675)) ) ) ) | ( ( ( (tk(P351)) <= ( 0 ) ) & ( (tk(P456)) <= (tk(P826)) ) ) & ( ( ( 1 ) <= (tk(P418)) ) | ( ( 1 ) <= (tk(P1181)) ) ) ) ) ) | ( (! ( (tk(P439)) <= ( 1 ) )) & ( ( (tk(P37)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P57)) ) | ( (tk(P194)) <= (tk(P846)) ) ) & ( (tk(P621)) <= ( 0 ) ) ) ) ) ) & (! ( (! ( ( 1 ) <= (tk(P993)) )) | (! ( ( ( (tk(P343)) <= (tk(P942)) ) & ( (tk(P1039)) <= ( 1 ) ) ) & ( (tk(P139)) <= ( 0 ) ) )) )) ) ) | ( ( ( (tk(P692)) <= (tk(P433)) ) | ( (tk(P56)) <= (tk(P49)) ) ) | ( ( ( 1 ) <= (tk(P489)) ) & ( ( 1 ) <= (tk(P515)) ) ) ) ) )))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-14 (reachable & potential((! ( (tk(P876)) <= ( 0 ) ))))
PROPERTY: ShieldRVs-PT-030B-ReachabilityCardinality-15 (reachable & potential(( ( (! ( ( ( (tk(P1)) <= ( 0 ) ) & ( ( ( ( ( ( 1 ) <= (tk(P128)) ) & ( (tk(P812)) <= ( 0 ) ) ) | ( ( (tk(P389)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P623)) ) ) ) | ( ( ( ( 1 ) <= (tk(P361)) ) | ( (tk(P3)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P1054)) ) ) ) & ( ( (tk(P960)) <= (tk(P367)) ) & ( (tk(P847)) <= ( 0 ) ) ) ) ) & (! ( (! ( ( ( ( 1 ) <= (tk(P207)) ) & ( ( 1 ) <= (tk(P12)) ) ) | ( ( (tk(P952)) <= (tk(P1173)) ) & ( ( 1 ) <= (tk(P60)) ) ) )) & ( (tk(P808)) <= ( 1 ) ) )) )) | (! ( (tk(P2)) <= (tk(P509)) )) ) & ( ( ( 1 ) <= (tk(P511)) ) | (! ( (! ( ( (! ( ( ( 1 ) <= (tk(P412)) ) & ( (tk(P447)) <= (tk(P872)) ) )) | ( ( ( (tk(P134)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P770)) ) ) | ( ( (tk(P997)) <= (tk(P214)) ) & ( ( 1 ) <= (tk(P348)) ) ) ) ) & (! ( ( ( (tk(P945)) <= ( 0 ) ) & ( (tk(P1174)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P707)) )) )) )) | ( ( ( (tk(P261)) <= ( 1 ) ) | (! ( ( (tk(P780)) <= (tk(P97)) ) & ( ( ( 1 ) <= (tk(P41)) ) | ( (tk(P996)) <= (tk(P899)) ) ) )) ) & ( ( ( 1 ) <= (tk(P184)) ) | (! ( ( ( ( 1 ) <= (tk(P949)) ) | ( (tk(P1084)) <= (tk(P1132)) ) ) & ( ( (tk(P199)) <= ( 0 ) ) & ( (tk(P221)) <= (tk(P1130)) ) ) )) ) ) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 2664744 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16106332 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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 r427-tajo-167905979200126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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