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.r234-tall-167856420400526.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 LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679525641047

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=LeafsetExtension-PT-S64C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:54:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:54:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:54:03] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2023-03-22 22:54:03] [INFO ] Transformed 21462 places.
[2023-03-22 22:54:03] [INFO ] Transformed 21129 transitions.
[2023-03-22 22:54:03] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 675 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 550 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 22:54:07] [INFO ] Computed 333 place invariants in 2521 ms
[2023-03-22 22:54:13] [INFO ] [Real]Absence check using 67 positive place invariants in 65 ms returned sat
[2023-03-22 22:54:14] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 788 ms returned sat
[2023-03-22 22:54:14] [INFO ] After 6852ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-22 22:54:19] [INFO ] [Nat]Absence check using 67 positive place invariants in 53 ms returned sat
[2023-03-22 22:54:20] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 797 ms returned sat
[2023-03-22 22:54:39] [INFO ] After 18186ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2023-03-22 22:54:39] [INFO ] After 18223ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 22:54:39] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 758 are kept as prefixes of interest. Removing 20704 places using SCC suffix rule.31 ms
Discarding 20704 places :
Also discarding 12083 output transitions
Drop transitions removed 12083 transitions
Drop transitions removed 4272 transitions
Reduce isomorphic transitions removed 4272 transitions.
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 4527 rules applied. Total rules applied 4528 place count 758 transition count 4519
Reduce places removed 257 places and 0 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 1 with 265 rules applied. Total rules applied 4793 place count 501 transition count 4511
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 4801 place count 493 transition count 4511
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 4801 place count 493 transition count 4501
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 4821 place count 483 transition count 4501
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4822 place count 483 transition count 4500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4823 place count 482 transition count 4500
Partial Free-agglomeration rule applied 248 times.
Drop transitions removed 248 transitions
Iterating global reduction 4 with 248 rules applied. Total rules applied 5071 place count 482 transition count 4500
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 4 with 8 rules applied. Total rules applied 5079 place count 474 transition count 4500
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 5086 place count 474 transition count 4493
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 5093 place count 467 transition count 4493
Applied a total of 5093 rules in 623 ms. Remains 467 /21462 variables (removed 20995) and now considering 4493/21129 (removed 16636) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 467/21462 places, 4493/21129 transitions.
Incomplete random walk after 10000 steps, including 1953 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 22:54:40] [INFO ] Flow matrix only has 658 transitions (discarded 3835 similar events)
// Phase 1: matrix 658 rows 467 cols
[2023-03-22 22:54:40] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-22 22:54:40] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 22:54:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 22:54:40] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 22:54:40] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-22 22:54:40] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 4493/4493 transitions.
Graph (complete) has 1236 edges and 467 vertex of which 401 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.0 ms
Discarding 66 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 401 transition count 4427
Applied a total of 65 rules in 49 ms. Remains 401 /467 variables (removed 66) and now considering 4427/4493 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 401/467 places, 4427/4493 transitions.
Incomplete random walk after 10000 steps, including 1952 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 33127 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{1=1}
Probabilistic random walk after 33127 steps, saw 12000 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-22 22:54:43] [INFO ] Flow matrix only has 528 transitions (discarded 3899 similar events)
// Phase 1: matrix 528 rows 401 cols
[2023-03-22 22:54:43] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-22 22:54:44] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:54:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 22:54:44] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:54:44] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 22:54:44] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 4427/4427 transitions.
Graph (complete) has 980 edges and 401 vertex of which 297 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.1 ms
Discarding 104 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 297 transition count 4324
Applied a total of 100 rules in 49 ms. Remains 297 /401 variables (removed 104) and now considering 4324/4427 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 297/401 places, 4324/4427 transitions.
Incomplete random walk after 10000 steps, including 1970 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33375 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33375 steps, saw 12386 distinct states, run finished after 3002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:54:47] [INFO ] Flow matrix only has 326 transitions (discarded 3998 similar events)
// Phase 1: matrix 326 rows 297 cols
[2023-03-22 22:54:47] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 22:54:47] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:54:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 22:54:47] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:54:47] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 22:54:47] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 4324/4324 transitions.
Applied a total of 0 rules in 37 ms. Remains 297 /297 variables (removed 0) and now considering 4324/4324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 297/297 places, 4324/4324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 4324/4324 transitions.
Applied a total of 0 rules in 37 ms. Remains 297 /297 variables (removed 0) and now considering 4324/4324 (removed 0) transitions.
[2023-03-22 22:54:47] [INFO ] Flow matrix only has 326 transitions (discarded 3998 similar events)
[2023-03-22 22:54:47] [INFO ] Invariant cache hit.
[2023-03-22 22:54:48] [INFO ] Implicit Places using invariants in 521 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 525 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/297 places, 4324/4324 transitions.
Applied a total of 0 rules in 47 ms. Remains 296 /296 variables (removed 0) and now considering 4324/4324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 610 ms. Remains : 296/297 places, 4324/4324 transitions.
Incomplete random walk after 10000 steps, including 1972 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33814 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33814 steps, saw 12533 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:54:51] [INFO ] Flow matrix only has 326 transitions (discarded 3998 similar events)
// Phase 1: matrix 326 rows 296 cols
[2023-03-22 22:54:51] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-22 22:54:51] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:54:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 22:54:51] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:54:51] [INFO ] After 124ms 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-22 22:54:51] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 4324/4324 transitions.
Applied a total of 0 rules in 38 ms. Remains 296 /296 variables (removed 0) and now considering 4324/4324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 296/296 places, 4324/4324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 4324/4324 transitions.
Applied a total of 0 rules in 37 ms. Remains 296 /296 variables (removed 0) and now considering 4324/4324 (removed 0) transitions.
[2023-03-22 22:54:51] [INFO ] Flow matrix only has 326 transitions (discarded 3998 similar events)
[2023-03-22 22:54:51] [INFO ] Invariant cache hit.
[2023-03-22 22:54:52] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-22 22:54:52] [INFO ] Flow matrix only has 326 transitions (discarded 3998 similar events)
[2023-03-22 22:54:52] [INFO ] Invariant cache hit.
[2023-03-22 22:54:53] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned [3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 247, 250, 286, 289, 292, 295]
Discarding 65 places :
Implicit Place search using SMT with State Equation took 1615 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/296 places, 4324/4324 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 143 transition count 4236
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 143 transition count 4236
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 0 with 65 rules applied. Total rules applied 241 place count 143 transition count 4171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 306 place count 78 transition count 4171
Applied a total of 306 rules in 382 ms. Remains 78 /231 variables (removed 153) and now considering 4171/4324 (removed 153) transitions.
[2023-03-22 22:54:53] [INFO ] Flow matrix only has 173 transitions (discarded 3998 similar events)
// Phase 1: matrix 173 rows 78 cols
[2023-03-22 22:54:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 22:54:54] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-22 22:54:54] [INFO ] Flow matrix only has 173 transitions (discarded 3998 similar events)
[2023-03-22 22:54:54] [INFO ] Invariant cache hit.
[2023-03-22 22:54:54] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 78/296 places, 4171/4324 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2644 ms. Remains : 78/296 places, 4171/4324 transitions.
Finished random walk after 3791 steps, including 1239 resets, run visited all 1 properties in 79 ms. (steps per millisecond=47 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 52128 ms.
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: LeafsetExtension_PT_S64C2
(NrP: 21462 NrTr: 21129 NrArc: 67740)

parse formulas
formulas created successfully
place and transition orderings generation:1m20.684sec

net check time: 0m 0.012sec

init dd package: 0m 2.693sec


before gc: list nodes free: 1736013

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870394

before gc: list nodes free: 1654026

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837597

before gc: list nodes free: 1679324

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812408
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6576596 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16089272 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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 1.138sec

274870 383057 531626

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="LeafsetExtension-PT-S64C2"
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 LeafsetExtension-PT-S64C2, 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 r234-tall-167856420400526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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