fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r421-tajo-167905974900175
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldRVs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.903 3600000.00 10177268.00 263958.20 ??TTTFT?TF??T?T? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900175.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 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.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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.3M 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 ShieldRVs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679170741053

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 20:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:19:02] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-18 20:19:03] [INFO ] Transformed 4003 places.
[2023-03-18 20:19:03] [INFO ] Transformed 4503 transitions.
[2023-03-18 20:19:03] [INFO ] Found NUPN structural information;
[2023-03-18 20:19:03] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 16) seen :5
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) 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 11) seen :0
[2023-03-18 20:19:04] [INFO ] Flatten gal took : 518 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
[2023-03-18 20:19:04] [INFO ] Flatten gal took : 245 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
[2023-03-18 20:19:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4352452747880134714.gal : 49 ms
[2023-03-18 20:19:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5864925658147142017.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4352452747880134714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5864925658147142017.prop' '--nowitness' '--gen-order' 'FOLLOW'

Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Running SMT prover for 11 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-18 20:19:04] [INFO ] Computed 401 place invariants in 50 ms
Loading property file /tmp/ReachabilityCardinality5864925658147142017.prop.
[2023-03-18 20:19:06] [INFO ] After 1496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 20:19:07] [INFO ] [Nat]Absence check using 401 positive place invariants in 222 ms returned sat
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :69 after 250
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :250 after 1.7328e+10
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1.7328e+10 after 4.17975e+27
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :4.17975e+27 after 5.49086e+62
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :5.49086e+62 after 3.70152e+132
[2023-03-18 20:19:31] [INFO ] After 22941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-18 20:19:31] [INFO ] After 22949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 20:19:31] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 917 ms.
Support contains 296 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 4003 transition count 4159
Reduce places removed 344 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 360 rules applied. Total rules applied 704 place count 3659 transition count 4143
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 720 place count 3643 transition count 4143
Performed 478 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 478 Pre rules applied. Total rules applied 720 place count 3643 transition count 3665
Deduced a syphon composed of 478 places in 14 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 1676 place count 3165 transition count 3665
Discarding 644 places :
Symmetric choice reduction at 3 with 644 rule applications. Total rules 2320 place count 2521 transition count 3021
Iterating global reduction 3 with 644 rules applied. Total rules applied 2964 place count 2521 transition count 3021
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 208 Pre rules applied. Total rules applied 2964 place count 2521 transition count 2813
Deduced a syphon composed of 208 places in 12 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 3380 place count 2313 transition count 2813
Performed 637 Post agglomeration using F-continuation condition.Transition count delta: 637
Deduced a syphon composed of 637 places in 18 ms
Reduce places removed 637 places and 0 transitions.
Iterating global reduction 3 with 1274 rules applied. Total rules applied 4654 place count 1676 transition count 2176
Partial Free-agglomeration rule applied 161 times.
Drop transitions removed 161 transitions
Iterating global reduction 3 with 161 rules applied. Total rules applied 4815 place count 1676 transition count 2176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4816 place count 1675 transition count 2175
Applied a total of 4816 rules in 1203 ms. Remains 1675 /4003 variables (removed 2328) and now considering 2175/4503 (removed 2328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1204 ms. Remains : 1675/4003 places, 2175/4503 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 11) seen :3
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2175 rows 1675 cols
[2023-03-18 20:19:34] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-18 20:19:34] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:19:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 93 ms returned sat
[2023-03-18 20:19:38] [INFO ] After 2706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 5 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 2 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 2 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 5 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 6 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10429 ms
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 0 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-18 20:19:52] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:19:52] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-18 20:19:52] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:19:52] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:19:53] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-18 20:19:53] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:19:53] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2023-03-18 20:19:53] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 14 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5504 ms
[2023-03-18 20:19:55] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2023-03-18 20:19:55] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2023-03-18 20:19:56] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 1 ms to minimize.
[2023-03-18 20:19:56] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 1 ms to minimize.
[2023-03-18 20:19:57] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 2 ms to minimize.
[2023-03-18 20:19:57] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 2 ms to minimize.
[2023-03-18 20:19:57] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-18 20:19:58] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 2 ms to minimize.
[2023-03-18 20:19:58] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2023-03-18 20:19:58] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 1 ms to minimize.
[2023-03-18 20:19:59] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 1 ms to minimize.
[2023-03-18 20:19:59] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 0 ms to minimize.
[2023-03-18 20:20:00] [INFO ] Deduced a trap composed of 16 places in 293 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.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-18 20:20:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:20:00] [INFO ] After 25311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 526 ms.
Support contains 256 out of 1675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1675/1675 places, 2175/2175 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1675 transition count 2171
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1671 transition count 2171
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 1671 transition count 2161
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 1661 transition count 2161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1660 transition count 2160
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1660 transition count 2160
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 1647 transition count 2147
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 1647 transition count 2147
Applied a total of 61 rules in 234 ms. Remains 1647 /1675 variables (removed 28) and now considering 2147/2175 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 1647/1675 places, 2147/2175 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 8) seen :1
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2147 rows 1647 cols
[2023-03-18 20:20:01] [INFO ] Computed 401 place invariants in 37 ms
[2023-03-18 20:20:01] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:20:02] [INFO ] [Nat]Absence check using 401 positive place invariants in 97 ms returned sat
[2023-03-18 20:20:04] [INFO ] After 2257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 1 ms to minimize.
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 1 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 0 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 2 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 8 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 1 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 0 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 1 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 0 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 0 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 0 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 0 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 1 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 0 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2023-03-18 20:20:18] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2023-03-18 20:20:18] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 13070 ms
[2023-03-18 20:20:18] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2023-03-18 20:20:18] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 0 ms to minimize.
[2023-03-18 20:20:19] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
[2023-03-18 20:20:19] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-18 20:20:20] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 2 ms to minimize.
[2023-03-18 20:20:20] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 0 ms to minimize.
[2023-03-18 20:20:20] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2023-03-18 20:20:21] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-18 20:20:21] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2023-03-18 20:20:21] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 1 ms to minimize.
[2023-03-18 20:20:22] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2023-03-18 20:20:22] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:20:22] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 2 ms to minimize.
[2023-03-18 20:20:22] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 0 ms to minimize.
[2023-03-18 20:20:23] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2023-03-18 20:20:23] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-18 20:20:23] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 0 ms to minimize.
[2023-03-18 20:20:24] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-18 20:20:24] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 0 ms to minimize.
[2023-03-18 20:20:24] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 0 ms to minimize.
[2023-03-18 20:20:24] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6374 ms
[2023-03-18 20:20:25] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
[2023-03-18 20:20:25] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 0 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 1 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 1 ms to minimize.
[2023-03-18 20:20:27] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 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.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-18 20:20:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:20:27] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 495 ms.
Support contains 255 out of 1647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1647/1647 places, 2147/2147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1646 transition count 2146
Applied a total of 2 rules in 185 ms. Remains 1646 /1647 variables (removed 1) and now considering 2146/2147 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1646/1647 places, 2146/2147 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 550 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 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 65773 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65773 steps, saw 32895 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2146 rows 1646 cols
[2023-03-18 20:20:31] [INFO ] Computed 401 place invariants in 10 ms
[2023-03-18 20:20:32] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:20:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 86 ms returned sat
[2023-03-18 20:20:35] [INFO ] After 2763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 2 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7139 ms
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 1 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 1 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 0 ms to minimize.
[2023-03-18 20:20:47] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 0 ms to minimize.
[2023-03-18 20:20:47] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-18 20:20:47] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 0 ms to minimize.
[2023-03-18 20:20:48] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 1 ms to minimize.
[2023-03-18 20:20:48] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 1 ms to minimize.
[2023-03-18 20:20:49] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-18 20:20:49] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 0 ms to minimize.
[2023-03-18 20:20:49] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-18 20:20:50] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 1 ms to minimize.
[2023-03-18 20:20:50] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2023-03-18 20:20:50] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2023-03-18 20:20:51] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 0 ms to minimize.
[2023-03-18 20:20:51] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 3 ms to minimize.
[2023-03-18 20:20:51] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2023-03-18 20:20:51] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8268 ms
[2023-03-18 20:20:52] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-18 20:20:52] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-18 20:20:53] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2023-03-18 20:20:53] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 0 ms to minimize.
[2023-03-18 20:20:53] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 0 ms to minimize.
[2023-03-18 20:20:54] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-18 20:20:54] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2023-03-18 20:20:54] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2023-03-18 20:20:55] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2023-03-18 20:20:55] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-18 20:20:55] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 1 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2023-03-18 20:20:57] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2023-03-18 20:20:57] [INFO ] Deduced a trap composed of 20 places in 241 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.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-18 20:20:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:20:57] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 398 ms.
Support contains 255 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 2146/2146 transitions.
Applied a total of 0 rules in 53 ms. Remains 1646 /1646 variables (removed 0) and now considering 2146/2146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1646/1646 places, 2146/2146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 2146/2146 transitions.
Applied a total of 0 rules in 52 ms. Remains 1646 /1646 variables (removed 0) and now considering 2146/2146 (removed 0) transitions.
[2023-03-18 20:20:58] [INFO ] Invariant cache hit.
[2023-03-18 20:20:58] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-18 20:20:58] [INFO ] Invariant cache hit.
[2023-03-18 20:21:00] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2023-03-18 20:21:01] [INFO ] Redundant transitions in 550 ms returned []
[2023-03-18 20:21:01] [INFO ] Invariant cache hit.
[2023-03-18 20:21:02] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4415 ms. Remains : 1646/1646 places, 2146/2146 transitions.
Applied a total of 0 rules in 52 ms. Remains 1646 /1646 variables (removed 0) and now considering 2146/2146 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-18 20:21:02] [INFO ] Invariant cache hit.
[2023-03-18 20:21:02] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:21:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 84 ms returned sat
[2023-03-18 20:21:06] [INFO ] After 3041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:21:07] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 1 ms to minimize.
[2023-03-18 20:21:07] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2023-03-18 20:21:07] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 2 ms to minimize.
[2023-03-18 20:21:08] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 0 ms to minimize.
[2023-03-18 20:21:08] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2023-03-18 20:21:08] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 0 ms to minimize.
[2023-03-18 20:21:08] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-18 20:21:09] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:21:09] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 0 ms to minimize.
[2023-03-18 20:21:09] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-18 20:21:10] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-18 20:21:10] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2023-03-18 20:21:10] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2023-03-18 20:21:10] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2023-03-18 20:21:11] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-18 20:21:11] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-18 20:21:11] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:21:14] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2023-03-18 20:21:14] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2023-03-18 20:21:14] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:21:14] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-18 20:21:15] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2023-03-18 20:21:15] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:21:15] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2023-03-18 20:21:15] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2023-03-18 20:21:16] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2023-03-18 20:21:16] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-18 20:21:16] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-18 20:21:16] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:21:16] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:21:17] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 11176 ms
[2023-03-18 20:21:18] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 0 ms to minimize.
[2023-03-18 20:21:18] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-18 20:21:18] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-18 20:21:19] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2023-03-18 20:21:19] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2023-03-18 20:21:19] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 2 ms to minimize.
[2023-03-18 20:21:19] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2023-03-18 20:21:20] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-18 20:21:20] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:21:20] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-18 20:21:20] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-18 20:21:21] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:21:21] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2023-03-18 20:21:21] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-18 20:21:21] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-18 20:21:22] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:21:22] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:21:22] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-18 20:21:22] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-18 20:21:22] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2023-03-18 20:21:23] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2023-03-18 20:21:23] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 1 ms to minimize.
[2023-03-18 20:21:23] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-18 20:21:24] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2023-03-18 20:21:24] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2023-03-18 20:21:24] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:21:24] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-18 20:21:24] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6728 ms
[2023-03-18 20:21:25] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-18 20:21:25] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2023-03-18 20:21:26] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2023-03-18 20:21:26] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-18 20:21:26] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-18 20:21:26] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:21:27] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:21:27] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-18 20:21:27] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:21:28] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 0 ms to minimize.
[2023-03-18 20:21:28] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2023-03-18 20:21:28] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2023-03-18 20:21:28] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-18 20:21:29] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-18 20:21:29] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-18 20:21:29] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 0 ms to minimize.
[2023-03-18 20:21:30] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-18 20:21:30] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2023-03-18 20:21:30] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
[2023-03-18 20:21:30] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-18 20:21:31] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-18 20:21:31] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2023-03-18 20:21:31] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:21:32] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-18 20:21:32] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-18 20:21:32] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-18 20:21:32] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:21:33] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 0 ms to minimize.
[2023-03-18 20:21:33] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 0 ms to minimize.
[2023-03-18 20:21:33] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:21:33] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:21:34] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2023-03-18 20:21:34] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2023-03-18 20:21:34] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-18 20:21:34] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-03-18 20:21:35] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:21:36] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10975 ms
[2023-03-18 20:21:36] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-18 20:21:36] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2023-03-18 20:21:37] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:21:37] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 0 ms to minimize.
[2023-03-18 20:21:37] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-18 20:21:37] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 0 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2023-03-18 20:21:39] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2023-03-18 20:21:39] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 0 ms to minimize.
[2023-03-18 20:21:39] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 1 ms to minimize.
[2023-03-18 20:21:40] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2023-03-18 20:21:40] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:21:40] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:21:40] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2023-03-18 20:21:41] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2023-03-18 20:21:41] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:21:41] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2023-03-18 20:21:41] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2023-03-18 20:21:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5833 ms
[2023-03-18 20:21:42] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2023-03-18 20:21:42] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-18 20:21:42] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2023-03-18 20:21:43] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2023-03-18 20:21:43] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:21:43] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 0 ms to minimize.
[2023-03-18 20:21:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1837 ms
[2023-03-18 20:21:44] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 1 ms to minimize.
[2023-03-18 20:21:44] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 0 ms to minimize.
[2023-03-18 20:21:45] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 0 ms to minimize.
[2023-03-18 20:21:45] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 0 ms to minimize.
[2023-03-18 20:21:45] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-18 20:21:46] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2023-03-18 20:21:46] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:21:46] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-18 20:21:47] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-18 20:21:47] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-18 20:21:47] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 0 ms to minimize.
[2023-03-18 20:21:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3553 ms
[2023-03-18 20:21:49] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2023-03-18 20:21:49] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 0 ms to minimize.
[2023-03-18 20:21:49] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2023-03-18 20:21:50] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 1 ms to minimize.
[2023-03-18 20:21:50] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 0 ms to minimize.
[2023-03-18 20:21:51] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-18 20:21:51] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2023-03-18 20:21:51] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2023-03-18 20:21:52] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-18 20:21:52] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2023-03-18 20:21:52] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 0 ms to minimize.
[2023-03-18 20:21:53] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 1 ms to minimize.
[2023-03-18 20:21:53] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 0 ms to minimize.
[2023-03-18 20:21:53] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:21:54] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 0 ms to minimize.
[2023-03-18 20:21:54] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-18 20:21:54] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 0 ms to minimize.
[2023-03-18 20:21:55] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:21:55] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-18 20:21:55] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2023-03-18 20:21:56] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 0 ms to minimize.
[2023-03-18 20:21:56] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 0 ms to minimize.
[2023-03-18 20:21:56] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:21:57] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:21:57] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 0 ms to minimize.
[2023-03-18 20:21:57] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 0 ms to minimize.
[2023-03-18 20:21:58] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:21:58] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2023-03-18 20:21:58] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9827 ms
[2023-03-18 20:21:58] [INFO ] After 55213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3431 ms.
[2023-03-18 20:22:02] [INFO ] After 59217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:22:02] [INFO ] Flatten gal took : 224 ms
[2023-03-18 20:22:02] [INFO ] Applying decomposition
[2023-03-18 20:22:02] [INFO ] Flatten gal took : 225 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17959280398505565763.txt' '-o' '/tmp/graph17959280398505565763.bin' '-w' '/tmp/graph17959280398505565763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17959280398505565763.bin' '-l' '-1' '-v' '-w' '/tmp/graph17959280398505565763.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:22:03] [INFO ] Decomposing Gal with order
[2023-03-18 20:22:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:22:04] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:22:04] [INFO ] Flatten gal took : 334 ms
[2023-03-18 20:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2023-03-18 20:22:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14178791176576766213.gal : 52 ms
[2023-03-18 20:22:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2972959811650042319.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14178791176576766213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2972959811650042319.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2972959811650042319.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 373
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :373 after 28375
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :28375 after 2.32476e+07
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2.32476e+07 after 6.306e+07
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :6.306e+07 after 9.96955e+07
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :9.96955e+07 after 9.96955e+07
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :9.96955e+07 after 3.76692e+10
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3.76692e+10 after 7.54095e+219
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 20:52:08] [INFO ] Flatten gal took : 729 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15152795658889357943
[2023-03-18 20:52:09] [INFO ] Too many transitions (2146) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:52:09] [INFO ] Applying decomposition
[2023-03-18 20:52:09] [INFO ] Built C files in 516ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15152795658889357943
Running compilation step : cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 20:52:10] [INFO ] Flatten gal took : 802 ms
Compilation finished in 5350 ms.
Running link step : cd /tmp/ltsmin15152795658889357943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability00==true'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7696503822592648456.txt' '-o' '/tmp/graph7696503822592648456.bin' '-w' '/tmp/graph7696503822592648456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7696503822592648456.bin' '-l' '-1' '-v' '-w' '/tmp/graph7696503822592648456.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:52:20] [INFO ] Decomposing Gal with order
[2023-03-18 20:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:52:21] [INFO ] Removed a total of 2584 redundant transitions.
[2023-03-18 20:52:21] [INFO ] Flatten gal took : 793 ms
[2023-03-18 20:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1659 labels/synchronizations in 482 ms.
[2023-03-18 20:52:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2987490373691786949.gal : 86 ms
[2023-03-18 20:52:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18368536559126530158.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2987490373691786949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18368536559126530158.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability18368536559126530158.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 51
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :51 after 1.4336e+09
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.4336e+09 after 1.46353e+11
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1.46353e+11 after 1.44321e+24
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability01==true'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability07==true'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability07==true'
Running LTSmin : cd /tmp/ltsmin15152795658889357943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT100BReachabilityFireability10==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4712992 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102972 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905974900175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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