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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678391971671

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=DES-PT-20b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 19:59:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 19:59:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:59:33] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-09 19:59:33] [INFO ] Transformed 360 places.
[2023-03-09 19:59:33] [INFO ] Transformed 311 transitions.
[2023-03-09 19:59:33] [INFO ] Found NUPN structural information;
[2023-03-09 19:59:33] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 14) seen :10
FORMULA DES-PT-20b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 360 cols
[2023-03-09 19:59:34] [INFO ] Computed 65 place invariants in 32 ms
[2023-03-09 19:59:34] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:59:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-09 19:59:34] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-09 19:59:35] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:35] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 4 ms to minimize.
[2023-03-09 19:59:35] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2023-03-09 19:59:35] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 664 ms
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 528 ms
[2023-03-09 19:59:37] [INFO ] After 2570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 700 ms.
[2023-03-09 19:59:37] [INFO ] After 3629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 204 ms.
Support contains 30 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 349 transition count 289
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 334 transition count 284
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 329 transition count 284
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 43 place count 329 transition count 278
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 323 transition count 278
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 72 place count 306 transition count 261
Iterating global reduction 3 with 17 rules applied. Total rules applied 89 place count 306 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 306 transition count 260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 305 transition count 260
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 296 transition count 251
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 296 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 116 place count 296 transition count 244
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 254 place count 227 transition count 175
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 262 place count 223 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 223 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 222 transition count 181
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 222 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 268 place count 220 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 220 transition count 179
Applied a total of 269 rules in 131 ms. Remains 220 /360 variables (removed 140) and now considering 179/311 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 220/360 places, 179/311 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 854961 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 854961 steps, saw 136575 distinct states, run finished after 3002 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 220 cols
[2023-03-09 19:59:41] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-09 19:59:41] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:59:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:59:41] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 19:59:41] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 19:59:42] [INFO ] After 70ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:42] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-09 19:59:42] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 67 ms.
Support contains 30 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 179/179 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 220/220 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-09 19:59:42] [INFO ] Invariant cache hit.
[2023-03-09 19:59:42] [INFO ] Implicit Places using invariants in 110 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/220 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 128 ms. Remains : 219/220 places, 179/179 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 920134 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 920134 steps, saw 145058 distinct states, run finished after 3001 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 219 cols
[2023-03-09 19:59:45] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 19:59:45] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:59:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2023-03-09 19:59:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-09 19:59:46] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:46] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 19:59:46] [INFO ] After 75ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:46] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 19:59:46] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 94 ms.
Support contains 30 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 219/219 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-09 19:59:46] [INFO ] Invariant cache hit.
[2023-03-09 19:59:46] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 19:59:46] [INFO ] Invariant cache hit.
[2023-03-09 19:59:46] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 19:59:46] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-09 19:59:46] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 19:59:46] [INFO ] Invariant cache hit.
[2023-03-09 19:59:47] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 535 ms. Remains : 219/219 places, 179/179 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 219 transition count 179
Applied a total of 1 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 219 cols
[2023-03-09 19:59:47] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 19:59:47] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 19:59:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 19:59:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2023-03-09 19:59:47] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:47] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-09 19:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 19:59:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-09 19:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 19:59:47] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-09 19:59:47] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-09 19:59:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-09 19:59:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 179 transitions and 881 arcs took 2 ms.
[2023-03-09 19:59:47] [INFO ] Flatten gal took : 46 ms
Total runtime 14681 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: DES_PT_20b
(NrP: 219 NrTr: 179 NrArc: 881)

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

net check time: 0m 0.000sec

init dd package: 0m 2.730sec


before gc: list nodes free: 1983681

after gc: idd nodes used:986322, unused:63013678; list nodes free:276589515

RS generation: 9m16.139sec


-> reachability set: #nodes 983275 (9.8e+05) #states 442,009,985,666,937 (14)



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

checking: AG [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]]
normalized: ~ [E [true U ~ [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]]]]

abstracting: (0<=p4)
states: 442,009,985,666,937 (14)
abstracting: (p4<=0)
states: 416,834,789,378,057 (14)
abstracting: (1<=p95)
states: 175,750,397,425,996 (14)
abstracting: (p95<=1)
states: 442,009,985,666,937 (14)

