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-167987247100247.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 EisenbergMcGuire-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.9K 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 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K 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 EisenbergMcGuire-PT-06-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680824587753

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 23:43:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 23:43:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:43:09] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-04-06 23:43:09] [INFO ] Transformed 414 places.
[2023-04-06 23:43:09] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:43:09] [INFO ] Found NUPN structural information;
[2023-04-06 23:43:09] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 16) seen :7
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 23:43:10] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 23:43:10] [INFO ] Computed 19 invariants in 22 ms
[2023-04-06 23:43:10] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-04-06 23:43:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 23:43:10] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 23:43:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 23:43:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:43:11] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-04-06 23:43:11] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 23:43:11] [INFO ] After 403ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 8 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 662 ms
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:43:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2023-04-06 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2023-04-06 23:43:14] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-06 23:43:14] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2023-04-06 23:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-04-06 23:43:14] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-06 23:43:14] [INFO ] After 3096ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-04-06 23:43:15] [INFO ] After 4250ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 71 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 1293
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 411 transition count 1293
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 6 place count 411 transition count 1191
Deduced a syphon composed of 102 places in 3 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 210 place count 309 transition count 1191
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 231 place count 288 transition count 1065
Iterating global reduction 2 with 21 rules applied. Total rules applied 252 place count 288 transition count 1065
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 306 place count 261 transition count 1038
Applied a total of 306 rules in 146 ms. Remains 261 /414 variables (removed 153) and now considering 1038/1296 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 261/414 places, 1038/1296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
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 :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 23:43:15] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
// Phase 1: matrix 444 rows 261 cols
[2023-04-06 23:43:15] [INFO ] Computed 19 invariants in 8 ms
[2023-04-06 23:43:16] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:43:16] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:43:16] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 23:43:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:43:16] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:16] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 23:43:16] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 23:43:16] [INFO ] After 265ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 23:43:16] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 23:43:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-04-06 23:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-06 23:43:17] [INFO ] After 1349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-04-06 23:43:18] [INFO ] After 2033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 50 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 29 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 261/261 places, 1038/1038 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) 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 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 322063 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{4=1}
Probabilistic random walk after 322063 steps, saw 121868 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-04-06 23:43:21] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 23:43:21] [INFO ] Invariant cache hit.
[2023-04-06 23:43:21] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:43:21] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:21] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 23:43:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:43:21] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:22] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:22] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 23:43:22] [INFO ] After 232ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:22] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-04-06 23:43:22] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:43:22] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-04-06 23:43:22] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1122 ms
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:43:23] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:43:24] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:43:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2023-04-06 23:43:24] [INFO ] After 2050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-04-06 23:43:24] [INFO ] After 2620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 25 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 261/261 places, 1038/1038 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 314433 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314433 steps, saw 120718 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-06 23:43:27] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 23:43:27] [INFO ] Invariant cache hit.
[2023-04-06 23:43:27] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 23:43:27] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:27] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 23:43:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:43:28] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-06 23:43:28] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:28] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 23:43:28] [INFO ] After 228ms SMT Verify possible using 209 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:43:28] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-04-06 23:43:28] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1087 ms
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-06 23:43:29] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:43:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:43:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-04-06 23:43:30] [INFO ] After 1912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-04-06 23:43:30] [INFO ] After 2493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 30 ms.
Support contains 70 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 26 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 261/261 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 1038/1038 transitions.
Applied a total of 0 rules in 22 ms. Remains 261 /261 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2023-04-06 23:43:30] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 23:43:30] [INFO ] Invariant cache hit.
[2023-04-06 23:43:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-04-06 23:43:30] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 23:43:30] [INFO ] Invariant cache hit.
[2023-04-06 23:43:30] [INFO ] State equation strengthened by 209 read => feed constraints.
[2023-04-06 23:43:31] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-04-06 23:43:31] [INFO ] Redundant transitions in 64 ms returned []
[2023-04-06 23:43:31] [INFO ] Flow matrix only has 444 transitions (discarded 594 similar events)
[2023-04-06 23:43:31] [INFO ] Invariant cache hit.
[2023-04-06 23:43:31] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 261/261 places, 1038/1038 transitions.
Graph (trivial) has 491 edges and 261 vertex of which 29 / 261 are part of one of the 6 SCC in 5 ms
Free SCC test removed 23 places
Drop transitions removed 80 transitions
Ensure Unique test removed 595 transitions
Reduce isomorphic transitions removed 675 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 238 transition count 338
Reduce places removed 25 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 213 transition count 333
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 208 transition count 333
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 61 place count 208 transition count 326
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 76 place count 200 transition count 326
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 148 place count 164 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 164 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 163 transition count 301
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 193 place count 163 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 163 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 162 transition count 260
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 238 place count 162 transition count 217
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 281 place count 119 transition count 217
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 283 place count 119 transition count 215
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 291 place count 119 transition count 215
Applied a total of 291 rules in 45 ms. Remains 119 /261 variables (removed 142) and now considering 215/1038 (removed 823) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 215 rows 119 cols
[2023-04-06 23:43:31] [INFO ] Computed 18 invariants in 2 ms
[2023-04-06 23:43:31] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:43:31] [INFO ] [Real]Absence check using 13 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:31] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 23:43:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:43:31] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:43:31] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:43:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-04-06 23:43:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-04-06 23:43:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-06 23:43:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 23:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-04-06 23:43:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-04-06 23:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-04-06 23:43:32] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-04-06 23:43:32] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-04-06 23:43:32] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-04-06 23:43:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 261 places, 1038 transitions and 5208 arcs took 9 ms.
[2023-04-06 23:43:32] [INFO ] Flatten gal took : 93 ms
Total runtime 23270 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_06
(NrP: 261 NrTr: 1038 NrArc: 5208)

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

net check time: 0m 0.000sec

init dd package: 0m 2.803sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9419460 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106240 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 ReachabilityFireability -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.002sec

26857 114656 143818 181936 177903 216630 235763 237691 536073 579900 646748 645166 661960 644065 611493 585532 1029185 1068721 1099348 1123859 1144105 1186737 1180775 1171215 1178928 1215856 1386221 1397819 1435185 1539476 1648165 1647093 1673052 1686653 1741145 3592393

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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
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 EisenbergMcGuire-PT-06, examination is ReachabilityFireability"
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-167987247100247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;