Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696200750.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 22M 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 CANInsertWithFailure-PT-060-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678747429826

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=CANInsertWithFailure-PT-060
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 22:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:43:52] [INFO ] Load time of PNML (sax parser for PT used): 538 ms
[2023-03-13 22:43:52] [INFO ] Transformed 7924 places.
[2023-03-13 22:43:52] [INFO ] Transformed 21960 transitions.
[2023-03-13 22:43:52] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 745 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21960 rows 7924 cols
[2023-03-13 22:43:56] [INFO ] Computed 63 place invariants in 2612 ms
[2023-03-13 22:43:59] [INFO ] After 2958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 22:44:02] [INFO ] [Nat]Absence check using 61 positive place invariants in 150 ms returned sat
[2023-03-13 22:44:02] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 138 ms returned sat
[2023-03-13 22:44:22] [INFO ] After 17916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 22:44:22] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-13 22:44:24] [INFO ] After 1985ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-13 22:44:24] [INFO ] After 1987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 22:44:24] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 370 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.39 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 357 place count 7923 transition count 21604
Reduce places removed 356 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 379 rules applied. Total rules applied 736 place count 7567 transition count 21581
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 759 place count 7544 transition count 21572
Deduced a syphon composed of 9 places in 21 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 777 place count 7535 transition count 21572
Performed 3202 Post agglomeration using F-continuation condition.Transition count delta: 3202
Deduced a syphon composed of 3202 places in 7 ms
Reduce places removed 3202 places and 0 transitions.
Iterating global reduction 3 with 6404 rules applied. Total rules applied 7181 place count 4333 transition count 18370
Drop transitions removed 3105 transitions
Redundant transition composition rules discarded 3105 transitions
Iterating global reduction 3 with 3105 rules applied. Total rules applied 10286 place count 4333 transition count 15265
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10294 place count 4333 transition count 15257
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10302 place count 4325 transition count 15257
Partial Free-agglomeration rule applied 3880 times.
Drop transitions removed 3880 transitions
Iterating global reduction 4 with 3880 rules applied. Total rules applied 14182 place count 4325 transition count 15257
Partial Free-agglomeration rule applied 411 times.
Drop transitions removed 411 transitions
Iterating global reduction 4 with 411 rules applied. Total rules applied 14593 place count 4325 transition count 15257
Applied a total of 14593 rules in 7622 ms. Remains 4325 /7924 variables (removed 3599) and now considering 15257/21960 (removed 6703) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7624 ms. Remains : 4325/7924 places, 15257/21960 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 13) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 15257 rows 4325 cols
[2023-03-13 22:44:33] [INFO ] Computed 62 place invariants in 638 ms
[2023-03-13 22:44:34] [INFO ] After 1089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 22:44:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 58 ms returned sat
[2023-03-13 22:44:36] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 64 ms returned sat
[2023-03-13 22:44:52] [INFO ] After 15619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 22:44:53] [INFO ] State equation strengthened by 12853 read => feed constraints.
[2023-03-13 22:44:59] [INFO ] After 6846ms SMT Verify possible using 12853 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-13 22:44:59] [INFO ] After 6848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 22:44:59] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 761 ms.
Support contains 279 out of 4325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4325/4325 places, 15257/15257 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 0 with 2 rules applied. Total rules applied 2 place count 4325 transition count 15255
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 4323 transition count 15254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 4322 transition count 15254
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 92 place count 4279 transition count 15211
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 4279 transition count 15209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 4279 transition count 15208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 4278 transition count 15208
Partial Free-agglomeration rule applied 112 times.
Drop transitions removed 112 transitions
Iterating global reduction 4 with 112 rules applied. Total rules applied 208 place count 4278 transition count 15208
Applied a total of 208 rules in 3463 ms. Remains 4278 /4325 variables (removed 47) and now considering 15208/15257 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3463 ms. Remains : 4278/4325 places, 15208/15257 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 11) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15208 rows 4278 cols
[2023-03-13 22:45:05] [INFO ] Computed 62 place invariants in 650 ms
[2023-03-13 22:45:06] [INFO ] After 1116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:45:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2023-03-13 22:45:07] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 74 ms returned sat
[2023-03-13 22:45:21] [INFO ] After 12542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 22:45:21] [INFO ] State equation strengthened by 13199 read => feed constraints.
[2023-03-13 22:45:31] [INFO ] After 10366ms SMT Verify possible using 13199 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:45:31] [INFO ] After 10367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 22:45:31] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 389 ms.
Support contains 273 out of 4278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4278/4278 places, 15208/15208 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 4275 transition count 15205
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 4275 transition count 15205
Applied a total of 10 rules in 2055 ms. Remains 4275 /4278 variables (removed 3) and now considering 15205/15208 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2055 ms. Remains : 4275/4278 places, 15205/15208 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 15205 rows 4275 cols
[2023-03-13 22:45:35] [INFO ] Computed 62 place invariants in 589 ms
[2023-03-13 22:45:36] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 22:45:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2023-03-13 22:45:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-13 22:45:50] [INFO ] After 12328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 22:45:50] [INFO ] State equation strengthened by 13326 read => feed constraints.
[2023-03-13 22:46:01] [INFO ] After 10934ms SMT Verify possible using 13326 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 22:46:01] [INFO ] After 10935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 22:46:01] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 392 ms.
Support contains 261 out of 4275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4275/4275 places, 15205/15205 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 4270 transition count 15200
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 4270 transition count 15200
Applied a total of 17 rules in 2522 ms. Remains 4270 /4275 variables (removed 5) and now considering 15200/15205 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2522 ms. Remains : 4270/4275 places, 15200/15205 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 71076 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71076 steps, saw 51260 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 15200 rows 4270 cols
[2023-03-13 22:46:08] [INFO ] Computed 62 place invariants in 698 ms
[2023-03-13 22:46:09] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 22:46:10] [INFO ] [Nat]Absence check using 60 positive place invariants in 57 ms returned sat
[2023-03-13 22:46:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-13 22:46:23] [INFO ] After 11748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 22:46:23] [INFO ] State equation strengthened by 13342 read => feed constraints.
[2023-03-13 22:46:35] [INFO ] After 11541ms SMT Verify possible using 13342 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 22:46:35] [INFO ] After 11543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-13 22:46:35] [INFO ] After 25103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 331 ms.
Support contains 261 out of 4270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4270/4270 places, 15200/15200 transitions.
Applied a total of 0 rules in 696 ms. Remains 4270 /4270 variables (removed 0) and now considering 15200/15200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 4270/4270 places, 15200/15200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4270/4270 places, 15200/15200 transitions.
Applied a total of 0 rules in 697 ms. Remains 4270 /4270 variables (removed 0) and now considering 15200/15200 (removed 0) transitions.
[2023-03-13 22:46:36] [INFO ] Invariant cache hit.
[2023-03-13 22:46:39] [INFO ] Implicit Places using invariants in 2758 ms returned []
Implicit Place search using SMT only with invariants took 2759 ms to find 0 implicit places.
[2023-03-13 22:46:39] [INFO ] Invariant cache hit.
[2023-03-13 22:46:45] [INFO ] Dead Transitions using invariants and state equation in 6349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9808 ms. Remains : 4270/4270 places, 15200/15200 transitions.
Graph (trivial) has 12620 edges and 4270 vertex of which 2707 / 4270 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2705 places
Drop transitions removed 7007 transitions
Ensure Unique test removed 3212 transitions
Reduce isomorphic transitions removed 10219 transitions.
Graph (complete) has 5379 edges and 1565 vertex of which 1413 are kept as prefixes of interest. Removing 152 places using SCC suffix rule.1 ms
Discarding 152 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Drop transitions removed 490 transitions
Reduce isomorphic transitions removed 490 transitions.
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 1413 transition count 4448
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 492 place count 1413 transition count 4444
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 500 place count 1409 transition count 4444
Discarding 668 places :
Symmetric choice reduction at 1 with 668 rule applications. Total rules 1168 place count 741 transition count 2787
Iterating global reduction 1 with 668 rules applied. Total rules applied 1836 place count 741 transition count 2787
Ensure Unique test removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 1 with 551 rules applied. Total rules applied 2387 place count 741 transition count 2236
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 2463 place count 665 transition count 2084
Iterating global reduction 2 with 76 rules applied. Total rules applied 2539 place count 665 transition count 2084
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 2615 place count 665 transition count 2008
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2617 place count 664 transition count 2007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2618 place count 664 transition count 2006
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 2649 place count 664 transition count 1975
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 2650 place count 664 transition count 1974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2651 place count 663 transition count 1974
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 6 with 4 rules applied. Total rules applied 2655 place count 661 transition count 1972
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2657 place count 661 transition count 1970
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2658 place count 661 transition count 1969
Free-agglomeration rule applied 296 times with reduction of 13 identical transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 2954 place count 661 transition count 1660
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 7 with 696 rules applied. Total rules applied 3650 place count 365 transition count 1260
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 3687 place count 365 transition count 1223
Partial Free-agglomeration rule applied 204 times.
Drop transitions removed 204 transitions
Iterating global reduction 8 with 204 rules applied. Total rules applied 3891 place count 365 transition count 1223
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3895 place count 361 transition count 1219
Iterating global reduction 8 with 4 rules applied. Total rules applied 3899 place count 361 transition count 1219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3900 place count 361 transition count 1219
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 3905 place count 356 transition count 1214
Applied a total of 3905 rules in 1028 ms. Remains 356 /4270 variables (removed 3914) and now considering 1214/15200 (removed 13986) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1214 rows 356 cols
[2023-03-13 22:46:47] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 22:46:47] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 22:46:48] [INFO ] After 1378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-13 22:46:49] [INFO ] After 1963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-13 22:46:49] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 22:46:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4270 places, 15200 transitions and 58662 arcs took 78 ms.
[2023-03-13 22:46:50] [INFO ] Flatten gal took : 515 ms
Total runtime 178491 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: gen
(NrP: 4270 NrTr: 15200 NrArc: 58662)

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

net check time: 0m 0.018sec

init dd package: 0m 3.067sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 9659708 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16066908 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.689sec

134061 811364

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="CANInsertWithFailure-PT-060"
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 CANInsertWithFailure-PT-060, 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 r042-tajo-167813696200750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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