About the Execution of Marcie+red for ShieldIIPs-PT-030A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9987.403 | 3600000.00 | 3696328.00 | 163.00 | T?F?TTFFFTTTFTFT | 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-167903717500119.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 ShieldIIPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 253K 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 ShieldIIPs-PT-030A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679491687144
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=ShieldIIPs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:28:09] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-22 13:28:09] [INFO ] Transformed 753 places.
[2023-03-22 13:28:09] [INFO ] Transformed 723 transitions.
[2023-03-22 13:28:09] [INFO ] Found NUPN structural information;
[2023-03-22 13:28:09] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 16) seen :9
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-22 13:28:11] [INFO ] Computed 271 place invariants in 20 ms
[2023-03-22 13:28:11] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 13:28:12] [INFO ] [Nat]Absence check using 271 positive place invariants in 100 ms returned sat
[2023-03-22 13:28:14] [INFO ] After 2715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 13:28:15] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 21 ms to minimize.
[2023-03-22 13:28:15] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2023-03-22 13:28:15] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 13 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:28:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1749 ms
[2023-03-22 13:28:17] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-22 13:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-22 13:28:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-22 13:28:18] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:28:18] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-22 13:28:18] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2023-03-22 13:28:19] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 13 ms to minimize.
[2023-03-22 13:28:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 709 ms
[2023-03-22 13:28:19] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2023-03-22 13:28:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:28:19] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-22 13:28:19] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-22 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 575 ms
[2023-03-22 13:28:20] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2023-03-22 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-22 13:28:21] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 14 ms to minimize.
[2023-03-22 13:28:21] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:28:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 533 ms
[2023-03-22 13:28:21] [INFO ] After 9721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2448 ms.
[2023-03-22 13:28:24] [INFO ] After 12610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 607 ms.
Support contains 250 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 0 with 93 rules applied. Total rules applied 95 place count 752 transition count 722
Applied a total of 95 rules in 109 ms. Remains 752 /753 variables (removed 1) and now considering 722/723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 752/753 places, 722/723 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 7) seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 722 rows 752 cols
[2023-03-22 13:28:25] [INFO ] Computed 271 place invariants in 5 ms
[2023-03-22 13:28:26] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 13:28:26] [INFO ] [Nat]Absence check using 271 positive place invariants in 82 ms returned sat
[2023-03-22 13:28:28] [INFO ] After 2123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 13:28:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:28:30] [INFO ] After 1456ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 13:28:30] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2023-03-22 13:28:31] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-22 13:28:31] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-22 13:28:31] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-22 13:28:31] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 13:28:31] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 23 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2023-03-22 13:28:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 33 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:28:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3108 ms
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:28:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 836 ms
[2023-03-22 13:28:35] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:28:35] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 13 ms to minimize.
[2023-03-22 13:28:36] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:28:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 838 ms
[2023-03-22 13:28:37] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 0 ms to minimize.
[2023-03-22 13:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2023-03-22 13:28:37] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-22 13:28:37] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2023-03-22 13:28:37] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 11 ms to minimize.
[2023-03-22 13:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2023-03-22 13:28:38] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-22 13:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-22 13:28:38] [INFO ] After 9261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2182 ms.
[2023-03-22 13:28:40] [INFO ] After 14148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 496 ms.
Support contains 190 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 722/722 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 751 transition count 721
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 751 transition count 721
Applied a total of 20 rules in 65 ms. Remains 751 /752 variables (removed 1) and now considering 721/722 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 751/752 places, 721/722 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-22 13:28:41] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-22 13:28:41] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:28:42] [INFO ] [Nat]Absence check using 271 positive place invariants in 36 ms returned sat
[2023-03-22 13:28:43] [INFO ] After 1469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:28:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:28:45] [INFO ] After 1273ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 13:28:46] [INFO ] Deduced a trap composed of 9 places in 775 ms of which 1 ms to minimize.
[2023-03-22 13:28:46] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 0 ms to minimize.
[2023-03-22 13:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2023-03-22 13:28:46] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-22 13:28:47] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:28:47] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:28:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 634 ms
[2023-03-22 13:28:47] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 15 ms to minimize.
[2023-03-22 13:28:48] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-22 13:28:48] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 14 ms to minimize.
[2023-03-22 13:28:48] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-22 13:28:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 789 ms
[2023-03-22 13:28:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 15 ms to minimize.
[2023-03-22 13:28:49] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 14 ms to minimize.
[2023-03-22 13:28:49] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 22 ms to minimize.
[2023-03-22 13:28:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 679 ms
[2023-03-22 13:28:50] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2023-03-22 13:28:50] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:28:50] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:28:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-22 13:28:50] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2023-03-22 13:28:51] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-22 13:28:51] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2023-03-22 13:28:51] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 0 ms to minimize.
[2023-03-22 13:28:51] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-22 13:28:52] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:28:53] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-22 13:28:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-22 13:28:53] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3320 ms
[2023-03-22 13:28:53] [INFO ] After 9390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1350 ms.
[2023-03-22 13:28:54] [INFO ] After 12652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 393 ms.
Support contains 171 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 751 transition count 721
Applied a total of 10 rules in 53 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 751/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 109501 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109501 steps, saw 57260 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-22 13:28:58] [INFO ] Computed 271 place invariants in 8 ms
[2023-03-22 13:28:59] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:28:59] [INFO ] [Nat]Absence check using 271 positive place invariants in 138 ms returned sat
[2023-03-22 13:29:01] [INFO ] After 1744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 13:29:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 13:29:02] [INFO ] After 1374ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 13:29:03] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-22 13:29:03] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 13 ms to minimize.
[2023-03-22 13:29:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-22 13:29:03] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-22 13:29:03] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-22 13:29:03] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-22 13:29:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2023-03-22 13:29:04] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-22 13:29:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 13:29:04] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 26 ms to minimize.
[2023-03-22 13:29:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2023-03-22 13:29:05] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-22 13:29:05] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2023-03-22 13:29:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2023-03-22 13:29:06] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 0 ms to minimize.
[2023-03-22 13:29:06] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:29:06] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:29:06] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 13 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-22 13:29:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1393 ms
[2023-03-22 13:29:07] [INFO ] After 6296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1212 ms.
[2023-03-22 13:29:08] [INFO ] After 9829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 478 ms.
Support contains 171 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 23 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 22 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-22 13:29:09] [INFO ] Invariant cache hit.
[2023-03-22 13:29:09] [INFO ] Implicit Places using invariants in 423 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 463 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :2
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-22 13:29:10] [INFO ] Computed 270 place invariants in 3 ms
[2023-03-22 13:29:10] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:29:10] [INFO ] [Nat]Absence check using 270 positive place invariants in 35 ms returned sat
[2023-03-22 13:29:11] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:29:12] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:29:12] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 13:29:12] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-22 13:29:12] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2023-03-22 13:29:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1742 ms
[2023-03-22 13:29:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 13:29:14] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-22 13:29:14] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-22 13:29:14] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:29:14] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 14 ms to minimize.
[2023-03-22 13:29:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 705 ms
[2023-03-22 13:29:15] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2023-03-22 13:29:15] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 13:29:15] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:29:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:29:15] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:29:16] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-22 13:29:16] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2023-03-22 13:29:16] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-22 13:29:16] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-22 13:29:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1172 ms
[2023-03-22 13:29:16] [INFO ] After 5770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 677 ms.
[2023-03-22 13:29:17] [INFO ] After 6696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 173 ms.
Support contains 110 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 750 transition count 721
Applied a total of 38 rules in 26 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 750/750 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 132907 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{2=1}
Probabilistic random walk after 132907 steps, saw 123821 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :1
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-22 13:29:20] [INFO ] Computed 270 place invariants in 7 ms
[2023-03-22 13:29:21] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:29:21] [INFO ] [Nat]Absence check using 261 positive place invariants in 62 ms returned sat
[2023-03-22 13:29:21] [INFO ] [Nat]Absence check using 261 positive and 9 generalized place invariants in 26 ms returned sat
[2023-03-22 13:29:22] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:29:22] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:29:23] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-22 13:29:24] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:29:24] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-03-22 13:29:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1455 ms
[2023-03-22 13:29:24] [INFO ] After 2767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 526 ms.
[2023-03-22 13:29:24] [INFO ] After 3681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 139 ms.
Support contains 69 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 750 transition count 721
Applied a total of 22 rules in 26 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 750/750 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 132075 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132075 steps, saw 112537 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-22 13:29:28] [INFO ] Computed 270 place invariants in 8 ms
[2023-03-22 13:29:28] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:29:28] [INFO ] [Nat]Absence check using 262 positive place invariants in 78 ms returned sat
[2023-03-22 13:29:28] [INFO ] [Nat]Absence check using 262 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 13:29:29] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:29:30] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-22 13:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-22 13:29:30] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 54 ms to minimize.
[2023-03-22 13:29:30] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-22 13:29:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1300 ms
[2023-03-22 13:29:31] [INFO ] After 2992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-22 13:29:32] [INFO ] After 3819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 115 ms.
Support contains 69 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-22 13:29:32] [INFO ] Invariant cache hit.
[2023-03-22 13:29:33] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-22 13:29:33] [INFO ] Invariant cache hit.
[2023-03-22 13:29:34] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-22 13:29:34] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 13:29:34] [INFO ] Invariant cache hit.
[2023-03-22 13:29:35] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2741 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 13:29:35] [INFO ] Invariant cache hit.
[2023-03-22 13:29:35] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:29:35] [INFO ] [Nat]Absence check using 262 positive place invariants in 37 ms returned sat
[2023-03-22 13:29:35] [INFO ] [Nat]Absence check using 262 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 13:29:36] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:29:36] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2023-03-22 13:29:36] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-22 13:29:37] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-22 13:29:37] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:29:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 687 ms
[2023-03-22 13:29:37] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:29:38] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-03-22 13:29:38] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-22 13:29:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 647 ms
[2023-03-22 13:29:38] [INFO ] After 2898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 811 ms.
[2023-03-22 13:29:39] [INFO ] After 3920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 13:29:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 13:29:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3616 arcs took 6 ms.
[2023-03-22 13:29:39] [INFO ] Flatten gal took : 122 ms
Total runtime 90035 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: ShieldIIPs_PT_030A
(NrP: 750 NrTr: 721 NrArc: 3616)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.048sec
net check time: 0m 0.012sec
init dd package: 0m 3.157sec
before gc: list nodes free: 2006530
after gc: idd nodes used:1053397, unused:62946603; list nodes free:284597961
before gc: list nodes free: 951371
after gc: idd nodes used:1529244, unused:62470756; list nodes free:282447647
before gc: list nodes free: 1521063
after gc: idd nodes used:1954819, unused:62045181; list nodes free:282609977
before gc: list nodes free: 1796741
after gc: idd nodes used:2538241, unused:61461759; list nodes free:279958007
before gc: list nodes free: 2298072
after gc: idd nodes used:2354378, unused:61645622; list nodes free:280799519
before gc: list nodes free: 1575630
after gc: idd nodes used:2386972, unused:61613028; list nodes free:280650316
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6158108 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095672 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.003sec
190398 718083 766659 1028032 1364400 1479775 1704182 1927260 1968473 2153965 2342128 2426458 2349842 2375026 2574183 2405353 2463092 2491031
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="ShieldIIPs-PT-030A"
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 ShieldIIPs-PT-030A, 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 r394-oct2-167903717500119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030A.tgz
mv ShieldIIPs-PT-030A 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 '
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 ;