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-167903718600286.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 ShieldIIPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718600286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679560624769

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=ShieldIIPt-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:37:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 08:37:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:37:07] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-23 08:37:07] [INFO ] Transformed 1403 places.
[2023-03-23 08:37:07] [INFO ] Transformed 1303 transitions.
[2023-03-23 08:37:07] [INFO ] Found NUPN structural information;
[2023-03-23 08:37:07] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 12) seen :5
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-23 08:37:08] [INFO ] Computed 181 place invariants in 16 ms
[2023-03-23 08:37:09] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 08:37:09] [INFO ] [Nat]Absence check using 181 positive place invariants in 77 ms returned sat
[2023-03-23 08:37:10] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-23 08:37:11] [INFO ] Deduced a trap composed of 22 places in 429 ms of which 7 ms to minimize.
[2023-03-23 08:37:11] [INFO ] Deduced a trap composed of 18 places in 455 ms of which 1 ms to minimize.
[2023-03-23 08:37:12] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 1 ms to minimize.
[2023-03-23 08:37:12] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 1 ms to minimize.
[2023-03-23 08:37:13] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 1 ms to minimize.
[2023-03-23 08:37:13] [INFO ] Deduced a trap composed of 34 places in 482 ms of which 1 ms to minimize.
[2023-03-23 08:37:14] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 1 ms to minimize.
[2023-03-23 08:37:14] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 0 ms to minimize.
[2023-03-23 08:37:14] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 1 ms to minimize.
[2023-03-23 08:37:15] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 0 ms to minimize.
[2023-03-23 08:37:15] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 1 ms to minimize.
[2023-03-23 08:37:15] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 1 ms to minimize.
[2023-03-23 08:37:16] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 1 ms to minimize.
[2023-03-23 08:37:16] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 1 ms to minimize.
[2023-03-23 08:37:16] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 4 ms to minimize.
[2023-03-23 08:37:17] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2023-03-23 08:37:17] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2023-03-23 08:37:17] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 2 ms to minimize.
[2023-03-23 08:37:18] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2023-03-23 08:37:18] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 0 ms to minimize.
[2023-03-23 08:37:19] [INFO ] Deduced a trap composed of 24 places in 537 ms of which 1 ms to minimize.
[2023-03-23 08:37:19] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2023-03-23 08:37:19] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2023-03-23 08:37:19] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 0 ms to minimize.
[2023-03-23 08:37:20] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2023-03-23 08:37:20] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 1 ms to minimize.
[2023-03-23 08:37:20] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-23 08:37:20] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2023-03-23 08:37:21] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 1 ms to minimize.
[2023-03-23 08:37:21] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
[2023-03-23 08:37:21] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-23 08:37:21] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 1 ms to minimize.
[2023-03-23 08:37:22] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 0 ms to minimize.
[2023-03-23 08:37:22] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 16 ms to minimize.
[2023-03-23 08:37:22] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2023-03-23 08:37:22] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2023-03-23 08:37:23] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2023-03-23 08:37:24] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2023-03-23 08:37:24] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 0 ms to minimize.
[2023-03-23 08:37:24] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 9 ms to minimize.
[2023-03-23 08:37:24] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-23 08:37:24] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2023-03-23 08:37:25] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 14180 ms
[2023-03-23 08:37:25] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2023-03-23 08:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-23 08:37:25] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2023-03-23 08:37:25] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2023-03-23 08:37:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2023-03-23 08:37:26] [INFO ] After 16849ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-23 08:37:27] [INFO ] After 18033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 376 ms.
Support contains 12 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1403 transition count 970
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 335 rules applied. Total rules applied 668 place count 1070 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 669 place count 1069 transition count 968
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 669 place count 1069 transition count 886
Deduced a syphon composed of 82 places in 3 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 833 place count 987 transition count 886
Discarding 135 places :
Symmetric choice reduction at 3 with 135 rule applications. Total rules 968 place count 852 transition count 751
Iterating global reduction 3 with 135 rules applied. Total rules applied 1103 place count 852 transition count 751
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1103 place count 852 transition count 693
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1219 place count 794 transition count 693
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1893 place count 457 transition count 356
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 2007 place count 400 transition count 392
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2008 place count 400 transition count 391
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2011 place count 400 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2014 place count 397 transition count 388
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2035 place count 397 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2036 place count 396 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2038 place count 394 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2038 place count 394 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2040 place count 393 transition count 386
Applied a total of 2040 rules in 316 ms. Remains 393 /1403 variables (removed 1010) and now considering 386/1303 (removed 917) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 393/1403 places, 386/1303 transitions.
Finished random walk after 7925 steps, including 2 resets, run visited all 6 properties in 59 ms. (steps per millisecond=134 )
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20629 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 020B
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: 1403 places, 1303 transitions, 3246 arcs.
Final Score: 66895.503
Took : 35 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P364)) <= ( 1 ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-01 (reachable &!potential( (! ( ( (! ( ( ( ( ( ( 1 ) <= (tk(P221)) ) | ( ( ( 1 ) <= (tk(P807)) ) | ( (tk(P590)) <= ( 1 ) ) ) ) | ( ( ( 1 ) <= (tk(P323)) ) | (! ( (tk(P442)) <= (tk(P971)) )) ) ) | ( ( ( ( 1 ) <= (tk(P341)) ) & ( (tk(P949)) <= ( 0 ) ) ) & (! ( ( (tk(P1051)) <= ( 0 ) ) & ( (tk(P541)) <= ( 0 ) ) )) ) ) & (! ( (tk(P325)) <= ( 0 ) )) )) | ( ( ( (! ( ( (tk(P1046)) <= ( 1 ) ) | ( (tk(P697)) <= ( 0 ) ) )) & ( ( (tk(P131)) <= ( 1 ) ) | ( (tk(P156)) <= ( 1 ) ) ) ) | ( (tk(P889)) <= (tk(P657)) ) ) & ( ( 1 ) <= (tk(P300)) ) ) ) & (! ( ( (tk(P746)) <= (tk(P27)) ) & ( (tk(P825)) <= (tk(P1265)) ) )) ))))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P1172)) <= ( 0 ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-03 (reachable &!potential( (! ( (! ( ( ( 1 ) <= (tk(P1313)) ) & ( ( ( ( ( (tk(P889)) <= (tk(P319)) ) & ( (tk(P71)) <= (tk(P857)) ) ) & ( ( ( 1 ) <= (tk(P956)) ) & ( (tk(P68)) <= (tk(P911)) ) ) ) & ( (! ( (tk(P1192)) <= (tk(P680)) )) | ( ( ( 1 ) <= (tk(P830)) ) | ( ( 1 ) <= (tk(P195)) ) ) ) ) | ( ( ( (tk(P1075)) <= (tk(P952)) ) | (! ( (tk(P18)) <= ( 1 ) )) ) | ( ( (tk(P1127)) <= ( 1 ) ) | ( (tk(P576)) <= ( 1 ) ) ) ) ) )) & ( ( ( ( ( (tk(P913)) <= (tk(P1002)) ) | ( (tk(P669)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P688)) ) ) & ( ( ( ( ( 1 ) <= (tk(P314)) ) & ( ( 1 ) <= (tk(P1116)) ) ) & (! ( ( 1 ) <= (tk(P302)) )) ) & ( (! ( (tk(P1030)) <= (tk(P364)) )) | ( ( ( (tk(P1365)) <= (tk(P167)) ) | ( (tk(P336)) <= ( 1 ) ) ) & ( ( (tk(P1399)) <= (tk(P288)) ) | ( (tk(P93)) <= (tk(P392)) ) ) ) ) ) ) | ( ( (! ( ( (tk(P90)) <= ( 1 ) ) | (! ( ( 1 ) <= (tk(P831)) )) )) | ( (tk(P1170)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P828)) ) ) ) ))))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-04 (reachable &!potential( (! ( ( (tk(P968)) <= ( 1 ) ) & ( (! ( (! ( ( ( ( (tk(P694)) <= (tk(P1040)) ) | ( (tk(P505)) <= (tk(P1316)) ) ) | ( ( (tk(P537)) <= ( 1 ) ) & ( (tk(P683)) <= (tk(P641)) ) ) ) | ( (! ( ( 1 ) <= (tk(P473)) )) | ( ( 1 ) <= (tk(P41)) ) ) )) | ( (! ( ( ( ( 1 ) <= (tk(P632)) ) & ( ( 1 ) <= (tk(P261)) ) ) | ( ( (tk(P370)) <= ( 0 ) ) & ( (tk(P744)) <= (tk(P1091)) ) ) )) & (! ( (tk(P275)) <= ( 0 ) )) ) )) & (! ( (! ( (! ( (tk(P912)) <= ( 1 ) )) | ( ( ( ( 1 ) <= (tk(P8)) ) & ( ( 1 ) <= (tk(P593)) ) ) & ( (tk(P341)) <= ( 0 ) ) ) )) | ( (tk(P1234)) <= (tk(P502)) ) )) ) ))))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P721)) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-06 (reachable & potential(( ( 1 ) <= (tk(P154)) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P181)) <= ( 1 ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P121)) <= (tk(P1313)) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-09 (reachable &!potential( (! ( ( 1 ) <= (tk(P691)) ))))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P1121)) <= ( 1 ) ) | ( ( ( ( (tk(P965)) <= (tk(P1087)) ) & ( ( (! ( (tk(P91)) <= ( 1 ) )) & (! ( (! ( ( 1 ) <= (tk(P998)) )) & ( (tk(P427)) <= ( 0 ) ) )) ) & (! ( ( 1 ) <= (tk(P369)) )) ) ) | (! ( ( (! ( ( (tk(P218)) <= ( 0 ) ) | ( ( (tk(P1129)) <= ( 0 ) ) & ( (tk(P1069)) <= ( 1 ) ) ) )) | ( ( ( (tk(P670)) <= (tk(P863)) ) & ( ( 1 ) <= (tk(P320)) ) ) | ( (tk(P819)) <= ( 1 ) ) ) ) | (! ( ( 1 ) <= (tk(P631)) )) )) ) | (! ( ( ( 1 ) <= (tk(P881)) ) & ( (tk(P896)) <= (tk(P1206)) ) )) ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-11 (reachable & potential(( ( ( (tk(P182)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P544)) ) ) & ( (! ( (tk(P409)) <= (tk(P774)) )) | ( ( (tk(P523)) <= (tk(P425)) ) | ( ( 1 ) <= (tk(P149)) ) ) ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-12 (reachable & potential(( ( 1 ) <= (tk(P499)) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P199)) <= ( 0 ) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-14 (reachable & potential(( ( 1 ) <= (tk(P55)) )))
PROPERTY: ShieldIIPt-PT-020B-ReachabilityCardinality-15 (reachable & potential((! ( ( ( ( ( ( 1 ) <= (tk(P1068)) ) & ( (tk(P169)) <= (tk(P482)) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P549)) ) | ( (tk(P850)) <= ( 0 ) ) ) & (! ( (tk(P572)) <= (tk(P245)) )) ) & ( (! ( (tk(P253)) <= ( 0 ) )) | ( (tk(P1293)) <= (tk(P511)) ) ) ) & ( ( 1 ) <= (tk(P534)) ) ) ) | (! ( ( (tk(P88)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P691)) ) | ( (tk(P958)) <= (tk(P645)) ) ) & ( (tk(P785)) <= (tk(P90)) ) ) )) ) | (! ( (! ( (tk(P139)) <= ( 1 ) )) & ( ( ( (! ( ( 1 ) <= (tk(P376)) )) & ( ( (tk(P517)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P504)) ) ) ) & ( ( (tk(P1208)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P619)) ) ) ) | ( ( ( ( (tk(P848)) <= (tk(P847)) ) | ( (tk(P866)) <= ( 0 ) ) ) & ( ( (tk(P129)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1090)) ) ) ) | ( ( 1 ) <= (tk(P325)) ) ) ) )) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7705132 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16104064 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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-167903718600286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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