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.r106-tall-167814482700391.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 DES-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 DES-PT-02b-ReachabilityFireability-00
FORMULA_NAME DES-PT-02b-ReachabilityFireability-01
FORMULA_NAME DES-PT-02b-ReachabilityFireability-02
FORMULA_NAME DES-PT-02b-ReachabilityFireability-03
FORMULA_NAME DES-PT-02b-ReachabilityFireability-04
FORMULA_NAME DES-PT-02b-ReachabilityFireability-05
FORMULA_NAME DES-PT-02b-ReachabilityFireability-06
FORMULA_NAME DES-PT-02b-ReachabilityFireability-07
FORMULA_NAME DES-PT-02b-ReachabilityFireability-08
FORMULA_NAME DES-PT-02b-ReachabilityFireability-09
FORMULA_NAME DES-PT-02b-ReachabilityFireability-10
FORMULA_NAME DES-PT-02b-ReachabilityFireability-11
FORMULA_NAME DES-PT-02b-ReachabilityFireability-12
FORMULA_NAME DES-PT-02b-ReachabilityFireability-13
FORMULA_NAME DES-PT-02b-ReachabilityFireability-14
FORMULA_NAME DES-PT-02b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678382314842

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=DES-PT-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 17:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 17:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:18:36] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-09 17:18:36] [INFO ] Transformed 288 places.
[2023-03-09 17:18:36] [INFO ] Transformed 239 transitions.
[2023-03-09 17:18:36] [INFO ] Found NUPN structural information;
[2023-03-09 17:18:36] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 16) seen :11
FORMULA DES-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 239 rows 288 cols
[2023-03-09 17:18:37] [INFO ] Computed 65 place invariants in 28 ms
[2023-03-09 17:18:37] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 17:18:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 17:18:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 17:18:38] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-09 17:18:38] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1236 ms
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 326 ms
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-03-09 17:18:39] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-09 17:18:40] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2023-03-09 17:18:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-03-09 17:18:40] [INFO ] After 2375ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-09 17:18:40] [INFO ] After 2778ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA DES-PT-02b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA DES-PT-02b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-02b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 34 ms.
Support contains 23 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 239/239 transitions.
Graph (complete) has 525 edges and 288 vertex of which 277 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 277 transition count 214
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 259 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 258 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 41 place count 258 transition count 203
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 61 place count 248 transition count 203
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 78 place count 231 transition count 186
Iterating global reduction 3 with 17 rules applied. Total rules applied 95 place count 231 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 95 place count 231 transition count 185
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 230 transition count 185
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 109 place count 218 transition count 173
Iterating global reduction 3 with 12 rules applied. Total rules applied 121 place count 218 transition count 173
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 218 transition count 161
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 216 transition count 160
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 246 place count 161 transition count 105
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 254 place count 157 transition count 114
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 157 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 258 place count 155 transition count 112
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 260 place count 155 transition count 112
Applied a total of 260 rules in 134 ms. Remains 155 /288 variables (removed 133) and now considering 112/239 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 155/288 places, 112/239 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 155 cols
[2023-03-09 17:18:40] [INFO ] Computed 61 place invariants in 16 ms
[2023-03-09 17:18:40] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:18:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 17:18:40] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:18:40] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-09 17:18:40] [INFO ] After 51ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:41] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-09 17:18:41] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 112/112 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 109
Applied a total of 7 rules in 16 ms. Remains 152 /155 variables (removed 3) and now considering 109/112 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 152/155 places, 109/112 transitions.
Incomplete random walk after 10000 steps, including 245 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1821013 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :{}
Probabilistic random walk after 1821013 steps, saw 306638 distinct states, run finished after 3002 ms. (steps per millisecond=606 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 152 cols
[2023-03-09 17:18:44] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-09 17:18:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:18:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-09 17:18:44] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 17:18:44] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-09 17:18:44] [INFO ] After 37ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 5 ms to minimize.
[2023-03-09 17:18:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-09 17:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-09 17:18:44] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-09 17:18:44] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-09 17:18:44] [INFO ] Invariant cache hit.
[2023-03-09 17:18:44] [INFO ] Implicit Places using invariants in 105 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/152 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 119 ms. Remains : 151/152 places, 109/109 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1920407 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1920407 steps, saw 324995 distinct states, run finished after 3004 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 151 cols
[2023-03-09 17:18:47] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 17:18:47] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:18:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 17:18:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 17:18:47] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 17:18:47] [INFO ] After 27ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-09 17:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-09 17:18:47] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 17:18:48] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 151/151 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-09 17:18:48] [INFO ] Invariant cache hit.
[2023-03-09 17:18:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 17:18:48] [INFO ] Invariant cache hit.
[2023-03-09 17:18:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 17:18:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-09 17:18:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 17:18:48] [INFO ] Invariant cache hit.
[2023-03-09 17:18:48] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 151/151 places, 109/109 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 109
Applied a total of 1 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 109 rows 151 cols
[2023-03-09 17:18:48] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 17:18:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:18:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 17:18:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 17:18:48] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:48] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-09 17:18:48] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-09 17:18:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 109 transitions and 554 arcs took 2 ms.
[2023-03-09 17:18:49] [INFO ] Flatten gal took : 181 ms
Total runtime 12775 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: DES_PT_02b
(NrP: 151 NrTr: 109 NrArc: 554)

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

