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.r522-tall-167987247200302.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 marciexred
Input is Murphy-COL-D2N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K 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-COL-D2N100-ReachabilityCardinality-00
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-01
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-02
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-03
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-04
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-05
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-06
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-07
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-08
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-09
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-10
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-11
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-12
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-13
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-14
FORMULA_NAME Murphy-COL-D2N100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680888783828

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:33:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:33:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:33:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 17:33:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:33:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 401 ms
[2023-04-07 17:33:05] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 17:33:05] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-07 17:33:05] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Remains 14 properties that can be checked using skeleton over-approximation.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-04-07 17:33:09] [INFO ] Flatten gal took : 19 ms
[2023-04-07 17:33:09] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:33:09] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 6 ms.
[2023-04-07 17:33:09] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Incomplete random walk after 10067 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=65 ) properties (out of 12) seen :5
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :1
FORMULA Murphy-COL-D2N100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 17:33:10] [INFO ] Computed 4 invariants in 8 ms
[2023-04-07 17:33:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:33:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:33:10] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:33:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:33:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:33:10] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:33:10] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 5 ms to minimize.
[2023-04-07 17:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 17:33:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 17:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 17:33:10] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 17:33:10] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 191 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 11 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:33:10] [INFO ] Invariant cache hit.
[2023-04-07 17:33:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10041 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 290737 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290737 steps, saw 190237 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 17:33:14] [INFO ] Invariant cache hit.
[2023-04-07 17:33:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:33:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:33:14] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:33:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:33:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:33:14] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:33:14] [INFO ] After 33ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:14] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 17:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 17:33:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-04-07 17:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 17:33:14] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 17:33:14] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 136 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:33:14] [INFO ] Invariant cache hit.
[2023-04-07 17:33:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 17:33:14] [INFO ] Invariant cache hit.
[2023-04-07 17:33:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:33:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 17:33:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:33:14] [INFO ] Invariant cache hit.
[2023-04-07 17:33:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 17:33:14] [INFO ] Invariant cache hit.
[2023-04-07 17:33:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:33:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:33:14] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 17:33:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:33:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:33:14] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:33:14] [INFO ] After 32ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:14] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 17:33:14] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 17:33:14] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-07 17:33:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
[2023-04-07 17:33:14] [INFO ] Flatten gal took : 4 ms
Total runtime 9799 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_COL_D2N100_unf
(NrP: 18 NrTr: 21 NrArc: 81)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.702sec


RS generation: 0m19.172sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



starting MCC model checker
--------------------------

checking: AG [sum(p14, p13, p12)<=32]
normalized: ~ [E [true U ~ [sum(p14, p13, p12)<=32]]]

abstracting: (sum(p14, p13, p12)<=32)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [~ [42<=sum(p17, p16, p15)]]
normalized: ~ [E [true U 42<=sum(p17, p16, p15)]]

abstracting: (42<=sum(p17, p16, p15))
states: 0
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [~ [86<=sum(p17, p16, p15)]]
normalized: ~ [E [true U 86<=sum(p17, p16, p15)]]

abstracting: (86<=sum(p17, p16, p15))
states: 0
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[sum(p11, p10, p9)<=83 & [[~ [69<=sum(p11, p10, p9)] | [~ [sum(p14, p13, p12)<=9] | 42<=sum(p17, p16, p15)]] | [[[~ [79<=sum(p17, p16, p15)] & ~ [sum(p8, p7, p6)<=29]] | [sum(p2, p1, p0)<=72 & [~ [3<=sum(p17, p16, p15)] & ~ [sum(p5, p4, p3)<=33]]]] | [[~ [sum(p8, p7, p6)<=29] & [46<=sum(p14, p13, p12) | sum(p8, p7, p6)<=sum(p14, p13, p12)]] | [sum(p5, p4, p3)<=69 & [sum(p8, p7, p6)<=61 | 13<=sum(p5, p4, p3)]]]]]]]
normalized: ~ [E [true U ~ [[sum(p11, p10, p9)<=83 & [[[[sum(p5, p4, p3)<=69 & [sum(p8, p7, p6)<=61 | 13<=sum(p5, p4, p3)]] | [[46<=sum(p14, p13, p12) | sum(p8, p7, p6)<=sum(p14, p13, p12)] & ~ [sum(p8, p7, p6)<=29]]] | [[sum(p2, p1, p0)<=72 & [~ [sum(p5, p4, p3)<=33] & ~ [3<=sum(p17, p16, p15)]]] | [~ [sum(p8, p7, p6)<=29] & ~ [79<=sum(p17, p16, p15)]]]] | [[42<=sum(p17, p16, p15) | ~ [sum(p14, p13, p12)<=9]] | ~ [69<=sum(p11, p10, p9)]]]]]]]

