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-167987247100246.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100246
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680824524911

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=EisenbergMcGuire-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 23:42:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 23:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:42:06] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-04-06 23:42:06] [INFO ] Transformed 414 places.
[2023-04-06 23:42:06] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:42:06] [INFO ] Found NUPN structural information;
[2023-04-06 23:42:06] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 12) seen :8
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:42:07] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 23:42:07] [INFO ] Computed 19 invariants in 26 ms
[2023-04-06 23:42:07] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:42:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-04-06 23:42:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 23:42:07] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-04-06 23:42:07] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 23:42:08] [INFO ] After 177ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-04-06 23:42:08] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 6 ms to minimize.
[2023-04-06 23:42:08] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:42:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-04-06 23:42:08] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2023-04-06 23:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-04-06 23:42:08] [INFO ] Deduced a trap composed of 125 places in 244 ms of which 1 ms to minimize.
[2023-04-06 23:42:09] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2023-04-06 23:42:09] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-04-06 23:42:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2023-04-06 23:42:09] [INFO ] After 1299ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-04-06 23:42:09] [INFO ] After 1878ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 43 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 12 place count 408 transition count 1197
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 198 place count 315 transition count 1197
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 226 place count 287 transition count 1029
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 287 transition count 1029
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 308 place count 260 transition count 1002
Applied a total of 308 rules in 162 ms. Remains 260 /414 variables (removed 154) and now considering 1002/1296 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 260/414 places, 1002/1296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 506373 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{0=1}
Probabilistic random walk after 506373 steps, saw 163435 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-06 23:42:12] [INFO ] Flow matrix only has 408 transitions (discarded 594 similar events)
// Phase 1: matrix 408 rows 260 cols
[2023-04-06 23:42:12] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:42:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:42:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:42:12] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:42:12] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:12] [INFO ] State equation strengthened by 174 read => feed constraints.
[2023-04-06 23:42:13] [INFO ] After 87ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 732 ms
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:42:13] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:42:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 23:42:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2023-04-06 23:42:14] [INFO ] After 1060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-06 23:42:14] [INFO ] After 1307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 34 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 1002/1002 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 260 transition count 998
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 256 transition count 998
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 255 transition count 992
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 255 transition count 992
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 253 transition count 990
Applied a total of 14 rules in 83 ms. Remains 253 /260 variables (removed 7) and now considering 990/1002 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 253/260 places, 990/1002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 536501 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536501 steps, saw 162324 distinct states, run finished after 3003 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 23:42:17] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
// Phase 1: matrix 396 rows 253 cols
[2023-04-06 23:42:17] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 23:42:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:42:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:42:17] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:42:17] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:17] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:42:17] [INFO ] After 75ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:17] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:42:17] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:42:17] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-04-06 23:42:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-04-06 23:42:18] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:42:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-04-06 23:42:18] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-06 23:42:18] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 34 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 990/990 transitions.
Applied a total of 0 rules in 48 ms. Remains 253 /253 variables (removed 0) and now considering 990/990 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 253/253 places, 990/990 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 990/990 transitions.
Applied a total of 0 rules in 29 ms. Remains 253 /253 variables (removed 0) and now considering 990/990 (removed 0) transitions.
[2023-04-06 23:42:18] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 23:42:18] [INFO ] Invariant cache hit.
[2023-04-06 23:42:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-06 23:42:18] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 23:42:18] [INFO ] Invariant cache hit.
[2023-04-06 23:42:18] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:42:19] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-04-06 23:42:19] [INFO ] Redundant transitions in 58 ms returned []
[2023-04-06 23:42:19] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 23:42:19] [INFO ] Invariant cache hit.
[2023-04-06 23:42:19] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1111 ms. Remains : 253/253 places, 990/990 transitions.
Graph (trivial) has 759 edges and 253 vertex of which 32 / 253 are part of one of the 6 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions removed 97 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 676 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 227 transition count 277
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 190 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 187 transition count 274
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 81 place count 187 transition count 269
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 92 place count 181 transition count 269
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 186 place count 134 transition count 222
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 201 place count 134 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 130 transition count 218
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 213 place count 130 transition count 214
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 224 place count 130 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 129 transition count 204
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 243 place count 129 transition count 187
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 260 place count 112 transition count 187
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 268 place count 112 transition count 187
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 112 transition count 187
Applied a total of 269 rules in 45 ms. Remains 112 /253 variables (removed 141) and now considering 187/990 (removed 803) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 112 cols
[2023-04-06 23:42:19] [INFO ] Computed 18 invariants in 1 ms
[2023-04-06 23:42:19] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:42:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:42:19] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:42:19] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 23:42:19] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-06 23:42:19] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2023-04-06 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-06 23:42:19] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 23:42:19] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:42:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-06 23:42:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 990 transitions and 5016 arcs took 6 ms.
[2023-04-06 23:42:19] [INFO ] Flatten gal took : 87 ms
Total runtime 13571 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: EisenbergMcGuire_PT_06
(NrP: 253 NrTr: 990 NrArc: 5016)

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

net check time: 0m 0.000sec

init dd package: 0m 2.711sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9125516 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16107292 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//
++ 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
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.004sec

33002 70052 120899 171405 213203 236865 282818 334053 406973 415966 477381 542468 548712 632976 640006 644846 676352 665662 763002 775974 751811 766607 812325 890462 866186 922473 928953 944825 959441 989719 979521 1016517 1006886 1013154 1069288 1055307 1071828 1096967 1150241 1178534 1184806 1196852 1212108 1278234 1275721 1290701 1292409 1284782 2577420

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="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 EisenbergMcGuire-PT-06, 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-167987247100246"
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 [ "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 ;