net check time: 0m 0.000sec

init dd package: 0m 2.761sec


RS generation: 0m 2.671sec


-> reachability set: #nodes 61101 (6.1e+04) #states 229,132,025,715 (11)



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

checking: EF [[[[1<=p101 & p101<=1] & [[p28<=0 & 0<=p28] | [p118<=0 & 0<=p118]]] & [[[[[[[[p144<=1 & 1<=p144] & [p45<=1 & 1<=p45]] & [p39<=1 & 1<=p39]] | [[p81<=1 & 1<=p81] & [p43<=1 & 1<=p43]]] & [p142<=1 & 1<=p142]] & [p132<=1 & 1<=p132]] | [[p4<=1 & 1<=p4] & [p146<=1 & 1<=p146]]] & [[[p25<=0 & 0<=p25] | [[p91<=0 & 0<=p91] | [p20<=1 & 1<=p20]]] | [[[p79<=1 & 1<=p79] | [p13<=1 & 1<=p13]] | [[p10<=1 & 1<=p10] | [[p64<=1 & 1<=p64] & [p85<=1 & 1<=p85]]]]]]]]
normalized: E [true U [[[[[[p79<=1 & 1<=p79] | [p13<=1 & 1<=p13]] | [[[p64<=1 & 1<=p64] & [p85<=1 & 1<=p85]] | [p10<=1 & 1<=p10]]] | [[[p20<=1 & 1<=p20] | [p91<=0 & 0<=p91]] | [p25<=0 & 0<=p25]]] & [[[p4<=1 & 1<=p4] & [p146<=1 & 1<=p146]] | [[p132<=1 & 1<=p132] & [[p142<=1 & 1<=p142] & [[[p81<=1 & 1<=p81] & [p43<=1 & 1<=p43]] | [[[p144<=1 & 1<=p144] & [p45<=1 & 1<=p45]] & [p39<=1 & 1<=p39]]]]]]] & [[[p118<=0 & 0<=p118] | [p28<=0 & 0<=p28]] & [1<=p101 & p101<=1]]]]

abstracting: (p101<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p101)
states: 2,075,185,824 (9)
abstracting: (0<=p28)
states: 229,132,025,715 (11)
abstracting: (p28<=0)
states: 167,155,080,763 (11)
abstracting: (0<=p118)
states: 229,132,025,715 (11)
abstracting: (p118<=0)
states: 222,061,784,667 (11)
abstracting: (1<=p39)
states: 85,889,720,128 (10)
abstracting: (p39<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p45)
states: 17,197,051,552 (10)
abstracting: (p45<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p144)
states: 23,473,974,776 (10)
abstracting: (p144<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p43)
states: 46,762,321,136 (10)
abstracting: (p43<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p81)
states: 5,030,791,488 (9)
abstracting: (p81<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p142)
states: 23,473,974,776 (10)
abstracting: (p142<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p132)
states: 29,039,370,448 (10)
abstracting: (p132<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p146)
states: 50,592,850,784 (10)
abstracting: (p146<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p4)
states: 3,852,369 (6)
abstracting: (p4<=1)
states: 229,132,025,715 (11)
abstracting: (0<=p25)
states: 229,132,025,715 (11)
abstracting: (p25<=0)
states: 166,361,942,295 (11)
abstracting: (0<=p91)
states: 229,132,025,715 (11)
abstracting: (p91<=0)
states: 139,605,235,955 (11)
abstracting: (1<=p20)
states: 23,480,011,968 (10)
abstracting: (p20<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p10)
states: 2
abstracting: (p10<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p85)
states: 87,148,719,376 (10)
abstracting: (p85<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p64)
states: 105,187,283,664 (11)
abstracting: (p64<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p13)
states: 53,659,436,200 (10)
abstracting: (p13<=1)
states: 229,132,025,715 (11)
abstracting: (1<=p79)
states: 80,610,624 (7)
abstracting: (p79<=1)
states: 229,132,025,715 (11)
-> the formula is FALSE

FORMULA DES-PT-02b-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.511sec

totally nodes used: 910744 (9.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3626496 10790162 14416658
used/not used/entry size/cache size: 10442805 56666059 16 1024MB
basic ops cache: hits/miss/sum: 197942 1042312 1240254
used/not used/entry size/cache size: 1583527 15193689 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 51102 240973 292075
used/not used/entry size/cache size: 238055 8150553 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66266490
1 781765
2 53605
3 6313
4 628
5 60
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.853sec


BK_STOP 1678382337891

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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.000sec


iterations count:83050 (761), effective:7866 (72)

initing FirstDep: 0m 0.000sec

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="DES-PT-02b"
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 DES-PT-02b, 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 r106-tall-167814482700391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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