abstracting: (69<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p14, p13, p12)<=9)
states: 1,207,044,185,616 (12)
abstracting: (42<=sum(p17, p16, p15))
states: 0
abstracting: (79<=sum(p17, p16, p15))
states: 0
abstracting: (sum(p8, p7, p6)<=29)
states: 10,695,495,312 (10)
abstracting: (3<=sum(p17, p16, p15))
states: 1,067,339,997,466 (12)
abstracting: (sum(p5, p4, p3)<=33)
states: 15,088,747,392 (10)
abstracting: (sum(p2, p1, p0)<=72)
states: 114,739,579,296 (11)
abstracting: (sum(p8, p7, p6)<=29)
states: 10,695,495,312 (10)
abstracting: (sum(p8, p7, p6)<=sum(p14, p13, p12))
states: 51,230,112 (7)
abstracting: (46<=sum(p14, p13, p12))
states: 0
abstracting: (13<=sum(p5, p4, p3))
states: 1,205,972,548,056 (12)
abstracting: (sum(p8, p7, p6)<=61)
states: 75,451,147,920 (10)
abstracting: (sum(p5, p4, p3)<=69)
states: 103,146,172,416 (11)
abstracting: (sum(p11, p10, p9)<=83)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-COL-D2N100-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 9.324sec

