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-167813696200735.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-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 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 9.8M 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-040-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678746367469

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:26:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 22:26:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:26:10] [INFO ] Load time of PNML (sax parser for PT used): 487 ms
[2023-03-13 22:26:10] [INFO ] Transformed 3684 places.
[2023-03-13 22:26:10] [INFO ] Transformed 9840 transitions.
[2023-03-13 22:26:10] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 703 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-13 22:26:12] [INFO ] Computed 43 place invariants in 433 ms
[2023-03-13 22:26:14] [INFO ] [Real]Absence check using 41 positive place invariants in 78 ms returned sat
[2023-03-13 22:26:14] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 44 ms returned sat
[2023-03-13 22:26:14] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 22:26:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 81 ms returned sat
[2023-03-13 22:26:16] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 85 ms returned sat
[2023-03-13 22:26:31] [INFO ] After 13332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 22:26:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-13 22:26:39] [INFO ] After 8004ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-13 22:26:39] [INFO ] After 8013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 22:26:39] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1083 ms.
Support contains 133 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 3683 transition count 9662
Reduce places removed 178 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 219 rules applied. Total rules applied 398 place count 3505 transition count 9621
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 439 place count 3464 transition count 9621
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 439 place count 3464 transition count 9606
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 469 place count 3449 transition count 9606
Performed 1491 Post agglomeration using F-continuation condition.Transition count delta: 1491
Deduced a syphon composed of 1491 places in 21 ms
Reduce places removed 1491 places and 0 transitions.
Iterating global reduction 3 with 2982 rules applied. Total rules applied 3451 place count 1958 transition count 8115
Drop transitions removed 1430 transitions
Redundant transition composition rules discarded 1430 transitions
Iterating global reduction 3 with 1430 rules applied. Total rules applied 4881 place count 1958 transition count 6685
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4882 place count 1958 transition count 6684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4883 place count 1957 transition count 6684
Partial Free-agglomeration rule applied 1576 times.
Drop transitions removed 1576 transitions
Iterating global reduction 4 with 1576 rules applied. Total rules applied 6459 place count 1957 transition count 6684
Partial Free-agglomeration rule applied 556 times.
Drop transitions removed 556 transitions
Iterating global reduction 4 with 556 rules applied. Total rules applied 7015 place count 1957 transition count 6684
Applied a total of 7015 rules in 2971 ms. Remains 1957 /3684 variables (removed 1727) and now considering 6684/9840 (removed 3156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2973 ms. Remains : 1957/3684 places, 6684/9840 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 10) seen :3
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 6684 rows 1957 cols
[2023-03-13 22:26:44] [INFO ] Computed 42 place invariants in 318 ms
[2023-03-13 22:26:45] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-13 22:26:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-13 22:26:45] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 22:26:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-13 22:26:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-13 22:26:50] [INFO ] After 4470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 22:26:50] [INFO ] State equation strengthened by 6151 read => feed constraints.
[2023-03-13 22:26:54] [INFO ] After 4279ms SMT Verify possible using 6151 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:26:58] [INFO ] After 7838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2523 ms.
[2023-03-13 22:27:00] [INFO ] After 15603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 196 ms.
Support contains 101 out of 1957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1957/1957 places, 6684/6684 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1957 transition count 6683
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 1956 transition count 6681
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1954 transition count 6681
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 44 place count 1935 transition count 6662
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 1935 transition count 6662
Applied a total of 52 rules in 865 ms. Remains 1935 /1957 variables (removed 22) and now considering 6662/6684 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 865 ms. Remains : 1935/1957 places, 6662/6684 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :2
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6662 rows 1935 cols
[2023-03-13 22:27:02] [INFO ] Computed 42 place invariants in 232 ms
[2023-03-13 22:27:03] [INFO ] [Real]Absence check using 40 positive place invariants in 108 ms returned sat
[2023-03-13 22:27:03] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-13 22:27:03] [INFO ] After 919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:27:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2023-03-13 22:27:03] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-13 22:27:07] [INFO ] After 3608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:27:07] [INFO ] State equation strengthened by 6223 read => feed constraints.
[2023-03-13 22:27:11] [INFO ] After 3348ms SMT Verify possible using 6223 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:27:13] [INFO ] After 5665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2078 ms.
[2023-03-13 22:27:15] [INFO ] After 11973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 45 ms.
Support contains 85 out of 1935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1935/1935 places, 6662/6662 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1928 transition count 6655
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1928 transition count 6655
Applied a total of 20 rules in 551 ms. Remains 1928 /1935 variables (removed 7) and now considering 6655/6662 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 1928/1935 places, 6655/6662 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 4) seen :2
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6655 rows 1928 cols
[2023-03-13 22:27:16] [INFO ] Computed 42 place invariants in 183 ms
[2023-03-13 22:27:17] [INFO ] [Real]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-13 22:27:17] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-13 22:27:20] [INFO ] After 3617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 22:27:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-13 22:27:20] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-13 22:27:23] [INFO ] After 2687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:23] [INFO ] State equation strengthened by 6273 read => feed constraints.
[2023-03-13 22:27:26] [INFO ] After 3144ms SMT Verify possible using 6273 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:28] [INFO ] After 4388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 902 ms.
[2023-03-13 22:27:29] [INFO ] After 8611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 62 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 6655/6655 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1915 transition count 6642
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1915 transition count 6642
Applied a total of 32 rules in 622 ms. Remains 1915 /1928 variables (removed 13) and now considering 6642/6655 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 1915/1928 places, 6642/6655 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 90812 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90812 steps, saw 29920 distinct states, run finished after 3006 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6642 rows 1915 cols
[2023-03-13 22:27:33] [INFO ] Computed 42 place invariants in 133 ms
[2023-03-13 22:27:33] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-13 22:27:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-13 22:27:33] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 22:27:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-13 22:27:34] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-13 22:27:37] [INFO ] After 2819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:37] [INFO ] State equation strengthened by 6296 read => feed constraints.
[2023-03-13 22:27:39] [INFO ] After 2396ms SMT Verify possible using 6296 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:40] [INFO ] After 3555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2023-03-13 22:27:41] [INFO ] After 7901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 62 out of 1915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 6642/6642 transitions.
Applied a total of 0 rules in 192 ms. Remains 1915 /1915 variables (removed 0) and now considering 6642/6642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 1915/1915 places, 6642/6642 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 6642/6642 transitions.
Applied a total of 0 rules in 226 ms. Remains 1915 /1915 variables (removed 0) and now considering 6642/6642 (removed 0) transitions.
[2023-03-13 22:27:42] [INFO ] Invariant cache hit.
[2023-03-13 22:27:44] [INFO ] Implicit Places using invariants in 2753 ms returned []
[2023-03-13 22:27:44] [INFO ] Invariant cache hit.
[2023-03-13 22:27:46] [INFO ] State equation strengthened by 6296 read => feed constraints.
[2023-03-13 22:27:46] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 4347 ms to find 0 implicit places.
[2023-03-13 22:27:47] [INFO ] Redundant transitions in 683 ms returned []
[2023-03-13 22:27:47] [INFO ] Invariant cache hit.
[2023-03-13 22:27:51] [INFO ] Dead Transitions using invariants and state equation in 3831 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9104 ms. Remains : 1915/1915 places, 6642/6642 transitions.
Graph (trivial) has 5950 edges and 1915 vertex of which 1537 / 1915 are part of one of the 2 SCC in 5 ms
Free SCC test removed 1535 places
Drop transitions removed 4209 transitions
Ensure Unique test removed 1599 transitions
Reduce isomorphic transitions removed 5808 transitions.
Graph (complete) has 1077 edges and 380 vertex of which 347 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 132 place count 217 transition count 505
Iterating global reduction 0 with 130 rules applied. Total rules applied 262 place count 217 transition count 505
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 361 place count 217 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 363 place count 216 transition count 405
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 403 place count 216 transition count 365
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 409 place count 213 transition count 362
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 417 place count 213 transition count 354
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 432 place count 213 transition count 339
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 448 place count 198 transition count 338
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 454 place count 192 transition count 332
Iterating global reduction 2 with 6 rules applied. Total rules applied 460 place count 192 transition count 332
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 463 place count 189 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 466 place count 189 transition count 326
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 467 place count 189 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 468 place count 188 transition count 325
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 484 place count 188 transition count 325
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 485 place count 188 transition count 324
Applied a total of 485 rules in 211 ms. Remains 188 /1915 variables (removed 1727) and now considering 324/6642 (removed 6318) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 324 rows 188 cols
[2023-03-13 22:27:51] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-13 22:27:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 22:27:51] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 22:27:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 22:27:51] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:27:51] [INFO ] After 60ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:51] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-13 22:27:51] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 22:27:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 22:27:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1915 places, 6642 transitions and 26234 arcs took 28 ms.
[2023-03-13 22:27:52] [INFO ] Flatten gal took : 317 ms
Total runtime 102546 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 1915 NrTr: 6642 NrArc: 26234)

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

net check time: 0m 0.006sec

init dd package: 0m 3.135sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9478216 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16086296 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.105sec

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-040"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CANInsertWithFailure-PT-040, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696200735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;