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-167987248000366.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-D4N025, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987248000366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 19K 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-D4N025-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680837910001

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-D4N025
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 03:25:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:25:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:25:11] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-04-07 03:25:11] [INFO ] Transformed 30 places.
[2023-04-07 03:25:11] [INFO ] Transformed 35 transitions.
[2023-04-07 03:25:11] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 14) seen :6
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 03:25:12] [INFO ] Computed 6 invariants in 7 ms
[2023-04-07 03:25:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 03:25:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:25:12] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:25:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:12] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:25:12] [INFO ] After 79ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:13] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-04-07 03:25:13] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 106 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 03:25:13] [INFO ] Invariant cache hit.
[2023-04-07 03:25:13] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 311799 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311799 steps, saw 215437 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 03:25:16] [INFO ] Invariant cache hit.
[2023-04-07 03:25:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:16] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:25:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-07 03:25:16] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:25:16] [INFO ] After 72ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:16] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2023-04-07 03:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 03:25:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2023-04-07 03:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 03:25:16] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 03:25:17] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 99 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:25:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 03:25:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:17] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 03:25:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:17] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 03:25:17] [INFO ] After 54ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:17] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 10 ms to minimize.
[2023-04-07 03:25:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-07 03:25:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 03:25:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-07 03:25:17] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 03:25:17] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 03:25:17] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-04-07 03:25:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 0 ms.
[2023-04-07 03:25:17] [INFO ] Flatten gal took : 21 ms
Total runtime 6158 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Murphy (PT), instance D4N025
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: 30 places, 35 transitions, 135 arcs.
Final Score: 112.16
Took : 1 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-00 (reachable & potential(( ( 20 ) <= (tk(P22)) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-02 (reachable & potential(( ( ( ( (! ( (tk(P1)) <= (tk(P6)) )) & ( (tk(P10)) <= (tk(P29)) ) ) & ( (! ( (tk(P5)) <= ( 2 ) )) & (! ( (tk(P28)) <= ( 21 ) )) ) ) & ( ( ( ( 14 ) <= (tk(P26)) ) & ( (tk(P11)) <= ( 5 ) ) ) & ( ( ( 18 ) <= (tk(P5)) ) & ( ( 24 ) <= (tk(P21)) ) ) ) ) & ( ( ( ( ( 25 ) <= (tk(P26)) ) & (! ( ( 9 ) <= (tk(P13)) )) ) & ( ( ( ( 1 ) <= (tk(P3)) ) | ( ( (tk(P9)) <= (tk(P24)) ) | ( (tk(P17)) <= (tk(P6)) ) ) ) & ( (! ( (tk(P13)) <= (tk(P11)) )) | ( ( (tk(P14)) <= ( 18 ) ) & (! ( (tk(P23)) <= (tk(P26)) )) ) ) ) ) & ( ( ( ( (! ( ( 9 ) <= (tk(P16)) )) & (! ( ( 7 ) <= (tk(P18)) )) ) | ( (! ( (tk(P14)) <= (tk(P27)) )) & (! ( (tk(P21)) <= ( 24 ) )) ) ) & ( (! ( (tk(P16)) <= ( 23 ) )) | ( ( (tk(P19)) <= (tk(P10)) ) | ( ( (! ( ( 12 ) <= (tk(P24)) )) & (! ( (tk(P23)) <= ( 19 ) )) ) & ( (! ( ( 14 ) <= (tk(P17)) )) & ( (! ( (tk(P16)) <= (tk(P1)) )) | (! ( (tk(P16)) <= ( 6 ) )) ) ) ) ) ) ) & ( ( ( ( (tk(P26)) <= (tk(P7)) ) & ( ( (tk(P13)) <= (tk(P14)) ) & ( (tk(P11)) <= ( 18 ) ) ) ) | ( ( ( (tk(P3)) <= ( 13 ) ) & (! ( (tk(P26)) <= ( 11 ) )) ) & ( (! ( (tk(P19)) <= (tk(P25)) )) & ( ( (! ( ( 8 ) <= (tk(P30)) )) | (! ( ( 14 ) <= (tk(P6)) )) ) & ( (! ( (tk(P8)) <= (tk(P2)) )) | (! ( (tk(P26)) <= (tk(P16)) )) ) ) ) ) ) & ( ( ( (tk(P20)) <= ( 20 ) ) | (! ( (tk(P3)) <= (tk(P10)) )) ) & ( ( (tk(P17)) <= ( 16 ) ) | ( (tk(P1)) <= ( 3 ) ) ) ) ) ) ) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-04 (reachable & potential(( ( 9 ) <= (tk(P19)) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-07 (reachable & potential(( ( ( (! ( (tk(P21)) <= ( 16 ) )) | ( ( (tk(P20)) <= (tk(P22)) ) & (! ( (tk(P19)) <= ( 16 ) )) ) ) & ( ( (! ( (tk(P16)) <= ( 19 ) )) | (! ( ( 1 ) <= (tk(P24)) )) ) | ( ( ( (! ( (tk(P15)) <= (tk(P23)) )) & ( (! ( ( 4 ) <= (tk(P17)) )) & (! ( (tk(P4)) <= ( 15 ) )) ) ) & ( (! ( (tk(P21)) <= (tk(P30)) )) & ( ( ( 12 ) <= (tk(P14)) ) & ( (tk(P23)) <= (tk(P5)) ) ) ) ) | ( ( (tk(P5)) <= ( 8 ) ) & ( (tk(P19)) <= (tk(P7)) ) ) ) ) ) & ( ( ( ( (tk(P15)) <= (tk(P19)) ) | ( ( (tk(P28)) <= (tk(P4)) ) | ( ( 15 ) <= (tk(P3)) ) ) ) | ( (! ( (tk(P6)) <= (tk(P10)) )) | ( (! ( (tk(P11)) <= ( 25 ) )) | ( (! ( (tk(P27)) <= (tk(P18)) )) & ( (! ( (tk(P23)) <= (tk(P10)) )) & (! ( ( 20 ) <= (tk(P13)) )) ) ) ) ) ) & ( (! ( (tk(P19)) <= (tk(P14)) )) | ( (! ( ( 14 ) <= (tk(P24)) )) & ( (! ( (tk(P29)) <= ( 4 ) )) & (! ( (tk(P9)) <= ( 15 ) )) ) ) ) ) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-09 (reachable & potential(( ( ( 4 ) <= (tk(P18)) ) & ( (! ( (tk(P9)) <= (tk(P3)) )) & (! ( (tk(P18)) <= (tk(P8)) )) ) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-11 (reachable &!potential( ( (! ( (tk(P2)) <= ( 7 ) )) | ( (! ( ( 22 ) <= (tk(P26)) )) | (! ( ( 14 ) <= (tk(P19)) )) ) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( ( 9 ) <= (tk(P26)) )) | ( ( ( ( 1 ) <= (tk(P11)) ) & ( ( (tk(P10)) <= (tk(P28)) ) | ( ( (tk(P1)) <= ( 13 ) ) & ( (! ( ( 25 ) <= (tk(P13)) )) & (! ( ( 12 ) <= (tk(P22)) )) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P24)) )) | ( (! ( ( 20 ) <= (tk(P9)) )) & (! ( (tk(P2)) <= ( 23 ) )) ) ) & ( (! ( ( 16 ) <= (tk(P8)) )) | (! ( (tk(P6)) <= ( 23 ) )) ) ) ) ) | ( ( (! ( (tk(P28)) <= (tk(P23)) )) & ( (! ( ( 4 ) <= (tk(P11)) )) & (! ( (tk(P30)) <= (tk(P12)) )) ) ) | ( ( ( 1 ) <= (tk(P13)) ) & ( ( (! ( (tk(P29)) <= ( 2 ) )) | ( ( (tk(P22)) <= ( 18 ) ) & ( (! ( (tk(P17)) <= (tk(P15)) )) & (! ( (tk(P10)) <= ( 19 ) )) ) ) ) & ( (! ( (tk(P23)) <= (tk(P11)) )) | ( ( (tk(P18)) <= ( 15 ) ) & ( ( ( 24 ) <= (tk(P16)) ) & ( (! ( (tk(P2)) <= ( 20 ) )) | (! ( (tk(P19)) <= (tk(P27)) )) ) ) ) ) ) ) ) )))
PROPERTY: Murphy-PT-D4N025-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( 19 ) <= (tk(P19)) ) | ( ( (tk(P10)) <= (tk(P9)) ) | (! ( ( 24 ) <= (tk(P23)) )) ) ) | ( ( (tk(P10)) <= ( 4 ) ) | ( ( (! ( (tk(P5)) <= (tk(P14)) )) & ( ( ( (tk(P13)) <= ( 11 ) ) | ( (! ( (tk(P19)) <= ( 4 ) )) & ( ( (! ( (tk(P8)) <= (tk(P3)) )) | ( (! ( (tk(P11)) <= (tk(P1)) )) | ( (! ( ( 3 ) <= (tk(P28)) )) & (! ( (tk(P12)) <= (tk(P30)) )) ) ) ) & ( (! ( (tk(P8)) <= ( 21 ) )) | ( ( (tk(P28)) <= ( 10 ) ) | ( (tk(P20)) <= ( 15 ) ) ) ) ) ) ) & ( ( (! ( (tk(P26)) <= ( 12 ) )) | (! ( ( 2 ) <= (tk(P17)) )) ) | ( ( ( 17 ) <= (tk(P7)) ) | ( ( 10 ) <= (tk(P22)) ) ) ) ) ) | ( ( ( (tk(P20)) <= ( 11 ) ) | ( ( 24 ) <= (tk(P28)) ) ) & ( ( (tk(P5)) <= ( 11 ) ) | ( ( 24 ) <= (tk(P2)) ) ) ) ) ) )))
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1680837970862

--------------------
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-D4N025"
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-D4N025, 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-167987248000366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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