About the Execution of Marcie+red for ShieldIIPt-PT-100A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10056.063 | 3600000.00 | 3692787.00 | 110.00 | TTTTFFF?FF???TT? | normal |
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.r394-oct2-167903717800342.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800342
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.8K Feb 25 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 539K Mar 5 18:23 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 ShieldIIPt-PT-100A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679506465859
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=ShieldIIPt-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:34:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:34:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:34:28] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-22 17:34:28] [INFO ] Transformed 1903 places.
[2023-03-22 17:34:28] [INFO ] Transformed 1403 transitions.
[2023-03-22 17:34:28] [INFO ] Found NUPN structural information;
[2023-03-22 17:34:29] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 118236 steps, run timeout after 6003 ms. (steps per millisecond=19 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1, 6=1, 10=1, 11=1}
Probabilistic random walk after 118236 steps, saw 116966 distinct states, run finished after 6005 ms. (steps per millisecond=19 ) properties seen :8
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-22 17:34:37] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-22 17:34:38] [INFO ] [Real]Absence check using 901 positive place invariants in 285 ms returned sat
[2023-03-22 17:34:38] [INFO ] After 1129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:34:39] [INFO ] [Nat]Absence check using 901 positive place invariants in 193 ms returned sat
[2023-03-22 17:34:44] [INFO ] After 4760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:34:48] [INFO ] After 8469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2306 ms.
[2023-03-22 17:34:50] [INFO ] After 11679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1229 ms.
Support contains 78 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 49 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 186 times.
Drop transitions removed 186 transitions
Iterating global reduction 0 with 186 rules applied. Total rules applied 190 place count 1901 transition count 1400
Applied a total of 190 rules in 482 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 63666 steps, run timeout after 3003 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63666 steps, saw 62384 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-22 17:34:56] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-22 17:34:57] [INFO ] [Real]Absence check using 901 positive place invariants in 245 ms returned sat
[2023-03-22 17:34:57] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:34:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 260 ms returned sat
[2023-03-22 17:35:01] [INFO ] After 3448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:35:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 17:35:03] [INFO ] After 1626ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:35:08] [INFO ] After 6219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1871 ms.
[2023-03-22 17:35:10] [INFO ] After 12529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1073 ms.
Support contains 78 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 80 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 122 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-22 17:35:11] [INFO ] Invariant cache hit.
[2023-03-22 17:35:12] [INFO ] Implicit Places using invariants in 1603 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1606 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 77 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-22 17:35:12] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-22 17:35:14] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-22 17:35:14] [INFO ] Invariant cache hit.
[2023-03-22 17:35:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-22 17:35:20] [INFO ] Implicit Places using invariants and state equation in 6520 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7658 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 125 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-22 17:35:20] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-22 17:35:22] [INFO ] Implicit Places using invariants in 1525 ms returned []
[2023-03-22 17:35:22] [INFO ] Invariant cache hit.
[2023-03-22 17:35:23] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-22 17:35:26] [INFO ] Implicit Places using invariants and state equation in 4209 ms returned []
Implicit Place search using SMT with State Equation took 5758 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 15346 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75585 steps, run timeout after 3006 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75585 steps, saw 74241 distinct states, run finished after 3006 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 17:35:30] [INFO ] Invariant cache hit.
[2023-03-22 17:35:31] [INFO ] [Real]Absence check using 898 positive place invariants in 304 ms returned sat
[2023-03-22 17:35:31] [INFO ] After 745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:35:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 806 ms returned sat
[2023-03-22 17:35:35] [INFO ] After 2594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:35:35] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-22 17:35:42] [INFO ] After 7550ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:35:45] [INFO ] After 10097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1948 ms.
[2023-03-22 17:35:47] [INFO ] After 16077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1529 ms.
Support contains 78 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 127 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 103 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-22 17:35:49] [INFO ] Invariant cache hit.
[2023-03-22 17:35:50] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-22 17:35:50] [INFO ] Invariant cache hit.
[2023-03-22 17:35:51] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-22 17:35:55] [INFO ] Implicit Places using invariants and state equation in 4819 ms returned []
Implicit Place search using SMT with State Equation took 5879 ms to find 0 implicit places.
[2023-03-22 17:35:55] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-22 17:35:55] [INFO ] Invariant cache hit.
[2023-03-22 17:35:56] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7389 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 1896 transition count 1398
Drop transitions removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 1896 transition count 1312
Applied a total of 172 rules in 230 ms. Remains 1896 /1896 variables (removed 0) and now considering 1312/1398 (removed 86) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1312 rows 1896 cols
[2023-03-22 17:35:56] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-22 17:35:57] [INFO ] [Real]Absence check using 898 positive place invariants in 288 ms returned sat
[2023-03-22 17:35:57] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:35:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 295 ms returned sat
[2023-03-22 17:36:01] [INFO ] After 2878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:36:02] [INFO ] After 4416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1354 ms.
[2023-03-22 17:36:04] [INFO ] After 6761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:36:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-22 17:36:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1896 places, 1398 transitions and 6448 arcs took 9 ms.
[2023-03-22 17:36:04] [INFO ] Flatten gal took : 284 ms
Total runtime 96302 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: ShieldIIPt_PT_100A
(NrP: 1896 NrTr: 1398 NrArc: 6448)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.269sec
net check time: 0m 0.000sec
init dd package: 0m 2.923sec
before gc: list nodes free: 1121178
after gc: idd nodes used:113927, unused:63886073; list nodes free:290936949
before gc: list nodes free: 1787
after gc: idd nodes used:126751, unused:63873249; list nodes free:290871230
before gc: list nodes free: 2041083
after gc: idd nodes used:124134, unused:63875866; list nodes free:292985910
before gc: list nodes free: 1870221
after gc: idd nodes used:158910, unused:63841090; list nodes free:292825011
before gc: list nodes free: 2084343
after gc: idd nodes used:140342, unused:63859658; list nodes free:292911749
before gc: list nodes free: 1774449
after gc: idd nodes used:256270, unused:63743730; list nodes free:292357676
before gc: list nodes free: 1915522
after gc: idd nodes used:190558, unused:63809442; list nodes free:292674706
before gc: list nodes free: 1909454
after gc: idd nodes used:193134, unused:63806866; list nodes free:292662010
before gc: list nodes free: 1748382
after gc: idd nodes used:205150, unused:63794850; list nodes free:292606074
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6087328 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094376 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:
++ 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
++ sed s/.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.007sec
349496
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="ShieldIIPt-PT-100A"
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 ShieldIIPt-PT-100A, 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 r394-oct2-167903717800342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 '
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 ;