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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 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 3.1M 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-10-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680835881019

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-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 02:51:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 02:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:51:22] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-04-07 02:51:22] [INFO ] Transformed 1090 places.
[2023-04-07 02:51:22] [INFO ] Transformed 5200 transitions.
[2023-04-07 02:51:22] [INFO ] Found NUPN structural information;
[2023-04-07 02:51:22] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 14) seen :4
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-01 FALSE 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-04-07 02:51:23] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 02:51:23] [INFO ] Computed 31 invariants in 42 ms
[2023-04-07 02:51:24] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 02:51:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 60 ms returned sat
[2023-04-07 02:51:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 02:51:26] [INFO ] After 1308ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-04-07 02:51:26] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-07 02:51:28] [INFO ] After 1349ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-04-07 02:51:28] [INFO ] Deduced a trap composed of 3 places in 574 ms of which 6 ms to minimize.
[2023-04-07 02:51:29] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 1 ms to minimize.
[2023-04-07 02:51:29] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:51:29] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-04-07 02:51:29] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 1 ms to minimize.
[2023-04-07 02:51:30] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2023-04-07 02:51:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 02:51:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2177 ms
[2023-04-07 02:51:30] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-04-07 02:51:30] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 02:51:30] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:51:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2023-04-07 02:51:31] [INFO ] Deduced a trap composed of 189 places in 491 ms of which 1 ms to minimize.
[2023-04-07 02:51:32] [INFO ] Deduced a trap composed of 187 places in 513 ms of which 1 ms to minimize.
[2023-04-07 02:51:32] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 1 ms to minimize.
[2023-04-07 02:51:33] [INFO ] Deduced a trap composed of 169 places in 486 ms of which 1 ms to minimize.
[2023-04-07 02:51:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2398 ms
[2023-04-07 02:51:34] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 0 ms to minimize.
[2023-04-07 02:51:34] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2023-04-07 02:51:34] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-04-07 02:51:34] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:51:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1248 ms
[2023-04-07 02:51:35] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 02:51:35] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 0 ms to minimize.
[2023-04-07 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2023-04-07 02:51:36] [INFO ] Deduced a trap composed of 18 places in 529 ms of which 1 ms to minimize.
[2023-04-07 02:51:36] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 1 ms to minimize.
[2023-04-07 02:51:37] [INFO ] Deduced a trap composed of 20 places in 503 ms of which 1 ms to minimize.
[2023-04-07 02:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1764 ms
[2023-04-07 02:51:37] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2023-04-07 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-04-07 02:51:38] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-04-07 02:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-04-07 02:51:38] [INFO ] After 11617ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1039 ms.
[2023-04-07 02:51:39] [INFO ] After 14759ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 270 ms.
Support contains 82 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1090 transition count 5192
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 1082 transition count 5191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1081 transition count 5191
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 261 Pre rules applied. Total rules applied 18 place count 1081 transition count 4930
Deduced a syphon composed of 261 places in 6 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 3 with 522 rules applied. Total rules applied 540 place count 820 transition count 4930
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 623 place count 737 transition count 4100
Iterating global reduction 3 with 83 rules applied. Total rules applied 706 place count 737 transition count 4100
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 5 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 864 place count 658 transition count 4021
Applied a total of 864 rules in 582 ms. Remains 658 /1090 variables (removed 432) and now considering 4021/5200 (removed 1179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 583 ms. Remains : 658/1090 places, 4021/5200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 180818 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 7=1}
Probabilistic random walk after 180818 steps, saw 134493 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :6
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-07 02:51:43] [INFO ] Flow matrix only has 1151 transitions (discarded 2870 similar events)
// Phase 1: matrix 1151 rows 658 cols
[2023-04-07 02:51:43] [INFO ] Computed 31 invariants in 5 ms
[2023-04-07 02:51:43] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:51:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2023-04-07 02:51:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:51:44] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:44] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 02:51:44] [INFO ] After 262ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:44] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-07 02:51:45] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 0 ms to minimize.
[2023-04-07 02:51:45] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 0 ms to minimize.
[2023-04-07 02:51:45] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 0 ms to minimize.
[2023-04-07 02:51:45] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:51:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1270 ms
[2023-04-07 02:51:45] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:51:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-07 02:51:46] [INFO ] After 1779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-04-07 02:51:46] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 4021/4021 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 658 transition count 4020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 657 transition count 4020
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 2 place count 657 transition count 3986
Deduced a syphon composed of 34 places in 33 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 70 place count 623 transition count 3986
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 618 transition count 3936
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 618 transition count 3936
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 34 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 612 transition count 3930
Applied a total of 92 rules in 385 ms. Remains 612 /658 variables (removed 46) and now considering 3930/4021 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 612/658 places, 3930/4021 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 250008 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250008 steps, saw 172871 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:51:49] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
// Phase 1: matrix 1060 rows 612 cols
[2023-04-07 02:51:49] [INFO ] Computed 31 invariants in 11 ms
[2023-04-07 02:51:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:51:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 02:51:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 02:51:50] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:50] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-04-07 02:51:50] [INFO ] After 203ms SMT Verify possible using 454 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:50] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-04-07 02:51:50] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2023-04-07 02:51:50] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-07 02:51:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2023-04-07 02:51:51] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-07 02:51:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-07 02:51:51] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-04-07 02:51:51] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3930/3930 transitions.
Applied a total of 0 rules in 170 ms. Remains 612 /612 variables (removed 0) and now considering 3930/3930 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 612/612 places, 3930/3930 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3930/3930 transitions.
Applied a total of 0 rules in 152 ms. Remains 612 /612 variables (removed 0) and now considering 3930/3930 (removed 0) transitions.
[2023-04-07 02:51:51] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 02:51:51] [INFO ] Invariant cache hit.
[2023-04-07 02:51:52] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-04-07 02:51:52] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 02:51:52] [INFO ] Invariant cache hit.
[2023-04-07 02:51:52] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-04-07 02:51:56] [INFO ] Implicit Places using invariants and state equation in 3861 ms returned []
Implicit Place search using SMT with State Equation took 4475 ms to find 0 implicit places.
[2023-04-07 02:51:56] [INFO ] Redundant transitions in 248 ms returned []
[2023-04-07 02:51:56] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 02:51:56] [INFO ] Invariant cache hit.
[2023-04-07 02:51:57] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6338 ms. Remains : 612/612 places, 3930/3930 transitions.
Graph (trivial) has 3598 edges and 612 vertex of which 95 / 612 are part of one of the 10 SCC in 5 ms
Free SCC test removed 85 places
Drop transitions removed 320 transitions
Ensure Unique test removed 2819 transitions
Reduce isomorphic transitions removed 3139 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 527 transition count 675
Reduce places removed 116 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 121 rules applied. Total rules applied 238 place count 411 transition count 670
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 243 place count 406 transition count 670
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 243 place count 406 transition count 658
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 269 place count 392 transition count 658
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 611 place count 221 transition count 487
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 694 place count 221 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 700 place count 218 transition count 422
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 701 place count 218 transition count 421
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 713 place count 218 transition count 409
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 719 place count 215 transition count 412
Free-agglomeration rule applied 61 times.
Iterating global reduction 5 with 61 rules applied. Total rules applied 780 place count 215 transition count 351
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 841 place count 154 transition count 351
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 849 place count 154 transition count 351
Applied a total of 849 rules in 76 ms. Remains 154 /612 variables (removed 458) and now considering 351/3930 (removed 3579) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 351 rows 154 cols
[2023-04-07 02:51:57] [INFO ] Computed 29 invariants in 2 ms
[2023-04-07 02:51:58] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:51:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-07 02:51:58] [INFO ] [Nat]Absence check using 21 positive and 8 generalized place invariants in 1 ms returned sat
[2023-04-07 02:51:58] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 02:51:58] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-04-07 02:51:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-04-07 02:51:58] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 02:51:58] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:51:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-04-07 02:51:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 3930 transitions and 21100 arcs took 37 ms.
[2023-04-07 02:51:58] [INFO ] Flatten gal took : 273 ms
Total runtime 36289 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_10
(NrP: 612 NrTr: 3930 NrArc: 21100)

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

net check time: 0m 0.002sec

init dd package: 0m 2.763sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9895612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102388 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.034sec

186868 347257 424242 571348 684331 860498 947231

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

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