checking: AG [[[sum(p17, p16, p15)<=29 | sum(p8, p7, p6)<=sum(p14, p13, p12)] | [44<=sum(p8, p7, p6) | [~ [49<=sum(p8, p7, p6)] & [[[~ [sum(p14, p13, p12)<=sum(p5, p4, p3)] & [sum(p11, p10, p9)<=sum(p8, p7, p6) | sum(p14, p13, p12)<=75]] | [sum(p8, p7, p6)<=53 & [sum(p2, p1, p0)<=22 & sum(p5, p4, p3)<=sum(p2, p1, p0)]]] & [[~ [sum(p17, p16, p15)<=48] & [~ [41<=sum(p2, p1, p0)] | ~ [50<=sum(p14, p13, p12)]]] | [~ [sum(p11, p10, p9)<=82] & [sum(p17, p16, p15)<=sum(p14, p13, p12) | [sum(p14, p13, p12)<=sum(p2, p1, p0) | [~ [sum(p8, p7, p6)<=100] & ~ [sum(p2, p1, p0)<=27]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[44<=sum(p8, p7, p6) | [[[[[sum(p17, p16, p15)<=sum(p14, p13, p12) | [sum(p14, p13, p12)<=sum(p2, p1, p0) | [~ [sum(p8, p7, p6)<=100] & ~ [sum(p2, p1, p0)<=27]]]] & ~ [sum(p11, p10, p9)<=82]] | [[~ [50<=sum(p14, p13, p12)] | ~ [41<=sum(p2, p1, p0)]] & ~ [sum(p17, p16, p15)<=48]]] & [[sum(p8, p7, p6)<=53 & [sum(p2, p1, p0)<=22 & sum(p5, p4, p3)<=sum(p2, p1, p0)]] | [[sum(p11, p10, p9)<=sum(p8, p7, p6) | sum(p14, p13, p12)<=75] & ~ [sum(p14, p13, p12)<=sum(p5, p4, p3)]]]] & ~ [49<=sum(p8, p7, p6)]]] | [sum(p17, p16, p15)<=29 | sum(p8, p7, p6)<=sum(p14, p13, p12)]]]]]

abstracting: (sum(p8, p7, p6)<=sum(p14, p13, p12))
states: 51,230,112 (7)
abstracting: (sum(p17, p16, p15)<=29)
states: 1,207,044,185,616 (12)
abstracting: (49<=sum(p8, p7, p6))
states: 1,166,480,137,728 (12)
abstracting: (sum(p14, p13, p12)<=sum(p5, p4, p3))
states: 1,207,009,800,768 (12)
abstracting: (sum(p14, p13, p12)<=75)
states: 1,207,044,185,616 (12)
abstracting: (sum(p11, p10, p9)<=sum(p8, p7, p6))
states: 1,207,042,375,266 (12)
abstracting: (sum(p5, p4, p3)<=sum(p2, p1, p0))
MC time: 28m45.014sec

checking: EF [[~ [79<=sum(p11, p10, p9)] & [[[[~ [sum(p5, p4, p3)<=sum(p17, p16, p15)] & ~ [5<=sum(p11, p10, p9)]] & [sum(p11, p10, p9)<=sum(p14, p13, p12) & [[sum(p17, p16, p15)<=3 | sum(p14, p13, p12)<=10] & [~ [sum(p17, p16, p15)<=73] | [~ [98<=sum(p2, p1, p0)] & [sum(p14, p13, p12)<=sum(p2, p1, p0) & ~ [31<=sum(p14, p13, p12)]]]]]]] | [[~ [sum(p11, p10, p9)<=sum(p2, p1, p0)] & [~ [sum(p5, p4, p3)<=28] & 99<=sum(p11, p10, p9)]] & [[sum(p14, p13, p12)<=sum(p5, p4, p3) & [sum(p8, p7, p6)<=sum(p17, p16, p15) | [68<=sum(p14, p13, p12) | ~ [sum(p2, p1, p0)<=23]]]] & [[[~ [93<=sum(p5, p4, p3)] & ~ [72<=sum(p11, p10, p9)]] | [~ [10<=sum(p8, p7, p6)] & ~ [sum(p17, p16, p15)<=45]]] & [23<=sum(p17, p16, p15) | [~ [sum(p14, p13, p12)<=37] & ~ [sum(p8, p7, p6)<=39]]]]]]] & [sum(p5, p4, p3)<=sum(p8, p7, p6) | [~ [66<=sum(p8, p7, p6)] & 87<=sum(p11, p10, p9)]]]]]
normalized: E [true U [[[sum(p5, p4, p3)<=sum(p8, p7, p6) | [87<=sum(p11, p10, p9) & ~ [66<=sum(p8, p7, p6)]]] & [[[[[23<=sum(p17, p16, p15) | [~ [sum(p8, p7, p6)<=39] & ~ [sum(p14, p13, p12)<=37]]] & [[~ [sum(p17, p16, p15)<=45] & ~ [10<=sum(p8, p7, p6)]] | [~ [72<=sum(p11, p10, p9)] & ~ [93<=sum(p5, p4, p3)]]]] & [sum(p14, p13, p12)<=sum(p5, p4, p3) & [sum(p8, p7, p6)<=sum(p17, p16, p15) | [68<=sum(p14, p13, p12) | ~ [sum(p2, p1, p0)<=23]]]]] & [[99<=sum(p11, p10, p9) & ~ [sum(p5, p4, p3)<=28]] & ~ [sum(p11, p10, p9)<=sum(p2, p1, p0)]]] | [[sum(p11, p10, p9)<=sum(p14, p13, p12) & [[[[sum(p14, p13, p12)<=sum(p2, p1, p0) & ~ [31<=sum(p14, p13, p12)]] & ~ [98<=sum(p2, p1, p0)]] | ~ [sum(p17, p16, p15)<=73]] & [sum(p17, p16, p15)<=3 | sum(p14, p13, p12)<=10]]] & [~ [5<=sum(p11, p10, p9)] & ~ [sum(p5, p4, p3)<=sum(p17, p16, p15)]]]]] & ~ [79<=sum(p11, p10, p9)]]]

abstracting: (79<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p5, p4, p3)<=sum(p17, p16, p15))
states: 130,278,024 (8)
abstracting: (5<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p14, p13, p12)<=10)
states: 1,207,044,185,616 (12)
abstracting: (sum(p17, p16, p15)<=3)
states: 335,290,051,560 (11)
abstracting: (sum(p17, p16, p15)<=73)
states: 1,207,044,185,616 (12)
abstracting: (98<=sum(p2, p1, p0))
states: 971,015,205,888 (11)
abstracting: (31<=sum(p14, p13, p12))
states: 0
abstracting: (sum(p14, p13, p12)<=sum(p2, p1, p0))
states: 1,207,018,743,448 (12)
abstracting: (sum(p11, p10, p9)<=sum(p14, p13, p12))
states: 1,067,339,997,466 (12)
abstracting: (sum(p11, p10, p9)<=sum(p2, p1, p0))
states: 1,207,042,375,266 (12)
abstracting: (sum(p5, p4, p3)<=28)
states: 9,753,214,104 (9)
abstracting: (99<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p2, p1, p0)<=23)
states: 5,780,035,152 (9)
abstracting: (68<=sum(p14, p13, p12))
states: 0
abstracting: (sum(p8, p7, p6)<=sum(p17, p16, p15))
states: 120,025,806 (8)
abstracting: (sum(p14, p13, p12)<=sum(p5, p4, p3))
states: 1,207,009,800,768 (12)
abstracting: (93<=sum(p5, p4, p3))
states: 998,584,570,872 (11)
abstracting: (72<=sum(p11, p10, p9))
states: 0
abstracting: (10<=sum(p8, p7, p6))
states: 1,206,528,583,680 (12)
abstracting: (sum(p17, p16, p15)<=45)
states: 1,207,044,185,616 (12)
abstracting: (sum(p14, p13, p12)<=37)
states: 1,207,044,185,616 (12)
abstracting: (sum(p8, p7, p6)<=39)
states: 23,482,990,800 (10)
abstracting: (23<=sum(p17, p16, p15))
states: 0
abstracting: (66<=sum(p8, p7, p6))
states: 1,118,345,260,032 (12)
abstracting: (87<=sum(p11, p10, p9))
states: 0
abstracting: (sum(p5, p4, p3)<=sum(p8, p7, p6))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6990444 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106792 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:14959 (712), effective:3586 (170)

initing FirstDep: 0m 0.000sec


idd.h:1025: Timeout: after 1724 sec


idd.h:1025: Timeout: after 862 sec

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-COL-D2N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Murphy-COL-D2N100, 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 r522-tall-167987247200302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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