fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for Murphy-PT-D1N010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
290.483 9195.00 19025.00 344.20 TTTFFTFTFTFFTTFF 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.r523-tall-167987247900334.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 Murphy-PT-D1N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247900334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.6K Mar 31 16:48 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 Murphy-PT-D1N010-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680837438172

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=Murphy-PT-D1N010
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 03:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:17:20] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-07 03:17:20] [INFO ] Transformed 12 places.
[2023-04-07 03:17:20] [INFO ] Transformed 14 transitions.
[2023-04-07 03:17:20] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10010 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 13) seen :2
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 14 rows 12 cols
[2023-04-07 03:17:21] [INFO ] Computed 3 invariants in 10 ms
[2023-04-07 03:17:21] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-04-07 03:17:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-07 03:17:21] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 03:17:21] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-04-07 03:17:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 03:17:21] [INFO ] After 53ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-04-07 03:17:21] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 03:17:21] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 03:17:22] [INFO ] Invariant cache hit.
[2023-04-07 03:17:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 12/12 places, 14/14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 929 ms. (steps per millisecond=331 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 576 ms. (steps per millisecond=534 ) properties seen :0
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 4191 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Murphy (PT), instance D1N010
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: 12 places, 14 transitions, 54 arcs.
Final Score: 41.052
Took : 0 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-00 (reachable &!potential( ( ( (! ( ( 10 ) <= (tk(P8)) )) | (! ( (! ( ( (! ( ( (tk(P6)) <= ( 8 ) ) | ( ( 8 ) <= (tk(P5)) ) )) | ( (tk(P11)) <= ( 3 ) ) ) & (! ( (! ( ( 8 ) <= (tk(P6)) )) | (! ( ( 6 ) <= (tk(P10)) )) )) )) & ( ( 9 ) <= (tk(P1)) ) )) ) & ( (! ( ( ( ( 5 ) <= (tk(P4)) ) & (! ( ( ( ( (tk(P1)) <= (tk(P9)) ) | ( (tk(P4)) <= ( 7 ) ) ) | ( (tk(P2)) <= ( 6 ) ) ) & (! ( (tk(P1)) <= ( 3 ) )) )) ) & ( (! ( (tk(P7)) <= (tk(P4)) )) & ( ( 5 ) <= (tk(P1)) ) ) )) | ( ( ( (tk(P6)) <= ( 8 ) ) | ( ( ( 10 ) <= (tk(P1)) ) & ( ( ( ( 3 ) <= (tk(P7)) ) | (! ( ( 8 ) <= (tk(P5)) )) ) | ( (tk(P1)) <= ( 3 ) ) ) ) ) | (! ( ( (! ( ( ( 10 ) <= (tk(P7)) ) & ( (tk(P8)) <= (tk(P12)) ) )) & ( (tk(P10)) <= (tk(P10)) ) ) & ( ( (! ( (tk(P12)) <= (tk(P9)) )) & (! ( ( 2 ) <= (tk(P5)) )) ) | ( ( ( ( ( 3 ) <= (tk(P12)) ) & ( (tk(P1)) <= (tk(P2)) ) ) | ( ( (tk(P8)) <= (tk(P12)) ) & ( (tk(P11)) <= (tk(P10)) ) ) ) | (! ( (tk(P3)) <= ( 10 ) )) ) ) )) ) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P6)) <= (tk(P6)) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-02 (reachable & potential((! ( ( ( (tk(P9)) <= (tk(P3)) ) & (! ( ( ( ( (tk(P9)) <= ( 9 ) ) | ( (tk(P7)) <= ( 10 ) ) ) & ( (tk(P12)) <= (tk(P4)) ) ) & (! ( ( ( 3 ) <= (tk(P5)) ) | ( ( 4 ) <= (tk(P3)) ) )) )) ) | ( (tk(P1)) <= ( 8 ) ) ))))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-03 (reachable & potential(( ( 7 ) <= (tk(P12)) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-04 (reachable & potential((! ( ( ( ( ( (tk(P8)) <= (tk(P8)) ) & ( ( ( 6 ) <= (tk(P4)) ) & ( ( ( (tk(P11)) <= (tk(P5)) ) & ( ( 8 ) <= (tk(P1)) ) ) | ( ( ( (tk(P1)) <= (tk(P8)) ) | ( (tk(P6)) <= (tk(P1)) ) ) & ( ( (tk(P6)) <= ( 9 ) ) | ( (tk(P3)) <= ( 1 ) ) ) ) ) ) ) & ( (! ( ( 7 ) <= (tk(P2)) )) | ( (tk(P11)) <= ( 3 ) ) ) ) & ( ( ( (tk(P4)) <= ( 2 ) ) | ( (! ( ( ( (tk(P1)) <= (tk(P9)) ) | ( ( 4 ) <= (tk(P8)) ) ) & (! ( ( 10 ) <= (tk(P10)) )) )) & ( (! ( ( ( 8 ) <= (tk(P11)) ) | ( (tk(P8)) <= ( 10 ) ) )) | ( ( ( ( 5 ) <= (tk(P8)) ) & ( (tk(P10)) <= ( 0 ) ) ) | ( ( (tk(P2)) <= ( 6 ) ) & ( (tk(P10)) <= (tk(P12)) ) ) ) ) ) ) | (! ( ( ( ( ( ( 5 ) <= (tk(P6)) ) | ( (tk(P12)) <= ( 5 ) ) ) & (! ( (tk(P10)) <= (tk(P3)) )) ) | (! ( ( 7 ) <= (tk(P7)) )) ) | ( ( ( (tk(P7)) <= (tk(P11)) ) | ( ( ( 2 ) <= (tk(P9)) ) & ( (tk(P4)) <= (tk(P3)) ) ) ) & (! ( (tk(P7)) <= ( 9 ) )) ) )) ) ) | (! ( ( ( ( (! ( ( ( 2 ) <= (tk(P8)) ) & ( (tk(P3)) <= (tk(P1)) ) )) | ( (! ( (tk(P5)) <= ( 7 ) )) | ( (tk(P12)) <= ( 2 ) ) ) ) & (! ( (tk(P8)) <= ( 3 ) )) ) & ( (! ( ( ( (tk(P8)) <= (tk(P4)) ) & ( (tk(P10)) <= ( 9 ) ) ) & ( (tk(P9)) <= ( 3 ) ) )) & ( (! ( ( 5 ) <= (tk(P12)) )) | ( ( ( ( 1 ) <= (tk(P1)) ) & ( ( 3 ) <= (tk(P11)) ) ) | (! ( (tk(P7)) <= ( 9 ) )) ) ) ) ) & ( (! ( ( (tk(P9)) <= ( 8 ) ) & ( ( ( (tk(P11)) <= (tk(P1)) ) & ( ( 5 ) <= (tk(P11)) ) ) | ( ( (tk(P5)) <= (tk(P7)) ) | ( (tk(P7)) <= (tk(P5)) ) ) ) )) & (! ( ( (tk(P9)) <= ( 4 ) ) & ( ( ( (tk(P8)) <= ( 5 ) ) | ( (tk(P2)) <= ( 7 ) ) ) | ( ( (tk(P12)) <= ( 10 ) ) | ( (tk(P5)) <= (tk(P4)) ) ) ) )) ) )) ))))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-05 (reachable &!potential( ( (! ( ( 6 ) <= (tk(P1)) )) | ( ( ( ( ( ( (tk(P3)) <= ( 2 ) ) | ( ( 7 ) <= (tk(P7)) ) ) | (! ( (tk(P9)) <= (tk(P9)) )) ) | ( (tk(P8)) <= ( 10 ) ) ) | ( (! ( ( (! ( ( (tk(P4)) <= (tk(P4)) ) & ( (tk(P12)) <= ( 3 ) ) )) | (! ( (tk(P11)) <= ( 2 ) )) ) | ( ( 6 ) <= (tk(P3)) ) )) | ( (tk(P12)) <= ( 9 ) ) ) ) | ( ( ( (! ( (tk(P12)) <= (tk(P10)) )) & ( ( (tk(P11)) <= (tk(P5)) ) | (! ( ( ( (tk(P11)) <= ( 1 ) ) & ( (tk(P2)) <= (tk(P1)) ) ) & ( ( (tk(P8)) <= ( 4 ) ) | ( (tk(P9)) <= (tk(P9)) ) ) )) ) ) | ( (! ( (tk(P9)) <= (tk(P6)) )) & ( ( 2 ) <= (tk(P2)) ) ) ) | (! ( ( 10 ) <= (tk(P9)) )) ) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-06 (reachable & potential(( ( ( 10 ) <= (tk(P10)) ) & ( (! ( ( (! ( (! ( ( (tk(P9)) <= (tk(P6)) ) | ( ( 3 ) <= (tk(P2)) ) )) & (! ( ( (tk(P6)) <= ( 8 ) ) | ( (tk(P3)) <= ( 3 ) ) )) )) | ( (tk(P2)) <= ( 6 ) ) ) | (! ( ( ( ( ( (tk(P2)) <= (tk(P3)) ) & ( (tk(P3)) <= ( 5 ) ) ) & ( (tk(P2)) <= (tk(P1)) ) ) | ( (tk(P3)) <= (tk(P1)) ) ) | ( (tk(P5)) <= ( 2 ) ) )) )) & ( ( ( ( (tk(P1)) <= (tk(P7)) ) & ( (tk(P2)) <= (tk(P5)) ) ) & ( ( ( ( (! ( ( 5 ) <= (tk(P3)) )) & ( ( (tk(P7)) <= (tk(P7)) ) | ( (tk(P7)) <= (tk(P1)) ) ) ) | ( (tk(P12)) <= (tk(P12)) ) ) | ( ( ( ( (tk(P7)) <= ( 9 ) ) & ( (tk(P5)) <= ( 2 ) ) ) | (! ( ( 1 ) <= (tk(P4)) )) ) & ( ( (tk(P10)) <= (tk(P3)) ) & ( ( 3 ) <= (tk(P11)) ) ) ) ) | ( (tk(P3)) <= ( 3 ) ) ) ) | ( (tk(P9)) <= ( 4 ) ) ) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-07 (reachable &!potential( (! ( ( 9 ) <= (tk(P8)) ))))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-08 (reachable & potential((! ( (tk(P11)) <= ( 9 ) ))))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-09 (reachable &!potential( ( ( ( ( (! ( (! ( ( ( (tk(P7)) <= (tk(P2)) ) | ( (tk(P2)) <= ( 5 ) ) ) & (! ( (tk(P12)) <= (tk(P10)) )) )) | (! ( ( ( 1 ) <= (tk(P11)) ) & ( (tk(P5)) <= ( 6 ) ) )) )) & ( ( ( ( ( 8 ) <= (tk(P1)) ) & (! ( ( ( 8 ) <= (tk(P2)) ) | ( ( 4 ) <= (tk(P12)) ) )) ) | ( ( 7 ) <= (tk(P4)) ) ) | (! ( ( ( ( ( 7 ) <= (tk(P10)) ) | ( (tk(P6)) <= ( 2 ) ) ) | ( ( ( 8 ) <= (tk(P12)) ) & ( ( 4 ) <= (tk(P10)) ) ) ) | (! ( ( (tk(P12)) <= (tk(P8)) ) | ( (tk(P4)) <= (tk(P3)) ) )) )) ) ) | (! ( ( 5 ) <= (tk(P8)) )) ) | ( ( ( (tk(P3)) <= ( 9 ) ) & ( ( ( (! ( (tk(P6)) <= (tk(P10)) )) | ( ( (tk(P1)) <= (tk(P2)) ) & (! ( (tk(P10)) <= (tk(P8)) )) ) ) | ( (! ( ( ( 2 ) <= (tk(P5)) ) | ( (tk(P4)) <= ( 10 ) ) )) | ( ( (tk(P12)) <= ( 9 ) ) | ( (tk(P4)) <= (tk(P8)) ) ) ) ) | ( (tk(P10)) <= (tk(P6)) ) ) ) | (! ( (! ( (! ( (tk(P8)) <= ( 1 ) )) & ( ( (tk(P8)) <= (tk(P10)) ) & ( ( 4 ) <= (tk(P6)) ) ) )) | ( ( ( ( 7 ) <= (tk(P2)) ) & ( ( 2 ) <= (tk(P4)) ) ) & (! ( ( (tk(P2)) <= (tk(P4)) ) | ( (tk(P10)) <= ( 8 ) ) )) ) )) ) ) | ( ( (! ( ( (tk(P11)) <= (tk(P11)) ) | (! ( ( 5 ) <= (tk(P9)) )) )) & (! ( ( (! ( (tk(P10)) <= (tk(P4)) )) & ( ( (tk(P5)) <= ( 4 ) ) | ( (tk(P8)) <= ( 6 ) ) ) ) & (! ( ( (tk(P4)) <= (tk(P6)) ) | ( (tk(P12)) <= ( 10 ) ) )) )) ) | ( (! ( (tk(P10)) <= ( 10 ) )) | (! ( (! ( ( (tk(P7)) <= (tk(P3)) ) | ( ( 1 ) <= (tk(P10)) ) )) & ( (tk(P2)) <= ( 8 ) ) )) ) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( ( (tk(P7)) <= (tk(P2)) ) | ( ( (tk(P3)) <= ( 4 ) ) & ( ( ( ( ( 8 ) <= (tk(P3)) ) | ( ( (tk(P5)) <= ( 0 ) ) | ( (tk(P5)) <= (tk(P6)) ) ) ) & ( ( ( ( 5 ) <= (tk(P11)) ) & ( (tk(P3)) <= (tk(P7)) ) ) | ( ( (tk(P12)) <= ( 3 ) ) | ( ( 10 ) <= (tk(P7)) ) ) ) ) & ( ( ( ( (tk(P11)) <= ( 3 ) ) | ( ( 1 ) <= (tk(P2)) ) ) & ( ( (tk(P6)) <= ( 2 ) ) & ( (tk(P2)) <= ( 6 ) ) ) ) | (! ( (tk(P6)) <= (tk(P2)) )) ) ) ) ) & (! ( ( ( ( ( (tk(P8)) <= ( 2 ) ) & (! ( (tk(P2)) <= ( 10 ) )) ) | ( (! ( (tk(P6)) <= (tk(P7)) )) | ( ( (tk(P8)) <= ( 4 ) ) & ( ( 9 ) <= (tk(P2)) ) ) ) ) & ( ( ( ( (tk(P9)) <= (tk(P7)) ) & ( ( 10 ) <= (tk(P10)) ) ) & ( ( ( 4 ) <= (tk(P1)) ) & ( (tk(P10)) <= (tk(P11)) ) ) ) | (! ( (tk(P1)) <= ( 9 ) )) ) ) & ( ( (! ( ( (tk(P10)) <= (tk(P3)) ) | ( ( 1 ) <= (tk(P9)) ) )) | ( ( 2 ) <= (tk(P2)) ) ) & ( (tk(P12)) <= (tk(P3)) ) ) )) ) | ( (tk(P6)) <= ( 4 ) ) ) & ( (tk(P7)) <= (tk(P7)) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-11 (reachable & potential(( ( ( ( 2 ) <= (tk(P11)) ) & ( ( ( (tk(P10)) <= ( 5 ) ) | ( ( (! ( ( ( ( 6 ) <= (tk(P8)) ) & ( (tk(P11)) <= ( 3 ) ) ) | ( (tk(P10)) <= (tk(P11)) ) )) | ( (! ( (tk(P9)) <= ( 8 ) )) & ( ( 6 ) <= (tk(P5)) ) ) ) | ( (tk(P9)) <= ( 8 ) ) ) ) | ( ( 6 ) <= (tk(P7)) ) ) ) & (! ( (tk(P7)) <= ( 1 ) )) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P11)) <= ( 4 ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-13 (reachable &!potential( ( ( (! ( (! ( ( ( (tk(P7)) <= (tk(P12)) ) & ( (tk(P2)) <= ( 9 ) ) ) & ( ( 3 ) <= (tk(P3)) ) )) | ( ( (tk(P8)) <= ( 7 ) ) | ( ( ( (! ( (tk(P1)) <= (tk(P8)) )) & ( (tk(P7)) <= (tk(P9)) ) ) & ( ( ( ( 7 ) <= (tk(P12)) ) | ( (tk(P5)) <= (tk(P1)) ) ) | (! ( ( 9 ) <= (tk(P9)) )) ) ) & ( (tk(P8)) <= (tk(P3)) ) ) ) )) | (! ( ( ( ( ( ( ( (tk(P2)) <= (tk(P6)) ) & ( (tk(P3)) <= ( 0 ) ) ) & (! ( ( 5 ) <= (tk(P2)) )) ) & ( ( ( ( 6 ) <= (tk(P10)) ) & ( ( 6 ) <= (tk(P2)) ) ) | ( ( ( 6 ) <= (tk(P7)) ) | ( (tk(P4)) <= (tk(P9)) ) ) ) ) | (! ( ( ( (tk(P9)) <= (tk(P3)) ) | ( ( 6 ) <= (tk(P8)) ) ) | ( (tk(P8)) <= (tk(P9)) ) )) ) & ( ( ( ( ( 10 ) <= (tk(P10)) ) & ( ( (tk(P2)) <= ( 7 ) ) & ( (tk(P7)) <= ( 0 ) ) ) ) | ( ( ( (tk(P1)) <= ( 6 ) ) | ( ( 3 ) <= (tk(P7)) ) ) & ( (tk(P6)) <= (tk(P12)) ) ) ) & ( ( ( (tk(P3)) <= ( 4 ) ) & ( (tk(P9)) <= (tk(P7)) ) ) & ( ( ( 2 ) <= (tk(P1)) ) & ( ( ( 10 ) <= (tk(P4)) ) | ( (tk(P10)) <= (tk(P5)) ) ) ) ) ) ) & (! ( (tk(P8)) <= ( 10 ) )) )) ) | (! ( (tk(P5)) <= ( 4 ) )) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P11)) <= ( 7 ) ) & ( (! ( ( ( ( ( (! ( (tk(P11)) <= ( 2 ) )) & ( ( ( 7 ) <= (tk(P6)) ) & ( (tk(P7)) <= ( 0 ) ) ) ) | ( (! ( (tk(P1)) <= (tk(P9)) )) | ( (tk(P2)) <= ( 8 ) ) ) ) | ( (! ( (tk(P8)) <= (tk(P5)) )) & ( ( ( ( 3 ) <= (tk(P11)) ) & ( (tk(P11)) <= (tk(P12)) ) ) | (! ( (tk(P7)) <= ( 3 ) )) ) ) ) | ( ( 7 ) <= (tk(P8)) ) ) & ( (tk(P8)) <= (tk(P3)) ) )) & (! ( (! ( ( (! ( ( ( 8 ) <= (tk(P10)) ) | ( (tk(P4)) <= (tk(P3)) ) )) & ( (! ( (tk(P2)) <= (tk(P11)) )) | (! ( (tk(P3)) <= (tk(P4)) )) ) ) & ( ( (tk(P6)) <= ( 2 ) ) & (! ( ( ( 4 ) <= (tk(P12)) ) & ( (tk(P10)) <= ( 0 ) ) )) ) )) | (! ( (tk(P1)) <= ( 4 ) )) )) ) )))
PROPERTY: Murphy-PT-D1N010-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P5)) <= (tk(P10)) ) | ( (tk(P11)) <= (tk(P3)) ) ) & ( ( 7 ) <= (tk(P12)) ) ) & (! ( (! ( (! ( (tk(P2)) <= ( 10 ) )) & ( (! ( ( (tk(P1)) <= ( 2 ) ) | ( (tk(P8)) <= (tk(P12)) ) )) & ( (! ( ( 10 ) <= (tk(P12)) )) | ( ( ( ( 8 ) <= (tk(P9)) ) | ( (tk(P2)) <= (tk(P12)) ) ) & (! ( ( 8 ) <= (tk(P4)) )) ) ) ) )) & ( (! ( ( ( 3 ) <= (tk(P4)) ) | (! ( ( 1 ) <= (tk(P11)) )) )) | (! ( ( 5 ) <= (tk(P1)) )) ) )) )))
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D1N010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1680837447367

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Murphy-PT-D1N010"
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 Murphy-PT-D1N010, 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 r523-tall-167987247900334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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