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-167903716700146.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-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:34 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.8K 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.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 426K 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-050A-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679428124739

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:48:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:48:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:48:47] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-21 19:48:47] [INFO ] Transformed 1253 places.
[2023-03-21 19:48:47] [INFO ] Transformed 1203 transitions.
[2023-03-21 19:48:47] [INFO ] Found NUPN structural information;
[2023-03-21 19:48:47] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 172 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 98 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-21 19:48:48] [INFO ] Computed 451 place invariants in 27 ms
[2023-03-21 19:48:49] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2023-03-21 19:48:49] [INFO ] Invariant cache hit.
[2023-03-21 19:48:51] [INFO ] Implicit Places using invariants and state equation in 2437 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2023-03-21 19:48:51] [INFO ] Invariant cache hit.
[2023-03-21 19:48:52] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4785 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 172 out of 1253 places after structural reductions.
[2023-03-21 19:48:53] [INFO ] Flatten gal took : 235 ms
[2023-03-21 19:48:53] [INFO ] Flatten gal took : 108 ms
[2023-03-21 19:48:53] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 171 out of 1253 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 67) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 19:48:54] [INFO ] Invariant cache hit.
[2023-03-21 19:48:55] [INFO ] [Real]Absence check using 451 positive place invariants in 142 ms returned sat
[2023-03-21 19:48:56] [INFO ] After 2085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 19:48:57] [INFO ] [Nat]Absence check using 451 positive place invariants in 146 ms returned sat
[2023-03-21 19:48:59] [INFO ] After 1529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 9 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 10 ms to minimize.
[2023-03-21 19:48:59] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 728 ms
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2023-03-21 19:49:00] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 0 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-21 19:49:01] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1787 ms
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:49:02] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 11 ms to minimize.
[2023-03-21 19:49:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1263 ms
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 15 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2023-03-21 19:49:04] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1115 ms
[2023-03-21 19:49:05] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-21 19:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-21 19:49:05] [INFO ] After 7899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1079 ms.
[2023-03-21 19:49:06] [INFO ] After 9900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1403 ms.
Support contains 39 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 327 times.
Drop transitions removed 327 transitions
Iterating global reduction 0 with 327 rules applied. Total rules applied 331 place count 1251 transition count 1201
Applied a total of 331 rules in 235 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-21 19:49:09] [INFO ] Computed 451 place invariants in 38 ms
[2023-03-21 19:49:09] [INFO ] [Real]Absence check using 436 positive place invariants in 104 ms returned sat
[2023-03-21 19:49:09] [INFO ] [Real]Absence check using 436 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-21 19:49:10] [INFO ] After 1615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 19:49:11] [INFO ] [Nat]Absence check using 436 positive place invariants in 85 ms returned sat
[2023-03-21 19:49:11] [INFO ] [Nat]Absence check using 436 positive and 15 generalized place invariants in 15 ms returned sat
[2023-03-21 19:49:15] [INFO ] After 3696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 19:49:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:49:17] [INFO ] After 1946ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 19:49:17] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-21 19:49:17] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2023-03-21 19:49:18] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 9 ms to minimize.
[2023-03-21 19:49:19] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 13 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:49:20] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3659 ms
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-21 19:49:21] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 14 ms to minimize.
[2023-03-21 19:49:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:49:23] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-21 19:49:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1585 ms
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-21 19:49:24] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 1 ms to minimize.
[2023-03-21 19:49:25] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-21 19:49:26] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-21 19:49:26] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 1 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 0 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 26 ms to minimize.
[2023-03-21 19:49:27] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 7 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 2 ms to minimize.
[2023-03-21 19:49:28] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 15 places in 370 ms of which 13 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6794 ms
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 0 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2657 ms
[2023-03-21 19:49:33] [INFO ] After 18241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1326 ms.
[2023-03-21 19:49:34] [INFO ] After 23960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 557 ms.
Support contains 31 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 124 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-21 19:49:36] [INFO ] Computed 451 place invariants in 29 ms
[2023-03-21 19:49:36] [INFO ] [Real]Absence check using 438 positive place invariants in 165 ms returned sat
[2023-03-21 19:49:36] [INFO ] [Real]Absence check using 438 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-21 19:49:37] [INFO ] After 1560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:49:38] [INFO ] [Nat]Absence check using 438 positive place invariants in 93 ms returned sat
[2023-03-21 19:49:38] [INFO ] [Nat]Absence check using 438 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-21 19:49:41] [INFO ] After 2678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:49:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:49:42] [INFO ] After 1412ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 19:49:42] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1912 ms
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3831 ms
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-21 19:49:53] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-21 19:49:54] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2023-03-21 19:49:55] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-21 19:49:55] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 17 places in 534 ms of which 0 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:49:56] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 0 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 13 ms to minimize.
[2023-03-21 19:49:58] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-21 19:50:00] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:50:01] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 0 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-21 19:50:02] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-21 19:50:03] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 19:50:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:50:03] [INFO ] After 25150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 397 ms.
Support contains 28 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1251 transition count 1201
Applied a total of 2 rules in 65 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 100308 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Probabilistic random walk after 100308 steps, saw 96255 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-21 19:50:07] [INFO ] Computed 451 place invariants in 36 ms
[2023-03-21 19:50:07] [INFO ] [Real]Absence check using 440 positive place invariants in 69 ms returned sat
[2023-03-21 19:50:07] [INFO ] [Real]Absence check using 440 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-21 19:50:08] [INFO ] After 1304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:50:09] [INFO ] [Nat]Absence check using 440 positive place invariants in 124 ms returned sat
[2023-03-21 19:50:09] [INFO ] [Nat]Absence check using 440 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-21 19:50:11] [INFO ] After 2275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:50:12] [INFO ] After 666ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:13] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 0 ms to minimize.
[2023-03-21 19:50:14] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2023-03-21 19:50:15] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:50:16] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:50:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4435 ms
[2023-03-21 19:50:19] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-21 19:50:20] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-21 19:50:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3934 ms
[2023-03-21 19:50:22] [INFO ] After 11498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1137 ms.
[2023-03-21 19:50:24] [INFO ] After 15576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 603 ms.
Support contains 24 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1251 transition count 1201
Applied a total of 3 rules in 59 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 115586 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115586 steps, saw 110777 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-21 19:50:28] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 19:50:28] [INFO ] [Real]Absence check using 443 positive place invariants in 87 ms returned sat
[2023-03-21 19:50:28] [INFO ] [Real]Absence check using 443 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-21 19:50:30] [INFO ] After 1883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 19:50:30] [INFO ] [Nat]Absence check using 443 positive place invariants in 79 ms returned sat
[2023-03-21 19:50:30] [INFO ] [Nat]Absence check using 443 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-21 19:50:32] [INFO ] After 1782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 19:50:35] [INFO ] After 2809ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 19:50:35] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-21 19:50:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2023-03-21 19:50:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1066 ms
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-21 19:50:37] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-21 19:50:38] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-21 19:50:39] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 1 ms to minimize.
[2023-03-21 19:50:40] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-21 19:50:41] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-21 19:50:42] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 0 ms to minimize.
[2023-03-21 19:50:42] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-21 19:50:42] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-21 19:50:42] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-21 19:50:43] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-21 19:50:45] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8069 ms
[2023-03-21 19:50:45] [INFO ] After 12846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 915 ms.
[2023-03-21 19:50:46] [INFO ] After 16046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 356 ms.
Support contains 24 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 34 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 33 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-21 19:50:46] [INFO ] Invariant cache hit.
[2023-03-21 19:50:47] [INFO ] Implicit Places using invariants in 1123 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1190 ms. Remains : 1250/1251 places, 1201/1201 transitions.
[2023-03-21 19:50:47] [INFO ] Flatten gal took : 69 ms
[2023-03-21 19:50:47] [INFO ] Flatten gal took : 73 ms
[2023-03-21 19:50:47] [INFO ] Input system was already deterministic with 1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 86 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 65 ms
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 70 ms
[2023-03-21 19:50:48] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 59 ms
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 62 ms
[2023-03-21 19:50:48] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 72 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 56 ms
[2023-03-21 19:50:48] [INFO ] Flatten gal took : 58 ms
[2023-03-21 19:50:48] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 62 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 72 ms
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 82 ms
[2023-03-21 19:50:49] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 101 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 51 ms
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 53 ms
[2023-03-21 19:50:49] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 54 ms
[2023-03-21 19:50:49] [INFO ] Flatten gal took : 57 ms
[2023-03-21 19:50:49] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 54 ms
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 59 ms
[2023-03-21 19:50:50] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 54 ms
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 55 ms
[2023-03-21 19:50:50] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 85 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 48 ms
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 49 ms
[2023-03-21 19:50:50] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 58 ms
[2023-03-21 19:50:50] [INFO ] Flatten gal took : 72 ms
[2023-03-21 19:50:51] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 78 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:51] [INFO ] Flatten gal took : 51 ms
[2023-03-21 19:50:51] [INFO ] Flatten gal took : 74 ms
[2023-03-21 19:50:51] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:51] [INFO ] Flatten gal took : 57 ms
[2023-03-21 19:50:51] [INFO ] Flatten gal took : 64 ms
[2023-03-21 19:50:51] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 105 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:51] [INFO ] Flatten gal took : 70 ms
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 61 ms
[2023-03-21 19:50:52] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 50 ms
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 51 ms
[2023-03-21 19:50:52] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 77 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 50 ms
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 50 ms
[2023-03-21 19:50:52] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 52 ms
[2023-03-21 19:50:52] [INFO ] Flatten gal took : 55 ms
[2023-03-21 19:50:53] [INFO ] Input system was already deterministic with 1203 transitions.
[2023-03-21 19:50:53] [INFO ] Flatten gal took : 59 ms
[2023-03-21 19:50:53] [INFO ] Flatten gal took : 58 ms
[2023-03-21 19:50:53] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 19:50:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 5 ms.
Total runtime 125754 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 --ctl=/tmp/1183/ctl_0_ --ctl=/tmp/1183/ctl_1_ --ctl=/tmp/1183/ctl_2_ --ctl=/tmp/1183/ctl_3_ --ctl=/tmp/1183/ctl_4_ --ctl=/tmp/1183/ctl_5_ --ctl=/tmp/1183/ctl_6_ --ctl=/tmp/1183/ctl_7_ --ctl=/tmp/1183/ctl_8_ --ctl=/tmp/1183/ctl_9_ --ctl=/tmp/1183/ctl_10_ --ctl=/tmp/1183/ctl_11_ --ctl=/tmp/1183/ctl_12_ --ctl=/tmp/1183/ctl_13_ --ctl=/tmp/1183/ctl_14_ --ctl=/tmp/1183/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11876356 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096900 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-050A"
export BK_EXAMINATION="CTLFireability"
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-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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