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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 115K 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-40b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678401894100

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-40b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 22:44:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 22:44:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:44:55] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-09 22:44:55] [INFO ] Transformed 439 places.
[2023-03-09 22:44:55] [INFO ] Transformed 390 transitions.
[2023-03-09 22:44:55] [INFO ] Found NUPN structural information;
[2023-03-09 22:44:56] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 10) seen :6
FORMULA DES-PT-40b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 390 rows 439 cols
[2023-03-09 22:44:56] [INFO ] Computed 65 place invariants in 33 ms
[2023-03-09 22:44:56] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:44:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-09 22:44:57] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-09 22:44:58] [INFO ] After 1016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:44:59] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 5 ms to minimize.
[2023-03-09 22:44:59] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2023-03-09 22:44:59] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-09 22:44:59] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-09 22:44:59] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1393 ms
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2023-03-09 22:45:00] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 0 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 703 ms
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-09 22:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 22:45:01] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:45:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-09 22:45:02] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-03-09 22:45:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 304 ms
[2023-03-09 22:45:02] [INFO ] After 4217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-09 22:45:02] [INFO ] After 5603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 396 ms.
Support contains 18 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 433 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 433 transition count 367
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 414 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 413 transition count 366
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 42 place count 413 transition count 358
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 58 place count 405 transition count 358
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 77 place count 386 transition count 339
Iterating global reduction 3 with 19 rules applied. Total rules applied 96 place count 386 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 386 transition count 338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 385 transition count 338
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 113 place count 370 transition count 323
Iterating global reduction 3 with 15 rules applied. Total rules applied 128 place count 370 transition count 323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 15 rules applied. Total rules applied 143 place count 370 transition count 308
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 146 place count 368 transition count 307
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 146 place count 368 transition count 304
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 152 place count 365 transition count 304
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 5 with 138 rules applied. Total rules applied 290 place count 296 transition count 235
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 294 transition count 237
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 294 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 298 place count 292 transition count 235
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 292 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 302 place count 290 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 289 transition count 232
Applied a total of 303 rules in 212 ms. Remains 289 /439 variables (removed 150) and now considering 232/390 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 289/439 places, 232/390 transitions.
Incomplete random walk after 10000 steps, including 347 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 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 60 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 770090 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 770090 steps, saw 111479 distinct states, run finished after 3002 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 232 rows 289 cols
[2023-03-09 22:45:06] [INFO ] Computed 63 place invariants in 13 ms
[2023-03-09 22:45:06] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:45:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2023-03-09 22:45:06] [INFO ] [Nat]Absence check using 34 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-09 22:45:06] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 22:45:06] [INFO ] After 139ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-09 22:45:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-09 22:45:07] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-09 22:45:07] [INFO ] After 1285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 167 ms.
Support contains 18 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 232/232 transitions.
Applied a total of 0 rules in 10 ms. Remains 289 /289 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 289/289 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 289 /289 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-09 22:45:07] [INFO ] Invariant cache hit.
[2023-03-09 22:45:08] [INFO ] Implicit Places using invariants in 259 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 288/289 places, 232/232 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 282 ms. Remains : 288/289 places, 232/232 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 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 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 816684 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 816684 steps, saw 116968 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 232 rows 288 cols
[2023-03-09 22:45:11] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-09 22:45:11] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:45:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-09 22:45:11] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 22:45:11] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 22:45:12] [INFO ] After 173ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-09 22:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 22:45:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-09 22:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-09 22:45:12] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 22:45:12] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-09 22:45:12] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 199 ms.
Support contains 18 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 288/288 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-09 22:45:12] [INFO ] Invariant cache hit.
[2023-03-09 22:45:13] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 22:45:13] [INFO ] Invariant cache hit.
[2023-03-09 22:45:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 22:45:13] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-09 22:45:13] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 22:45:13] [INFO ] Invariant cache hit.
[2023-03-09 22:45:13] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 288/288 places, 232/232 transitions.
Applied a total of 0 rules in 14 ms. Remains 288 /288 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-09 22:45:13] [INFO ] Invariant cache hit.
[2023-03-09 22:45:13] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 22:45:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 22:45:13] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 22:45:13] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-09 22:45:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-09 22:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-09 22:45:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-09 22:45:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2023-03-09 22:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-09 22:45:14] [INFO ] After 615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-09 22:45:14] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-09 22:45:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 22:45:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 288 places, 232 transitions and 1138 arcs took 2 ms.
[2023-03-09 22:45:14] [INFO ] Flatten gal took : 53 ms
Total runtime 19046 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_40b
(NrP: 288 NrTr: 232 NrArc: 1138)

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

net check time: 0m 0.000sec

init dd package: 0m 2.774sec


RS generation: 2m28.913sec


-> reachability set: #nodes 427060 (4.3e+05) #states 89,135,188,314,353 (13)



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

checking: EF [[[1<=p54 & p54<=1] & [p216<=0 & 0<=p216]]]
normalized: E [true U [[p216<=0 & 0<=p216] & [1<=p54 & p54<=1]]]

abstracting: (p54<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p54)
states: 2,371,313,129,876 (12)
abstracting: (0<=p216)
states: 89,135,188,314,353 (13)
abstracting: (p216<=0)
states: 60,986,252,894,083 (13)

before gc: list nodes free: 1088820

after gc: idd nodes used:951355, unused:63048645; list nodes free:276721074

before gc: list nodes free: 6015489

after gc: idd nodes used:1299693, unused:62700307; list nodes free:275171195
-> the formula is TRUE

FORMULA DES-PT-40b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m49.123sec

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

abstracting: (p266<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p266)
states: 1,480,592,238,416 (12)
abstracting: (0<=p28)
states: 89,135,188,314,353 (13)
abstracting: (p28<=0)
states: 86,763,875,184,477 (13)

