About the Execution of 2023-gold for ShieldPPPs-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
713.972 | 114406.00 | 135597.00 | 720.60 | FTTTTTTTFTTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788900290.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788900290
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 349K May 18 16:43 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-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716972506336
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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 08:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 08:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 08:48:28] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-29 08:48:28] [INFO ] Transformed 1363 places.
[2024-05-29 08:48:28] [INFO ] Transformed 1263 transitions.
[2024-05-29 08:48:28] [INFO ] Found NUPN structural information;
[2024-05-29 08:48:28] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 16) seen :9
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2024-05-29 08:48:29] [INFO ] Computed 221 invariants in 36 ms
[2024-05-29 08:48:30] [INFO ] [Real]Absence check using 221 positive place invariants in 76 ms returned sat
[2024-05-29 08:48:30] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 08:48:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 133 ms returned sat
[2024-05-29 08:48:33] [INFO ] After 1984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 08:48:34] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 8 ms to minimize.
[2024-05-29 08:48:34] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 3 ms to minimize.
[2024-05-29 08:48:35] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2024-05-29 08:48:35] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 2 ms to minimize.
[2024-05-29 08:48:35] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 1 ms to minimize.
[2024-05-29 08:48:36] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
[2024-05-29 08:48:36] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 2 ms to minimize.
[2024-05-29 08:48:36] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 1 ms to minimize.
[2024-05-29 08:48:37] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2024-05-29 08:48:37] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2024-05-29 08:48:38] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 1 ms to minimize.
[2024-05-29 08:48:38] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 0 ms to minimize.
[2024-05-29 08:48:39] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 1 ms to minimize.
[2024-05-29 08:48:39] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2024-05-29 08:48:40] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2024-05-29 08:48:40] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2024-05-29 08:48:40] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
[2024-05-29 08:48:41] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 1 ms to minimize.
[2024-05-29 08:48:41] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2024-05-29 08:48:41] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 1 ms to minimize.
[2024-05-29 08:48:42] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 2 ms to minimize.
[2024-05-29 08:48:42] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2024-05-29 08:48:42] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2024-05-29 08:48:43] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2024-05-29 08:48:43] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 0 ms to minimize.
[2024-05-29 08:48:43] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2024-05-29 08:48:44] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2024-05-29 08:48:44] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2024-05-29 08:48:44] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 1 ms to minimize.
[2024-05-29 08:48:44] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2024-05-29 08:48:45] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 0 ms to minimize.
[2024-05-29 08:48:45] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2024-05-29 08:48:45] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 1 ms to minimize.
[2024-05-29 08:48:46] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 1 ms to minimize.
[2024-05-29 08:48:46] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 1 ms to minimize.
[2024-05-29 08:48:46] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-05-29 08:48:46] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 0 ms to minimize.
[2024-05-29 08:48:47] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 1 ms to minimize.
[2024-05-29 08:48:47] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2024-05-29 08:48:47] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 0 ms to minimize.
[2024-05-29 08:48:48] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2024-05-29 08:48:48] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2024-05-29 08:48:48] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2024-05-29 08:48:48] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 0 ms to minimize.
[2024-05-29 08:48:49] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 1 ms to minimize.
[2024-05-29 08:48:49] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2024-05-29 08:48:49] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2024-05-29 08:48:49] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2024-05-29 08:48:49] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2024-05-29 08:48:50] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:48:50] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2024-05-29 08:48:50] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 16388 ms
[2024-05-29 08:48:51] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2024-05-29 08:48:51] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2024-05-29 08:48:51] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2024-05-29 08:48:51] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 1 ms to minimize.
[2024-05-29 08:48:52] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 2 ms to minimize.
[2024-05-29 08:48:52] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2024-05-29 08:48:52] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2024-05-29 08:48:52] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2024-05-29 08:48:52] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 0 ms to minimize.
[2024-05-29 08:48:53] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-05-29 08:48:53] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2024-05-29 08:48:53] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2024-05-29 08:48:53] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2024-05-29 08:48:54] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2024-05-29 08:48:54] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 0 ms to minimize.
[2024-05-29 08:48:54] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2024-05-29 08:48:54] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 1 ms to minimize.
[2024-05-29 08:48:54] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2024-05-29 08:48:55] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 1 ms to minimize.
[2024-05-29 08:48:55] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2024-05-29 08:48:55] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:48:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4763 ms
[2024-05-29 08:48:55] [INFO ] After 23986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-29 08:48:55] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 304 ms.
Support contains 229 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1363 transition count 1169
Reduce places removed 94 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 108 rules applied. Total rules applied 202 place count 1269 transition count 1155
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 216 place count 1255 transition count 1155
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 216 place count 1255 transition count 1067
Deduced a syphon composed of 88 places in 5 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 392 place count 1167 transition count 1067
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 482 place count 1077 transition count 977
Iterating global reduction 3 with 90 rules applied. Total rules applied 572 place count 1077 transition count 977
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 572 place count 1077 transition count 956
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 614 place count 1056 transition count 956
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 3 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1062 place count 832 transition count 732
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 3 with 117 rules applied. Total rules applied 1179 place count 832 transition count 732
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1180 place count 831 transition count 731
Applied a total of 1180 rules in 425 ms. Remains 831 /1363 variables (removed 532) and now considering 731/1263 (removed 532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 831/1363 places, 731/1263 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 731 rows 831 cols
[2024-05-29 08:48:56] [INFO ] Computed 221 invariants in 7 ms
[2024-05-29 08:48:57] [INFO ] [Real]Absence check using 220 positive place invariants in 51 ms returned sat
[2024-05-29 08:48:57] [INFO ] [Real]Absence check using 220 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 08:48:57] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 08:48:57] [INFO ] [Nat]Absence check using 220 positive place invariants in 45 ms returned sat
[2024-05-29 08:48:57] [INFO ] [Nat]Absence check using 220 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 08:48:59] [INFO ] After 1431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 08:48:59] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2024-05-29 08:48:59] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2024-05-29 08:48:59] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2024-05-29 08:48:59] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2024-05-29 08:49:00] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2024-05-29 08:49:00] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2024-05-29 08:49:00] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2024-05-29 08:49:00] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2024-05-29 08:49:01] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2024-05-29 08:49:01] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2024-05-29 08:49:01] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 08:49:01] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2024-05-29 08:49:01] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2024-05-29 08:49:02] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2024-05-29 08:49:02] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2024-05-29 08:49:02] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 0 ms to minimize.
[2024-05-29 08:49:02] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2024-05-29 08:49:03] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2024-05-29 08:49:03] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2024-05-29 08:49:03] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2024-05-29 08:49:03] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2024-05-29 08:49:04] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2024-05-29 08:49:04] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2024-05-29 08:49:04] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2024-05-29 08:49:04] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2024-05-29 08:49:04] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2024-05-29 08:49:05] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 0 ms to minimize.
[2024-05-29 08:49:05] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6062 ms
[2024-05-29 08:49:05] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 08:49:05] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2024-05-29 08:49:05] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 0 ms to minimize.
[2024-05-29 08:49:06] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2024-05-29 08:49:06] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2024-05-29 08:49:06] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2024-05-29 08:49:06] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2024-05-29 08:49:07] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:49:08] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 08:49:09] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4534 ms
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2024-05-29 08:49:10] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 08:49:11] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2024-05-29 08:49:12] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2864 ms
[2024-05-29 08:49:13] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2024-05-29 08:49:13] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2024-05-29 08:49:13] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2024-05-29 08:49:13] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2024-05-29 08:49:13] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:49:14] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2024-05-29 08:49:14] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-29 08:49:14] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2024-05-29 08:49:14] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2024-05-29 08:49:14] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2024-05-29 08:49:15] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2024-05-29 08:49:15] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2024-05-29 08:49:15] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2024-05-29 08:49:15] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2024-05-29 08:49:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2790 ms
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 08:49:16] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2024-05-29 08:49:17] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2024-05-29 08:49:17] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2024-05-29 08:49:17] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2024-05-29 08:49:17] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-05-29 08:49:17] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-29 08:49:18] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3150 ms
[2024-05-29 08:49:20] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 08:49:20] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-05-29 08:49:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 08:49:20] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:49:20] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:49:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 622 ms
[2024-05-29 08:49:20] [INFO ] After 23010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1577 ms.
[2024-05-29 08:49:22] [INFO ] After 24893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 145 ms.
Support contains 213 out of 831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 831/831 places, 731/731 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 727
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 827 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 827 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 825 transition count 725
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 812 transition count 712
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 812 transition count 712
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 810 transition count 710
Applied a total of 44 rules in 131 ms. Remains 810 /831 variables (removed 21) and now considering 710/731 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 810/831 places, 710/731 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 149712 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149712 steps, saw 137435 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 710 rows 810 cols
[2024-05-29 08:49:25] [INFO ] Computed 221 invariants in 9 ms
[2024-05-29 08:49:26] [INFO ] [Real]Absence check using 220 positive place invariants in 49 ms returned sat
[2024-05-29 08:49:26] [INFO ] [Real]Absence check using 220 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 08:49:26] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 08:49:26] [INFO ] [Nat]Absence check using 220 positive place invariants in 49 ms returned sat
[2024-05-29 08:49:26] [INFO ] [Nat]Absence check using 220 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 08:49:28] [INFO ] After 1477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 08:49:28] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2024-05-29 08:49:28] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2024-05-29 08:49:28] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2024-05-29 08:49:28] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2024-05-29 08:49:28] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2024-05-29 08:49:29] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2024-05-29 08:49:29] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 08:49:29] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-29 08:49:29] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2024-05-29 08:49:29] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-05-29 08:49:30] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2024-05-29 08:49:30] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2024-05-29 08:49:30] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2024-05-29 08:49:30] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2024-05-29 08:49:30] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2024-05-29 08:49:31] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2024-05-29 08:49:31] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2024-05-29 08:49:31] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 1 ms to minimize.
[2024-05-29 08:49:31] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 08:49:31] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2024-05-29 08:49:32] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 08:49:32] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2024-05-29 08:49:32] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2024-05-29 08:49:32] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-05-29 08:49:32] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2024-05-29 08:49:33] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-29 08:49:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2024-05-29 08:49:35] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2024-05-29 08:49:35] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:49:35] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:49:35] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:49:35] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7503 ms
[2024-05-29 08:49:35] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 08:49:36] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2024-05-29 08:49:36] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2024-05-29 08:49:36] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:49:36] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2024-05-29 08:49:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2024-05-29 08:49:37] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:49:37] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2024-05-29 08:49:37] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 08:49:37] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 08:49:37] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2024-05-29 08:49:38] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2024-05-29 08:49:39] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4032 ms
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-05-29 08:49:40] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2024-05-29 08:49:41] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2024-05-29 08:49:41] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2024-05-29 08:49:41] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:49:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1594 ms
[2024-05-29 08:49:41] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2024-05-29 08:49:42] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2024-05-29 08:49:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2245 ms
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2024-05-29 08:49:44] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 0 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-29 08:49:45] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-29 08:49:46] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2024-05-29 08:49:46] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2024-05-29 08:49:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2210 ms
[2024-05-29 08:49:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-05-29 08:49:47] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-05-29 08:49:47] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 08:49:48] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-29 08:49:49] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-29 08:49:50] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 08:49:51] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-29 08:49:51] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2024-05-29 08:49:51] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4149 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 08:49:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 08:49:51] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 119 ms.
Support contains 213 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 710/710 transitions.
Applied a total of 0 rules in 19 ms. Remains 810 /810 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 810/810 places, 710/710 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 710/710 transitions.
Applied a total of 0 rules in 19 ms. Remains 810 /810 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-29 08:49:51] [INFO ] Invariant cache hit.
[2024-05-29 08:49:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-29 08:49:51] [INFO ] Invariant cache hit.
[2024-05-29 08:49:52] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2024-05-29 08:49:52] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 08:49:52] [INFO ] Invariant cache hit.
[2024-05-29 08:49:53] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1668 ms. Remains : 810/810 places, 710/710 transitions.
Applied a total of 0 rules in 19 ms. Remains 810 /810 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-29 08:49:53] [INFO ] Invariant cache hit.
[2024-05-29 08:49:53] [INFO ] [Real]Absence check using 220 positive place invariants in 46 ms returned sat
[2024-05-29 08:49:53] [INFO ] [Real]Absence check using 220 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 08:49:53] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 08:49:53] [INFO ] [Nat]Absence check using 220 positive place invariants in 46 ms returned sat
[2024-05-29 08:49:53] [INFO ] [Nat]Absence check using 220 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 08:49:55] [INFO ] After 1849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 08:49:55] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2024-05-29 08:49:55] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 08:49:56] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2024-05-29 08:49:57] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2024-05-29 08:49:58] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-05-29 08:49:59] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2024-05-29 08:49:59] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2024-05-29 08:49:59] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2024-05-29 08:49:59] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:49:59] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2024-05-29 08:50:00] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2024-05-29 08:50:00] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 08:50:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4729 ms
[2024-05-29 08:50:00] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:50:00] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2024-05-29 08:50:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-29 08:50:02] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2496 ms
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 08:50:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1240 ms
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-05-29 08:50:04] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2024-05-29 08:50:05] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-05-29 08:50:05] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2024-05-29 08:50:05] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2024-05-29 08:50:05] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2024-05-29 08:50:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2024-05-29 08:50:06] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2698 ms
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:50:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 08:50:08] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2024-05-29 08:50:09] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2024-05-29 08:50:10] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-29 08:50:10] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-29 08:50:10] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 08:50:10] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2024-05-29 08:50:10] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3226 ms
[2024-05-29 08:50:11] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 08:50:11] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-29 08:50:11] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2024-05-29 08:50:12] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-29 08:50:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 08:50:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 08:50:14] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2024-05-29 08:50:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3107 ms
[2024-05-29 08:50:14] [INFO ] After 20728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2076 ms.
[2024-05-29 08:50:16] [INFO ] After 23098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 08:50:16] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-29 08:50:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 810 places, 710 transitions and 2630 arcs took 6 ms.
[2024-05-29 08:50:16] [INFO ] Flatten gal took : 97 ms
Total runtime 108453 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716972620742
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 9 ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 9 ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 9 ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 9 ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 22 (type EXCL) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 62
lola: fired transitions : 61
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 21 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-04 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 12 ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 12 ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 12 ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 28 (type SRCH) for 12 ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 18 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
lola: result : true
lola: fired transitions : 114
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-26.sara.
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-19.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 28 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: result : false
lola: markings : 46311
lola: fired transitions : 110210
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 15 ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 15 ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 46 (type SRCH) for 15 ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: result : unknown
lola: fired transitions : 88934
lola: tried executions : 7592
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 26 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
lola: result : unknown
lola: FINISHED task # 46 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 83
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 43 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 44 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 31 (type FNDP) for 3 ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 3 ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 34 (type SRCH) for 3 ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 43 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 81
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 34 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 137
lola: fired transitions : 136
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 31 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 32 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 49 (type FNDP) for 6 ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 6 ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 6 ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 52 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
lola: result : true
lola: markings : 76
lola: fired transitions : 75
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 50 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-03 (obsolete)
lola: LAUNCH task # 37 (type FNDP) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 0 ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/370/ReachabilityFireability-50.sara.
lola: FINISHED task # 31 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 135
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 40 (type SRCH) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-00
lola: result : false
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 37 (type FNDP) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 38 (type EQUN) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPs-PT-020B-ReachabilityFireability-2024-00 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-020B-ReachabilityFireability-2024-00: EF false tandem / insertion
ShieldPPPs-PT-020B-ReachabilityFireability-2024-02: EF true tandem / insertion
ShieldPPPs-PT-020B-ReachabilityFireability-2024-03: EF true tandem / insertion
ShieldPPPs-PT-020B-ReachabilityFireability-2024-04: EF true tandem / relaxed
ShieldPPPs-PT-020B-ReachabilityFireability-2024-07: AG true tandem / insertion
ShieldPPPs-PT-020B-ReachabilityFireability-2024-12: EF true tandem / insertion
Time elapsed: 3 secs. Pages in use: 2
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="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-020B, 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 r373-tall-171683788900290"
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 [ "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 ;