before gc: list nodes free: 816555

after gc: idd nodes used:2229742, unused:61770258; list nodes free:281376879
MC time: 12m41.023sec

checking: AG [[[[p119<=0 & 0<=p119] | [p104<=1 & 1<=p104]] | [[p13<=0 & 0<=p13] | [[p197<=1 & 1<=p197] | [p139<=0 & 0<=p139]]]]]
normalized: ~ [E [true U ~ [[[[[p139<=0 & 0<=p139] | [p197<=1 & 1<=p197]] | [p13<=0 & 0<=p13]] | [[p104<=1 & 1<=p104] | [p119<=0 & 0<=p119]]]]]]

abstracting: (0<=p119)
states: 442,009,985,666,937 (14)
abstracting: (p119<=0)
states: 370,491,353,787,049 (14)
abstracting: (1<=p104)
states: 57,878,662,957,656 (13)
abstracting: (p104<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p13)
states: 442,009,985,666,937 (14)
abstracting: (p13<=0)
states: 416,816,890,732,697 (14)
abstracting: (1<=p197)
states: 32,662,699,350,476 (13)
abstracting: (p197<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p139)
states: 442,009,985,666,937 (14)
abstracting: (p139<=0)
states: 288,677,794,281,229 (14)

before gc: list nodes free: 1614972

after gc: idd nodes used:3097479, unused:60902521; list nodes free:279500724

before gc: list nodes free: 2439738

after gc: idd nodes used:4641087, unused:59358913; list nodes free:272500764
MC time: 9m30.004sec

checking: AG [[[[p205<=0 & 0<=p205] | [p191<=0 & 0<=p191]] | [[p35<=0 & 0<=p35] | [[p161<=1 & 1<=p161] | [[p193<=0 & 0<=p193] & [p87<=1 & 1<=p87]]]]]]
normalized: ~ [E [true U ~ [[[[[[p87<=1 & 1<=p87] & [p193<=0 & 0<=p193]] | [p161<=1 & 1<=p161]] | [p35<=0 & 0<=p35]] | [[p191<=0 & 0<=p191] | [p205<=0 & 0<=p205]]]]]]

abstracting: (0<=p205)
states: 442,009,985,666,937 (14)
abstracting: (p205<=0)
states: 340,475,701,591,317 (14)
abstracting: (0<=p191)
states: 442,009,985,666,937 (14)
abstracting: (p191<=0)
states: 440,078,996,144,737 (14)
abstracting: (0<=p35)
states: 442,009,985,666,937 (14)
abstracting: (p35<=0)
states: 416,879,231,602,201 (14)
abstracting: (1<=p161)
states: 170,612,867,192,546 (14)
abstracting: (p161<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p193)
states: 442,009,985,666,937 (14)
abstracting: (p193<=0)
states: 412,632,788,681,697 (14)
abstracting: (1<=p87)
states: 147,242,371,278,408 (14)
abstracting: (p87<=1)
states: 442,009,985,666,937 (14)

before gc: list nodes free: 997892

after gc: idd nodes used:6994825, unused:57005175; list nodes free:261948444
MC time: 7m 8.297sec

checking: EF [[[[p99<=1 & 1<=p99] & [p55<=1 & 1<=p55]] | [[[[p0<=0 & 0<=p0] & [p92<=0 & 0<=p92]] & [[p16<=1 & 1<=p16] & [[p51<=1 & 1<=p51] | [[[p108<=0 & 0<=p108] | [p171<=1 & 1<=p171]] & [[[p49<=0 & 0<=p49] | [p181<=1 & 1<=p181]] | [[p27<=0 & 0<=p27] | [[p25<=1 & 1<=p25] | [[p120<=0 & 0<=p120] & [p110<=1 & 1<=p110]]]]]]]]] | [[p33<=1 & 1<=p33] & [[p90<=0 & 0<=p90] | [p82<=1 & 1<=p82]]]]]]
normalized: E [true U [[[[[p82<=1 & 1<=p82] | [p90<=0 & 0<=p90]] & [p33<=1 & 1<=p33]] | [[[[[[[[[p110<=1 & 1<=p110] & [p120<=0 & 0<=p120]] | [p25<=1 & 1<=p25]] | [p27<=0 & 0<=p27]] | [[p181<=1 & 1<=p181] | [p49<=0 & 0<=p49]]] & [[p171<=1 & 1<=p171] | [p108<=0 & 0<=p108]]] | [p51<=1 & 1<=p51]] & [p16<=1 & 1<=p16]] & [[p92<=0 & 0<=p92] & [p0<=0 & 0<=p0]]]] | [[p55<=1 & 1<=p55] & [p99<=1 & 1<=p99]]]]