before gc: list nodes free: 3894004

after gc: idd nodes used:1205847, unused:62794153; list nodes free:275579526
-> the formula is FALSE

FORMULA DES-PT-40b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 7.594sec

checking: AG [[[[[[[1<=p104 & p104<=1] & [0<=p191 & p191<=0]] | [1<=p246 & p246<=1]] | [p197<=1 & 1<=p197]] & [[p53<=0 & 0<=p53] | [p181<=1 & 1<=p181]]] | [p113<=0 & 0<=p113]]]
normalized: ~ [E [true U ~ [[[[[p181<=1 & 1<=p181] | [p53<=0 & 0<=p53]] & [[p197<=1 & 1<=p197] | [[1<=p246 & p246<=1] | [[0<=p191 & p191<=0] & [1<=p104 & p104<=1]]]]] | [p113<=0 & 0<=p113]]]]]

abstracting: (0<=p113)
states: 89,135,188,314,353 (13)
abstracting: (p113<=0)
states: 86,851,731,576,225 (13)
abstracting: (p104<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p104)
states: 2,283,456,738,128 (12)
abstracting: (p191<=0)
states: 55,357,107,573,729 (13)
abstracting: (0<=p191)
states: 89,135,188,314,353 (13)
abstracting: (p246<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p246)
states: 50,022,404,174,099 (13)
abstracting: (1<=p197)
states: 274
abstracting: (p197<=1)
states: 89,135,188,314,353 (13)
abstracting: (0<=p53)
states: 89,135,188,314,353 (13)
abstracting: (p53<=0)
states: 86,763,875,184,477 (13)
abstracting: (1<=p181)
states: 9,677,193,536,086 (12)
abstracting: (p181<=1)
states: 89,135,188,314,353 (13)

before gc: list nodes free: 5133477

after gc: idd nodes used:1927605, unused:62072395; list nodes free:272222845

before gc: list nodes free: 12177772

after gc: idd nodes used:2148504, unused:61851496; list nodes free:271227768

before gc: list nodes free: 12613332

after gc: idd nodes used:2213377, unused:61786623; list nodes free:270939827

before gc: list nodes free: 7575903

after gc: idd nodes used:2569754, unused:61430246; list nodes free:269375273
-> the formula is FALSE

FORMULA DES-PT-40b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 18m 7.701sec

checking: AG [[[[[[[1<=p93 & p93<=1] | [0<=p43 & p43<=0]] & [1<=p280 & p280<=1]] & [p226<=0 & 0<=p226]] | [[p208<=1 & 1<=p208] & [0<=p196 & p196<=0]]] | [p123<=0 & 0<=p123]]]
normalized: ~ [E [true U ~ [[[p123<=0 & 0<=p123] | [[[0<=p196 & p196<=0] & [p208<=1 & 1<=p208]] | [[p226<=0 & 0<=p226] & [[1<=p280 & p280<=1] & [[0<=p43 & p43<=0] | [1<=p93 & p93<=1]]]]]]]]]

abstracting: (p93<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p93)
states: 2,283,456,738,128 (12)
abstracting: (p43<=0)
states: 86,763,886,819,821 (13)
abstracting: (0<=p43)
states: 89,135,188,314,353 (13)
abstracting: (p280<=1)
states: 89,135,188,314,353 (13)
abstracting: (1<=p280)
states: 9,644,530,249,974 (12)
abstracting: (0<=p226)
states: 89,135,188,314,353 (13)
abstracting: (p226<=0)
states: 89,135,174,135,339 (13)
abstracting: (1<=p208)
states: 16,518,325,731,841 (13)
abstracting: (p208<=1)
states: 89,135,188,314,353 (13)
abstracting: (p196<=0)
states: 45,138,458,341,709 (13)
abstracting: (0<=p196)
states: 89,135,188,314,353 (13)
abstracting: (0<=p123)
states: 89,135,188,314,353 (13)
abstracting: (p123<=0)
states: 88,657,235,738,553 (13)

before gc: list nodes free: 2602881

after gc: idd nodes used:2934869, unused:61065131; list nodes free:267817408

before gc: list nodes free: 3502241

after gc: idd nodes used:3183556, unused:60816444; list nodes free:266720745

before gc: list nodes free: 6264976

after gc: idd nodes used:3311613, unused:60688387; list nodes free:266159153
-> the formula is FALSE

FORMULA DES-PT-40b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 18m50.563sec

totally nodes used: 676265416 (6.8e+08)
number of garbage collections: 10
fire ops cache: hits/miss/sum: 1437072255 1780113485 3217185740
used/not used/entry size/cache size: 67040773 68091 16 1024MB
basic ops cache: hits/miss/sum: 167339534 711419134 878758668
used/not used/entry size/cache size: 16693680 83536 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: 1065679 3608471 4674150
used/not used/entry size/cache size: 0 8388608 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 29306708
1 23113773
2 10395053
3 3295112
4 805591
5 160787
6 27395
7 3917
8 473
9 49
>= 10 6

Total processing time: 51m39.152sec


BK_STOP 1678405014860

--------------------
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

52149 52320 231650 307151 301073 320720 360767 351692 369271 409810 396295 410746 436817 430732
iterations count:1407812 (6068), effective:121823 (525)

initing FirstDep: 0m 0.000sec

578573 755229 774464 778791 809477 829051 849503 918415
iterations count:829025 (3573), effective:68061 (293)
595693 673787 742247
iterations count:365769 (1576), effective:29626 (127)
1175149
iterations count:170581 (735), effective:12389 (53)
710455 760040 879796 909771 925571 940758 958671 975790 995563 1015124 1035661 1060778
iterations count:1277542 (5506), effective:105100 (453)

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

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