About the Execution of Marcie+red for ShieldPPPs-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10246.743 | 1534707.00 | 1588132.00 | 155.40 | ??F????????????? | 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-167903717900458.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 ShieldPPPs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900458
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 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:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 349K 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 ShieldPPPs-PT-020B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679515672813
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:07:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:07:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:07:55] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-22 20:07:55] [INFO ] Transformed 1363 places.
[2023-03-22 20:07:55] [INFO ] Transformed 1263 transitions.
[2023-03-22 20:07:55] [INFO ] Found NUPN structural information;
[2023-03-22 20:07:55] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 158 out of 1363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 113 place count 1250 transition count 1150
Iterating global reduction 0 with 113 rules applied. Total rules applied 226 place count 1250 transition count 1150
Applied a total of 226 rules in 243 ms. Remains 1250 /1363 variables (removed 113) and now considering 1150/1263 (removed 113) transitions.
// Phase 1: matrix 1150 rows 1250 cols
[2023-03-22 20:07:55] [INFO ] Computed 221 place invariants in 24 ms
[2023-03-22 20:07:56] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-22 20:07:56] [INFO ] Invariant cache hit.
[2023-03-22 20:07:58] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
[2023-03-22 20:07:58] [INFO ] Invariant cache hit.
[2023-03-22 20:07:58] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1250/1363 places, 1150/1263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3252 ms. Remains : 1250/1363 places, 1150/1263 transitions.
Support contains 158 out of 1250 places after structural reductions.
[2023-03-22 20:07:59] [INFO ] Flatten gal took : 109 ms
[2023-03-22 20:07:59] [INFO ] Flatten gal took : 50 ms
[2023-03-22 20:07:59] [INFO ] Input system was already deterministic with 1150 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 95) seen :87
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 20:08:00] [INFO ] Invariant cache hit.
[2023-03-22 20:08:00] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2023-03-22 20:08:00] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 20:08:01] [INFO ] [Nat]Absence check using 221 positive place invariants in 83 ms returned sat
[2023-03-22 20:08:02] [INFO ] After 1105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 20:08:03] [INFO ] Deduced a trap composed of 21 places in 637 ms of which 19 ms to minimize.
[2023-03-22 20:08:03] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 2 ms to minimize.
[2023-03-22 20:08:04] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 1 ms to minimize.
[2023-03-22 20:08:04] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 2 ms to minimize.
[2023-03-22 20:08:05] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 13 ms to minimize.
[2023-03-22 20:08:05] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-22 20:08:05] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2023-03-22 20:08:05] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 0 ms to minimize.
[2023-03-22 20:08:06] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 0 ms to minimize.
[2023-03-22 20:08:06] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 0 ms to minimize.
[2023-03-22 20:08:06] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 0 ms to minimize.
[2023-03-22 20:08:07] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 1 ms to minimize.
[2023-03-22 20:08:07] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-22 20:08:07] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 0 ms to minimize.
[2023-03-22 20:08:08] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 1 ms to minimize.
[2023-03-22 20:08:08] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 0 ms to minimize.
[2023-03-22 20:08:08] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 0 ms to minimize.
[2023-03-22 20:08:08] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 1 ms to minimize.
[2023-03-22 20:08:09] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 1 ms to minimize.
[2023-03-22 20:08:09] [INFO ] Deduced a trap composed of 30 places in 382 ms of which 1 ms to minimize.
[2023-03-22 20:08:09] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 0 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2023-03-22 20:08:10] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:08:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:08:11] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2023-03-22 20:08:11] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8592 ms
[2023-03-22 20:08:11] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2023-03-22 20:08:11] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:08:12] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 1 ms to minimize.
[2023-03-22 20:08:12] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 0 ms to minimize.
[2023-03-22 20:08:12] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2023-03-22 20:08:12] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:08:13] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2023-03-22 20:08:13] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2023-03-22 20:08:13] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 0 ms to minimize.
[2023-03-22 20:08:13] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:08:13] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-22 20:08:14] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2023-03-22 20:08:14] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2023-03-22 20:08:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2982 ms
[2023-03-22 20:08:14] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2023-03-22 20:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-22 20:08:15] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:08:15] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-22 20:08:15] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-22 20:08:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
[2023-03-22 20:08:16] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2023-03-22 20:08:16] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 0 ms to minimize.
[2023-03-22 20:08:16] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-22 20:08:16] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 0 ms to minimize.
[2023-03-22 20:08:17] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2023-03-22 20:08:17] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2023-03-22 20:08:17] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:08:17] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-22 20:08:17] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 0 ms to minimize.
[2023-03-22 20:08:18] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 9 ms to minimize.
[2023-03-22 20:08:18] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2023-03-22 20:08:18] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2023-03-22 20:08:18] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 0 ms to minimize.
[2023-03-22 20:08:19] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 0 ms to minimize.
[2023-03-22 20:08:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3513 ms
[2023-03-22 20:08:19] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2023-03-22 20:08:19] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 0 ms to minimize.
[2023-03-22 20:08:20] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 0 ms to minimize.
[2023-03-22 20:08:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 816 ms
[2023-03-22 20:08:20] [INFO ] After 18511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 659 ms.
[2023-03-22 20:08:20] [INFO ] After 20022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 277 ms.
Support contains 26 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1250 transition count 1010
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1110 transition count 1010
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 280 place count 1110 transition count 912
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 476 place count 1012 transition count 912
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 495 place count 993 transition count 893
Iterating global reduction 2 with 19 rules applied. Total rules applied 514 place count 993 transition count 893
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 514 place count 993 transition count 882
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 536 place count 982 transition count 882
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 3 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1204 place count 648 transition count 548
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 2 with 173 rules applied. Total rules applied 1377 place count 648 transition count 548
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1378 place count 647 transition count 547
Applied a total of 1378 rules in 253 ms. Remains 647 /1250 variables (removed 603) and now considering 547/1150 (removed 603) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 647/1250 places, 547/1150 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 547 rows 647 cols
[2023-03-22 20:08:21] [INFO ] Computed 221 place invariants in 11 ms
[2023-03-22 20:08:21] [INFO ] [Real]Absence check using 210 positive place invariants in 24 ms returned sat
[2023-03-22 20:08:21] [INFO ] [Real]Absence check using 210 positive and 11 generalized place invariants in 1 ms returned sat
[2023-03-22 20:08:22] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 20:08:22] [INFO ] [Nat]Absence check using 210 positive place invariants in 68 ms returned sat
[2023-03-22 20:08:22] [INFO ] [Nat]Absence check using 210 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-22 20:08:23] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 20:08:23] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-22 20:08:23] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 4 ms to minimize.
[2023-03-22 20:08:23] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:08:23] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 12 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 13 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:08:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1642 ms
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 20:08:25] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:08:26] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-22 20:08:26] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-22 20:08:26] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-22 20:08:26] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:08:26] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-22 20:08:27] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2023-03-22 20:08:28] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2023-03-22 20:08:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3239 ms
[2023-03-22 20:08:28] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2023-03-22 20:08:28] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-22 20:08:28] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2023-03-22 20:08:28] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-22 20:08:29] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:08:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2612 ms
[2023-03-22 20:08:30] [INFO ] After 8310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-22 20:08:31] [INFO ] After 8772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 12 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 547/547 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 647 transition count 546
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 646 transition count 546
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 26 place count 634 transition count 534
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 31 place count 634 transition count 534
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 632 transition count 532
Applied a total of 33 rules in 124 ms. Remains 632 /647 variables (removed 15) and now considering 532/547 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 632/647 places, 532/547 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 145872 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145872 steps, saw 130287 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 532 rows 632 cols
[2023-03-22 20:08:34] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-22 20:08:34] [INFO ] [Real]Absence check using 213 positive place invariants in 32 ms returned sat
[2023-03-22 20:08:34] [INFO ] [Real]Absence check using 213 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 20:08:34] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 20:08:35] [INFO ] [Nat]Absence check using 213 positive place invariants in 36 ms returned sat
[2023-03-22 20:08:35] [INFO ] [Nat]Absence check using 213 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-22 20:08:35] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 20:08:35] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 1 ms to minimize.
[2023-03-22 20:08:35] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:08:36] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-22 20:08:36] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:08:36] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-22 20:08:36] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2023-03-22 20:08:36] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-22 20:08:37] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:08:38] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3155 ms
[2023-03-22 20:08:38] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-22 20:08:39] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-22 20:08:39] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:08:39] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:08:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 714 ms
[2023-03-22 20:08:39] [INFO ] After 4391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-22 20:08:39] [INFO ] After 4734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 12 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 532/532 transitions.
Applied a total of 0 rules in 84 ms. Remains 632 /632 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 632/632 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 532/532 transitions.
Applied a total of 0 rules in 24 ms. Remains 632 /632 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-22 20:08:39] [INFO ] Invariant cache hit.
[2023-03-22 20:08:40] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-22 20:08:40] [INFO ] Invariant cache hit.
[2023-03-22 20:08:40] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2023-03-22 20:08:41] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 20:08:41] [INFO ] Invariant cache hit.
[2023-03-22 20:08:41] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1521 ms. Remains : 632/632 places, 532/532 transitions.
Applied a total of 0 rules in 22 ms. Remains 632 /632 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 20:08:41] [INFO ] Invariant cache hit.
[2023-03-22 20:08:41] [INFO ] [Real]Absence check using 213 positive place invariants in 51 ms returned sat
[2023-03-22 20:08:41] [INFO ] [Real]Absence check using 213 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-22 20:08:41] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 20:08:41] [INFO ] [Nat]Absence check using 213 positive place invariants in 31 ms returned sat
[2023-03-22 20:08:42] [INFO ] [Nat]Absence check using 213 positive and 8 generalized place invariants in 40 ms returned sat
[2023-03-22 20:08:42] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 20:08:42] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-22 20:08:42] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:08:42] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 14 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:08:43] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:08:44] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-22 20:08:45] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2023-03-22 20:08:45] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-22 20:08:45] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2732 ms
[2023-03-22 20:08:45] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-22 20:08:45] [INFO ] After 3525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 20:08:45] [INFO ] After 3933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 20:08:45] [INFO ] Flatten gal took : 64 ms
[2023-03-22 20:08:45] [INFO ] Flatten gal took : 58 ms
[2023-03-22 20:08:46] [INFO ] Input system was already deterministic with 1150 transitions.
Computed a total of 253 stabilizing places and 253 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1249 transition count 1009
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 1109 transition count 1009
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 280 place count 1109 transition count 908
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 482 place count 1008 transition count 908
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 508 place count 982 transition count 882
Iterating global reduction 2 with 26 rules applied. Total rules applied 534 place count 982 transition count 882
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 534 place count 982 transition count 870
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 558 place count 970 transition count 870
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1236 place count 631 transition count 531
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1238 place count 629 transition count 529
Applied a total of 1238 rules in 129 ms. Remains 629 /1250 variables (removed 621) and now considering 529/1150 (removed 621) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 629/1250 places, 529/1150 transitions.
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 19 ms
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 19 ms
[2023-03-22 20:08:46] [INFO ] Input system was already deterministic with 529 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1225 transition count 1125
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1225 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1224 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1224 transition count 1124
Applied a total of 52 rules in 119 ms. Remains 1224 /1250 variables (removed 26) and now considering 1124/1150 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1224/1250 places, 1124/1150 transitions.
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 33 ms
[2023-03-22 20:08:46] [INFO ] Input system was already deterministic with 1124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1249 transition count 1007
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1107 transition count 1007
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1107 transition count 907
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1007 transition count 907
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 510 place count 981 transition count 881
Iterating global reduction 2 with 26 rules applied. Total rules applied 536 place count 981 transition count 881
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 536 place count 981 transition count 869
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 560 place count 969 transition count 869
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 2 with 692 rules applied. Total rules applied 1252 place count 623 transition count 523
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1254 place count 621 transition count 521
Applied a total of 1254 rules in 105 ms. Remains 621 /1250 variables (removed 629) and now considering 521/1150 (removed 629) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105 ms. Remains : 621/1250 places, 521/1150 transitions.
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 33 ms
[2023-03-22 20:08:46] [INFO ] Input system was already deterministic with 521 transitions.
Finished random walk after 7188 steps, including 5 resets, run visited all 1 properties in 38 ms. (steps per millisecond=189 )
FORMULA ShieldPPPs-PT-020B-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1226 transition count 1126
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1226 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1225 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1225 transition count 1125
Applied a total of 50 rules in 72 ms. Remains 1225 /1250 variables (removed 25) and now considering 1125/1150 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1225/1250 places, 1125/1150 transitions.
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 28 ms
[2023-03-22 20:08:46] [INFO ] Flatten gal took : 29 ms
[2023-03-22 20:08:46] [INFO ] Input system was already deterministic with 1125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1224 transition count 1124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1224 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1223 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1223 transition count 1123
Applied a total of 54 rules in 76 ms. Remains 1223 /1250 variables (removed 27) and now considering 1123/1150 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 1223/1250 places, 1123/1150 transitions.
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 28 ms
[2023-03-22 20:08:47] [INFO ] Input system was already deterministic with 1123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1224 transition count 1124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1224 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1223 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1223 transition count 1123
Applied a total of 54 rules in 99 ms. Remains 1223 /1250 variables (removed 27) and now considering 1123/1150 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 1223/1250 places, 1123/1150 transitions.
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 28 ms
[2023-03-22 20:08:47] [INFO ] Input system was already deterministic with 1123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1227 transition count 1127
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1227 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1226 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1226 transition count 1126
Applied a total of 48 rules in 101 ms. Remains 1226 /1250 variables (removed 24) and now considering 1126/1150 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1226/1250 places, 1126/1150 transitions.
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 29 ms
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 29 ms
[2023-03-22 20:08:47] [INFO ] Input system was already deterministic with 1126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1228 transition count 1128
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1228 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1227 transition count 1127
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1227 transition count 1127
Applied a total of 46 rules in 74 ms. Remains 1227 /1250 variables (removed 23) and now considering 1127/1150 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 1227/1250 places, 1127/1150 transitions.
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:47] [INFO ] Input system was already deterministic with 1127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1227 transition count 1127
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1227 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1226 transition count 1126
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1226 transition count 1126
Applied a total of 48 rules in 76 ms. Remains 1226 /1250 variables (removed 24) and now considering 1126/1150 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 1226/1250 places, 1126/1150 transitions.
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:47] [INFO ] Flatten gal took : 26 ms
[2023-03-22 20:08:48] [INFO ] Input system was already deterministic with 1126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1249 transition count 1007
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1107 transition count 1007
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1107 transition count 907
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1007 transition count 907
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 511 place count 980 transition count 880
Iterating global reduction 2 with 27 rules applied. Total rules applied 538 place count 980 transition count 880
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 538 place count 980 transition count 868
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 562 place count 968 transition count 868
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1252 place count 623 transition count 523
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1254 place count 621 transition count 521
Applied a total of 1254 rules in 126 ms. Remains 621 /1250 variables (removed 629) and now considering 521/1150 (removed 629) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 126 ms. Remains : 621/1250 places, 521/1150 transitions.
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 15 ms
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 16 ms
[2023-03-22 20:08:48] [INFO ] Input system was already deterministic with 521 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1225 transition count 1125
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1225 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1224 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1224 transition count 1124
Applied a total of 52 rules in 87 ms. Remains 1224 /1250 variables (removed 26) and now considering 1124/1150 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1224/1250 places, 1124/1150 transitions.
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 25 ms
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:48] [INFO ] Input system was already deterministic with 1124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1223 transition count 1123
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1223 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1222 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1222 transition count 1122
Applied a total of 56 rules in 87 ms. Remains 1222 /1250 variables (removed 28) and now considering 1122/1150 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1222/1250 places, 1122/1150 transitions.
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 25 ms
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:08:48] [INFO ] Input system was already deterministic with 1122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1224 transition count 1124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1224 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1223 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1223 transition count 1123
Applied a total of 54 rules in 112 ms. Remains 1223 /1250 variables (removed 27) and now considering 1123/1150 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1223/1250 places, 1123/1150 transitions.
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 25 ms
[2023-03-22 20:08:48] [INFO ] Flatten gal took : 26 ms
[2023-03-22 20:08:48] [INFO ] Input system was already deterministic with 1123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1225 transition count 1125
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1225 transition count 1125
Applied a total of 50 rules in 49 ms. Remains 1225 /1250 variables (removed 25) and now considering 1125/1150 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 1225/1250 places, 1125/1150 transitions.
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 24 ms
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 24 ms
[2023-03-22 20:08:49] [INFO ] Input system was already deterministic with 1125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1224 transition count 1124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1224 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1223 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1223 transition count 1123
Applied a total of 54 rules in 89 ms. Remains 1223 /1250 variables (removed 27) and now considering 1123/1150 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1223/1250 places, 1123/1150 transitions.
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 25 ms
[2023-03-22 20:08:49] [INFO ] Input system was already deterministic with 1123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1150/1150 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1223 transition count 1123
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1223 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1222 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1222 transition count 1122
Applied a total of 56 rules in 74 ms. Remains 1222 /1250 variables (removed 28) and now considering 1122/1150 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 1222/1250 places, 1122/1150 transitions.
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 23 ms
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 24 ms
[2023-03-22 20:08:49] [INFO ] Input system was already deterministic with 1122 transitions.
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 24 ms
[2023-03-22 20:08:49] [INFO ] Flatten gal took : 25 ms
[2023-03-22 20:08:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 20:08:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1250 places, 1150 transitions and 3260 arcs took 5 ms.
Total runtime 54336 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1250 NrTr: 1150 NrArc: 3260)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.093sec
net check time: 0m 0.000sec
init dd package: 0m 2.909sec
before gc: list nodes free: 1740325
after gc: idd nodes used:32071423, unused:31928577; list nodes free:143761432
before gc: list nodes free: 1794920
after gc: idd nodes used:45411754, unused:18588246; list nodes free:87743885
RS generation: 23m52.758sec
-> last computed set: #nodes 45410506 (4.5e+07) #states 158,456,509,951,829 (14)
CANNOT_COMPUTE
BK_STOP 1679517207520
--------------------
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'
++ sed s/.jar//
++ 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 CTLFireability -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.005sec
idd.cc:820: DD Exception: No free nodes
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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPs-PT-020B, examination is CTLFireability"
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-167903717900458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;