abstracting: (1<=p99)
states: 132,190,096,492,338 (14)
abstracting: (p99<=1)
states: 442,009,985,666,937 (14)
abstracting: (1<=p55)
states: 24,125,985,601,380 (13)
abstracting: (p55<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p0)
states: 442,009,985,666,937 (14)
abstracting: (p0<=0)
states: 442,009,985,666,936 (14)
abstracting: (0<=p92)
states: 442,009,985,666,937 (14)
abstracting: (p92<=0)
states: 368,363,768,899,569 (14)
abstracting: (1<=p16)
states: 25,192,942,823,584 (13)
abstracting: (p16<=1)
states: 442,009,985,666,937 (14)
abstracting: (1<=p51)
states: 24,125,985,601,380 (13)
abstracting: (p51<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p108)
states: 442,009,985,666,937 (14)
abstracting: (p108<=0)
states: 401,721,573,902,413 (14)
abstracting: (1<=p171)
states: 19,526,567,152,836 (13)
abstracting: (p171<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p49)
states: 442,009,985,666,937 (14)
abstracting: (p49<=0)
states: 417,884,000,065,557 (14)
abstracting: (1<=p181)
states: 238,356,948,539,492 (14)
abstracting: (p181<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p27)
states: 442,009,985,666,937 (14)
abstracting: (p27<=0)
states: 416,816,890,732,697 (14)
abstracting: (1<=p25)
states: 25,193,094,934,240 (13)
abstracting: (p25<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p120)
states: 442,009,985,666,937 (14)
abstracting: (p120<=0)
states: 370,491,353,787,049 (14)
abstracting: (1<=p110)
states: 38,275,266,667,960 (13)
abstracting: (p110<=1)
states: 442,009,985,666,937 (14)
abstracting: (1<=p33)
states: 25,193,094,934,240 (13)
abstracting: (p33<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p90)
states: 442,009,985,666,937 (14)
abstracting: (p90<=0)
states: 368,363,768,899,569 (14)
abstracting: (1<=p82)
states: 8
abstracting: (p82<=1)
states: 442,009,985,666,937 (14)

before gc: list nodes free: 4794031

after gc: idd nodes used:9651176, unused:54348824; list nodes free:249840202
MC time: 5m21.126sec

checking: AG [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]]
normalized: ~ [E [true U ~ [[[p4<=0 & 0<=p4] | [p95<=1 & 1<=p95]]]]]

abstracting: (1<=p95)
states: 175,750,397,425,996 (14)
abstracting: (p95<=1)
states: 442,009,985,666,937 (14)
abstracting: (0<=p4)
states: 442,009,985,666,937 (14)
abstracting: (p4<=0)
states: 416,834,789,378,057 (14)

before gc: list nodes free: 3532967

after gc: idd nodes used:9882189, unused:54117811; list nodes free:248845295

before gc: list nodes free: 1110649

after gc: idd nodes used:10683983, unused:53316017; list nodes free:245195534
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5958332 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100236 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.202303021504.jar
+ 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 0.000sec

61209 60989 59632 184572 681568 919172 930067 953746 955755 968918 1060402 964413 1037837 982682 999722 1060195
iterations count:1696354 (9476), effective:174785 (976)

initing FirstDep: 0m 0.002sec

1244279 1892131
sat_reach.icc:155: Timeout: after 760 sec


sat_reach.icc:155: Timeout: after 569 sec


sat_reach.icc:155: Timeout: after 427 sec


sat_reach.icc:155: Timeout: after 320 sec

1244279 1892131

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

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