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.r393-oct2-167903716700174.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 ltsminxred
Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679431924005

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:52:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 20:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:52:06] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2023-03-21 20:52:07] [INFO ] Transformed 6003 places.
[2023-03-21 20:52:07] [INFO ] Transformed 5903 transitions.
[2023-03-21 20:52:07] [INFO ] Found NUPN structural information;
[2023-03-21 20:52:07] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-21 20:52:08] [INFO ] Computed 901 place invariants in 54 ms
[2023-03-21 20:52:10] [INFO ] After 2152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:52:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 892 ms returned sat
[2023-03-21 20:52:35] [INFO ] After 21345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:52:35] [INFO ] After 21364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-21 20:52:35] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 391 ms.
Support contains 148 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 6003 transition count 5436
Reduce places removed 467 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 480 rules applied. Total rules applied 947 place count 5536 transition count 5423
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 960 place count 5523 transition count 5423
Performed 489 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 489 Pre rules applied. Total rules applied 960 place count 5523 transition count 4934
Deduced a syphon composed of 489 places in 67 ms
Reduce places removed 489 places and 0 transitions.
Iterating global reduction 3 with 978 rules applied. Total rules applied 1938 place count 5034 transition count 4934
Discarding 663 places :
Symmetric choice reduction at 3 with 663 rule applications. Total rules 2601 place count 4371 transition count 4271
Iterating global reduction 3 with 663 rules applied. Total rules applied 3264 place count 4371 transition count 4271
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 3264 place count 4371 transition count 4000
Deduced a syphon composed of 271 places in 23 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 3806 place count 4100 transition count 4000
Performed 1421 Post agglomeration using F-continuation condition.Transition count delta: 1421
Deduced a syphon composed of 1421 places in 39 ms
Reduce places removed 1421 places and 0 transitions.
Iterating global reduction 3 with 2842 rules applied. Total rules applied 6648 place count 2679 transition count 2579
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 669 times.
Drop transitions removed 669 transitions
Iterating global reduction 3 with 669 rules applied. Total rules applied 7317 place count 2679 transition count 2579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7318 place count 2678 transition count 2578
Applied a total of 7318 rules in 2352 ms. Remains 2678 /6003 variables (removed 3325) and now considering 2578/5903 (removed 3325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2353 ms. Remains : 2678/6003 places, 2578/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 9) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2578 rows 2678 cols
[2023-03-21 20:52:39] [INFO ] Computed 901 place invariants in 83 ms
[2023-03-21 20:52:40] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:52:41] [INFO ] [Nat]Absence check using 895 positive place invariants in 315 ms returned sat
[2023-03-21 20:52:41] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-21 20:52:46] [INFO ] After 4836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:52:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:52:49] [INFO ] After 2871ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 20:52:51] [INFO ] Deduced a trap composed of 8 places in 348 ms of which 6 ms to minimize.
[2023-03-21 20:52:51] [INFO ] Deduced a trap composed of 5 places in 556 ms of which 1 ms to minimize.
[2023-03-21 20:52:52] [INFO ] Deduced a trap composed of 9 places in 622 ms of which 0 ms to minimize.
[2023-03-21 20:52:53] [INFO ] Deduced a trap composed of 7 places in 404 ms of which 2 ms to minimize.
[2023-03-21 20:52:53] [INFO ] Deduced a trap composed of 12 places in 385 ms of which 13 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 15 places in 562 ms of which 1 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 3 ms to minimize.
[2023-03-21 20:52:55] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 1 ms to minimize.
[2023-03-21 20:52:55] [INFO ] Deduced a trap composed of 12 places in 590 ms of which 1 ms to minimize.
[2023-03-21 20:52:56] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 1 ms to minimize.
[2023-03-21 20:52:56] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 1 ms to minimize.
[2023-03-21 20:52:57] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 1 ms to minimize.
[2023-03-21 20:52:57] [INFO ] Deduced a trap composed of 21 places in 383 ms of which 1 ms to minimize.
[2023-03-21 20:52:58] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2023-03-21 20:52:58] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 0 ms to minimize.
[2023-03-21 20:52:59] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 1 ms to minimize.
[2023-03-21 20:52:59] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2023-03-21 20:53:00] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2023-03-21 20:53:01] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2023-03-21 20:53:01] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-21 20:53:01] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 1 ms to minimize.
[2023-03-21 20:53:02] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 13 ms to minimize.
[2023-03-21 20:53:02] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 0 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 0 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-21 20:53:05] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 14705 ms
[2023-03-21 20:53:05] [INFO ] After 18815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 20:53:05] [INFO ] After 25082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 964 ms.
Support contains 143 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 2578/2578 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2678 transition count 2577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2677 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 2671 transition count 2571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 2671 transition count 2571
Applied a total of 15 rules in 347 ms. Remains 2671 /2678 variables (removed 7) and now considering 2571/2578 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 2671/2678 places, 2571/2578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 55009 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55009 steps, saw 51913 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2671 cols
[2023-03-21 20:53:10] [INFO ] Computed 901 place invariants in 85 ms
[2023-03-21 20:53:11] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:53:12] [INFO ] [Nat]Absence check using 895 positive place invariants in 289 ms returned sat
[2023-03-21 20:53:12] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-21 20:53:17] [INFO ] After 4803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:53:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:53:20] [INFO ] After 2675ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 20:53:21] [INFO ] Deduced a trap composed of 7 places in 504 ms of which 1 ms to minimize.
[2023-03-21 20:53:22] [INFO ] Deduced a trap composed of 10 places in 449 ms of which 2 ms to minimize.
[2023-03-21 20:53:22] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 0 ms to minimize.
[2023-03-21 20:53:23] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 1 ms to minimize.
[2023-03-21 20:53:23] [INFO ] Deduced a trap composed of 7 places in 443 ms of which 17 ms to minimize.
[2023-03-21 20:53:24] [INFO ] Deduced a trap composed of 8 places in 514 ms of which 2 ms to minimize.
[2023-03-21 20:53:24] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 1 ms to minimize.
[2023-03-21 20:53:25] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 1 ms to minimize.
[2023-03-21 20:53:25] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 0 ms to minimize.
[2023-03-21 20:53:26] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 1 ms to minimize.
[2023-03-21 20:53:26] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 14 ms to minimize.
[2023-03-21 20:53:27] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2023-03-21 20:53:27] [INFO ] Deduced a trap composed of 12 places in 389 ms of which 1 ms to minimize.
[2023-03-21 20:53:28] [INFO ] Deduced a trap composed of 17 places in 528 ms of which 2 ms to minimize.
[2023-03-21 20:53:28] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 2 ms to minimize.
[2023-03-21 20:53:29] [INFO ] Deduced a trap composed of 15 places in 343 ms of which 1 ms to minimize.
[2023-03-21 20:53:29] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 2 ms to minimize.
[2023-03-21 20:53:30] [INFO ] Deduced a trap composed of 19 places in 553 ms of which 1 ms to minimize.
[2023-03-21 20:53:31] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-21 20:53:31] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 2 ms to minimize.
[2023-03-21 20:53:31] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:53:32] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 25 ms to minimize.
[2023-03-21 20:53:32] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 0 ms to minimize.
[2023-03-21 20:53:33] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2023-03-21 20:53:34] [INFO ] Deduced a trap composed of 17 places in 726 ms of which 0 ms to minimize.
[2023-03-21 20:53:34] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 1 ms to minimize.
[2023-03-21 20:53:35] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 22 ms to minimize.
[2023-03-21 20:53:35] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:53:35] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 0 ms to minimize.
[2023-03-21 20:53:36] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 0 ms to minimize.
[2023-03-21 20:53:36] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 1 ms to minimize.
[2023-03-21 20:53:36] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 15815 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:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-21 20:53:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:53:36] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1097 ms.
Support contains 143 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 93 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2671/2671 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 89 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-21 20:53:38] [INFO ] Invariant cache hit.
[2023-03-21 20:53:40] [INFO ] Implicit Places using invariants in 2731 ms returned [2656]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2740 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2670/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 124 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2954 ms. Remains : 2670/2671 places, 2571/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) 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 92 ms. (steps per millisecond=108 ) 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
Interrupted probabilistic random walk after 57675 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57675 steps, saw 54333 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2670 cols
[2023-03-21 20:53:45] [INFO ] Computed 900 place invariants in 37 ms
[2023-03-21 20:53:45] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:53:46] [INFO ] [Nat]Absence check using 894 positive place invariants in 266 ms returned sat
[2023-03-21 20:53:46] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-21 20:53:51] [INFO ] After 4129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:53:52] [INFO ] Deduced a trap composed of 6 places in 499 ms of which 1 ms to minimize.
[2023-03-21 20:53:53] [INFO ] Deduced a trap composed of 9 places in 537 ms of which 2 ms to minimize.
[2023-03-21 20:53:53] [INFO ] Deduced a trap composed of 9 places in 483 ms of which 1 ms to minimize.
[2023-03-21 20:53:54] [INFO ] Deduced a trap composed of 9 places in 489 ms of which 2 ms to minimize.
[2023-03-21 20:53:54] [INFO ] Deduced a trap composed of 10 places in 487 ms of which 3 ms to minimize.
[2023-03-21 20:53:55] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 1 ms to minimize.
[2023-03-21 20:53:56] [INFO ] Deduced a trap composed of 9 places in 469 ms of which 13 ms to minimize.
[2023-03-21 20:53:56] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 1 ms to minimize.
[2023-03-21 20:53:57] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 0 ms to minimize.
[2023-03-21 20:53:57] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 1 ms to minimize.
[2023-03-21 20:53:58] [INFO ] Deduced a trap composed of 11 places in 428 ms of which 1 ms to minimize.
[2023-03-21 20:53:58] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 1 ms to minimize.
[2023-03-21 20:53:59] [INFO ] Deduced a trap composed of 8 places in 443 ms of which 1 ms to minimize.
[2023-03-21 20:54:00] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 1 ms to minimize.
[2023-03-21 20:54:00] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:54:01] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 0 ms to minimize.
[2023-03-21 20:54:01] [INFO ] Deduced a trap composed of 15 places in 390 ms of which 1 ms to minimize.
[2023-03-21 20:54:02] [INFO ] Deduced a trap composed of 20 places in 368 ms of which 1 ms to minimize.
[2023-03-21 20:54:02] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 1 ms to minimize.
[2023-03-21 20:54:03] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 1 ms to minimize.
[2023-03-21 20:54:03] [INFO ] Deduced a trap composed of 8 places in 387 ms of which 0 ms to minimize.
[2023-03-21 20:54:04] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 1 ms to minimize.
[2023-03-21 20:54:04] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 0 ms to minimize.
[2023-03-21 20:54:04] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:54:05] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 1 ms to minimize.
[2023-03-21 20:54:05] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2023-03-21 20:54:06] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-21 20:54:06] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 1 ms to minimize.
[2023-03-21 20:54:07] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2023-03-21 20:54:07] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 1 ms to minimize.
[2023-03-21 20:54:08] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 1 ms to minimize.
[2023-03-21 20:54:08] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2023-03-21 20:54:09] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2023-03-21 20:54:09] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 0 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 21 places in 455 ms of which 1 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 1 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 19265 ms
[2023-03-21 20:54:10] [INFO ] After 23690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 20:54:10] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 1059 ms.
Support contains 143 out of 2670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 97 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 98 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-21 20:54:12] [INFO ] Invariant cache hit.
[2023-03-21 20:54:14] [INFO ] Implicit Places using invariants in 2167 ms returned []
[2023-03-21 20:54:14] [INFO ] Invariant cache hit.
[2023-03-21 20:54:19] [INFO ] Implicit Places using invariants and state equation in 5400 ms returned []
Implicit Place search using SMT with State Equation took 7575 ms to find 0 implicit places.
[2023-03-21 20:54:20] [INFO ] Redundant transitions in 249 ms returned []
[2023-03-21 20:54:20] [INFO ] Invariant cache hit.
[2023-03-21 20:54:22] [INFO ] Dead Transitions using invariants and state equation in 2542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10487 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 97 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-21 20:54:22] [INFO ] Invariant cache hit.
[2023-03-21 20:54:23] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:54:24] [INFO ] [Nat]Absence check using 894 positive place invariants in 272 ms returned sat
[2023-03-21 20:54:24] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-21 20:54:29] [INFO ] After 4394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:54:30] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-21 20:54:30] [INFO ] Deduced a trap composed of 9 places in 414 ms of which 0 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 8 places in 363 ms of which 1 ms to minimize.
[2023-03-21 20:54:32] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2023-03-21 20:54:32] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 1 ms to minimize.
[2023-03-21 20:54:33] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2023-03-21 20:54:33] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 0 ms to minimize.
[2023-03-21 20:54:34] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2023-03-21 20:54:34] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 1 ms to minimize.
[2023-03-21 20:54:35] [INFO ] Deduced a trap composed of 8 places in 466 ms of which 1 ms to minimize.
[2023-03-21 20:54:36] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 1 ms to minimize.
[2023-03-21 20:54:36] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2023-03-21 20:54:37] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 1 ms to minimize.
[2023-03-21 20:54:37] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 0 ms to minimize.
[2023-03-21 20:54:38] [INFO ] Deduced a trap composed of 19 places in 463 ms of which 1 ms to minimize.
[2023-03-21 20:54:38] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2023-03-21 20:54:38] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 0 ms to minimize.
[2023-03-21 20:54:39] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 1 ms to minimize.
[2023-03-21 20:54:39] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 1 ms to minimize.
[2023-03-21 20:54:40] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-21 20:54:40] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2023-03-21 20:54:40] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 0 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 1 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 11860 ms
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 14 places in 392 ms of which 15 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 0 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 0 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 1 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 0 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 0 ms to minimize.
[2023-03-21 20:54:45] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-21 20:54:45] [INFO ] Deduced a trap composed of 24 places in 355 ms of which 1 ms to minimize.
[2023-03-21 20:54:45] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 0 ms to minimize.
[2023-03-21 20:54:46] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 0 ms to minimize.
[2023-03-21 20:54:46] [INFO ] Deduced a trap composed of 20 places in 333 ms of which 0 ms to minimize.
[2023-03-21 20:54:47] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 2 ms to minimize.
[2023-03-21 20:54:47] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 1 ms to minimize.
[2023-03-21 20:54:48] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 0 ms to minimize.
[2023-03-21 20:54:48] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 0 ms to minimize.
[2023-03-21 20:54:48] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-21 20:54:49] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-21 20:54:49] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2023-03-21 20:54:49] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 4 ms to minimize.
[2023-03-21 20:54:50] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2023-03-21 20:54:50] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 0 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 0 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 0 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 0 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 0 ms to minimize.
[2023-03-21 20:54:54] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:54:54] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 0 ms to minimize.
[2023-03-21 20:54:54] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:54:55] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 1 ms to minimize.
[2023-03-21 20:54:55] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-21 20:54:55] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 0 ms to minimize.
[2023-03-21 20:54:56] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:54:56] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2023-03-21 20:54:56] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:54:57] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 15293 ms
[2023-03-21 20:54:58] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2023-03-21 20:54:58] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 0 ms to minimize.
[2023-03-21 20:54:59] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 0 ms to minimize.
[2023-03-21 20:54:59] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 1 ms to minimize.
[2023-03-21 20:55:00] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 0 ms to minimize.
[2023-03-21 20:55:00] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:55:01] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 1 ms to minimize.
[2023-03-21 20:55:01] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 1 ms to minimize.
[2023-03-21 20:55:02] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-21 20:55:02] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 2 ms to minimize.
[2023-03-21 20:55:03] [INFO ] Deduced a trap composed of 8 places in 454 ms of which 0 ms to minimize.
[2023-03-21 20:55:03] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 0 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 9 places in 327 ms of which 0 ms to minimize.
[2023-03-21 20:55:05] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 1 ms to minimize.
[2023-03-21 20:55:05] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:55:06] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2023-03-21 20:55:06] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 0 ms to minimize.
[2023-03-21 20:55:06] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 0 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:55:08] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-21 20:55:08] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 0 ms to minimize.
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:55:11] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 0 ms to minimize.
[2023-03-21 20:55:11] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-21 20:55:11] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2023-03-21 20:55:12] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2023-03-21 20:55:12] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2023-03-21 20:55:12] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 15042 ms
[2023-03-21 20:55:14] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 0 ms to minimize.
[2023-03-21 20:55:14] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 2 ms to minimize.
[2023-03-21 20:55:15] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2023-03-21 20:55:16] [INFO ] Deduced a trap composed of 11 places in 401 ms of which 1 ms to minimize.
[2023-03-21 20:55:16] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 1 ms to minimize.
[2023-03-21 20:55:17] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-21 20:55:17] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-21 20:55:18] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 1 ms to minimize.
[2023-03-21 20:55:18] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 1 ms to minimize.
[2023-03-21 20:55:19] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 0 ms to minimize.
[2023-03-21 20:55:19] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 0 ms to minimize.
[2023-03-21 20:55:20] [INFO ] Deduced a trap composed of 13 places in 629 ms of which 1 ms to minimize.
[2023-03-21 20:55:21] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 0 ms to minimize.
[2023-03-21 20:55:21] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 1 ms to minimize.
[2023-03-21 20:55:22] [INFO ] Deduced a trap composed of 15 places in 731 ms of which 1 ms to minimize.
[2023-03-21 20:55:22] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 0 ms to minimize.
[2023-03-21 20:55:23] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 0 ms to minimize.
[2023-03-21 20:55:23] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 1 ms to minimize.
[2023-03-21 20:55:24] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 0 ms to minimize.
[2023-03-21 20:55:24] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 1 ms to minimize.
[2023-03-21 20:55:25] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 1 ms to minimize.
[2023-03-21 20:55:25] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 0 ms to minimize.
[2023-03-21 20:55:26] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 0 ms to minimize.
[2023-03-21 20:55:26] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 1 ms to minimize.
[2023-03-21 20:55:27] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2023-03-21 20:55:27] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2023-03-21 20:55:27] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 0 ms to minimize.
[2023-03-21 20:55:28] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 0 ms to minimize.
[2023-03-21 20:55:28] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-21 20:55:29] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 1 ms to minimize.
[2023-03-21 20:55:29] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 0 ms to minimize.
[2023-03-21 20:55:29] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 0 ms to minimize.
[2023-03-21 20:55:30] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 0 ms to minimize.
[2023-03-21 20:55:30] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2023-03-21 20:55:31] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:55:32] [INFO ] Deduced a trap composed of 40 places in 554 ms of which 1 ms to minimize.
[2023-03-21 20:55:32] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 0 ms to minimize.
[2023-03-21 20:55:32] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2023-03-21 20:55:33] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 0 ms to minimize.
[2023-03-21 20:55:33] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 1 ms to minimize.
[2023-03-21 20:55:34] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 1 ms to minimize.
[2023-03-21 20:55:34] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-21 20:55:34] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 0 ms to minimize.
[2023-03-21 20:55:34] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 21400 ms
[2023-03-21 20:55:35] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:55:35] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 26 ms to minimize.
[2023-03-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2023-03-21 20:55:36] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-21 20:55:36] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:55:37] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 0 ms to minimize.
[2023-03-21 20:55:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2235 ms
[2023-03-21 20:55:37] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 1 ms to minimize.
[2023-03-21 20:55:38] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-21 20:55:38] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-21 20:55:38] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 22 ms to minimize.
[2023-03-21 20:55:39] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2023-03-21 20:55:39] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 1 ms to minimize.
[2023-03-21 20:55:40] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-21 20:55:40] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 3 ms to minimize.
[2023-03-21 20:55:40] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 0 ms to minimize.
[2023-03-21 20:55:41] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 18 ms to minimize.
[2023-03-21 20:55:41] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 10 ms to minimize.
[2023-03-21 20:55:42] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 1 ms to minimize.
[2023-03-21 20:55:42] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2023-03-21 20:55:42] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 2 ms to minimize.
[2023-03-21 20:55:43] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-21 20:55:43] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:55:44] [INFO ] Deduced a trap composed of 14 places in 413 ms of which 1 ms to minimize.
[2023-03-21 20:55:44] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 1 ms to minimize.
[2023-03-21 20:55:45] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 1 ms to minimize.
[2023-03-21 20:55:45] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 0 ms to minimize.
[2023-03-21 20:55:46] [INFO ] Deduced a trap composed of 16 places in 417 ms of which 1 ms to minimize.
[2023-03-21 20:55:46] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:55:47] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 1 ms to minimize.
[2023-03-21 20:55:47] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-21 20:55:48] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 0 ms to minimize.
[2023-03-21 20:55:48] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 1 ms to minimize.
[2023-03-21 20:55:48] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 0 ms to minimize.
[2023-03-21 20:55:49] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2023-03-21 20:55:49] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 1 ms to minimize.
[2023-03-21 20:55:50] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 0 ms to minimize.
[2023-03-21 20:55:50] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2023-03-21 20:55:51] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 0 ms to minimize.
[2023-03-21 20:55:51] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:55:51] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-21 20:55:52] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-03-21 20:55:52] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 0 ms to minimize.
[2023-03-21 20:55:52] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 15165 ms
[2023-03-21 20:55:53] [INFO ] Deduced a trap composed of 12 places in 808 ms of which 1 ms to minimize.
[2023-03-21 20:55:54] [INFO ] Deduced a trap composed of 5 places in 595 ms of which 2 ms to minimize.
[2023-03-21 20:55:55] [INFO ] Deduced a trap composed of 24 places in 789 ms of which 1 ms to minimize.
[2023-03-21 20:55:56] [INFO ] Deduced a trap composed of 12 places in 598 ms of which 1 ms to minimize.
[2023-03-21 20:55:57] [INFO ] Deduced a trap composed of 18 places in 824 ms of which 1 ms to minimize.
[2023-03-21 20:55:57] [INFO ] Deduced a trap composed of 28 places in 656 ms of which 1 ms to minimize.
[2023-03-21 20:55:58] [INFO ] Deduced a trap composed of 30 places in 745 ms of which 1 ms to minimize.
[2023-03-21 20:55:59] [INFO ] Deduced a trap composed of 22 places in 635 ms of which 1 ms to minimize.
[2023-03-21 20:56:00] [INFO ] Deduced a trap composed of 15 places in 589 ms of which 1 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 19 places in 682 ms of which 1 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 26 places in 665 ms of which 2 ms to minimize.
[2023-03-21 20:56:02] [INFO ] Deduced a trap composed of 21 places in 546 ms of which 2 ms to minimize.
[2023-03-21 20:56:03] [INFO ] Deduced a trap composed of 16 places in 566 ms of which 1 ms to minimize.
[2023-03-21 20:56:03] [INFO ] Deduced a trap composed of 8 places in 587 ms of which 1 ms to minimize.
[2023-03-21 20:56:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 11105 ms
[2023-03-21 20:56:04] [INFO ] After 99218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3337 ms.
[2023-03-21 20:56:07] [INFO ] After 103895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-21 20:56:07] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 30 ms.
[2023-03-21 20:56:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2670 places, 2571 transitions and 12526 arcs took 41 ms.
[2023-03-21 20:56:08] [INFO ] Flatten gal took : 396 ms
Total runtime 241705 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1422/inv_0_ --invariant=/tmp/1422/inv_1_ --invariant=/tmp/1422/inv_2_ --invariant=/tmp/1422/inv_3_ --invariant=/tmp/1422/inv_4_ --invariant=/tmp/1422/inv_5_ --invariant=/tmp/1422/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 152052 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16309652 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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