About the Execution of 2023-gold for ShieldRVs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 674.155 | 356708.00 | 382671.00 | 1057.20 | FTTFTTFTTTFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789500545.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500545
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 20:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 652K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-100A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717010794340
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 19:26:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:26:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:26:36] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-29 19:26:36] [INFO ] Transformed 1403 places.
[2024-05-29 19:26:36] [INFO ] Transformed 1903 transitions.
[2024-05-29 19:26:36] [INFO ] Found NUPN structural information;
[2024-05-29 19:26:36] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 16) seen :6
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1903 rows 1403 cols
[2024-05-29 19:26:38] [INFO ] Computed 401 invariants in 27 ms
[2024-05-29 19:26:39] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 19:26:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 83 ms returned sat
[2024-05-29 19:26:48] [INFO ] After 7960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 19:26:49] [INFO ] Deduced a trap composed of 8 places in 348 ms of which 10 ms to minimize.
[2024-05-29 19:26:49] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 1 ms to minimize.
[2024-05-29 19:26:50] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:26:50] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 1 ms to minimize.
[2024-05-29 19:26:51] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 2 ms to minimize.
[2024-05-29 19:26:51] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 1 ms to minimize.
[2024-05-29 19:26:51] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 1 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 0 ms to minimize.
[2024-05-29 19:26:55] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2024-05-29 19:26:55] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 2 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 0 ms to minimize.
[2024-05-29 19:26:56] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2024-05-29 19:26:57] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 0 ms to minimize.
[2024-05-29 19:26:57] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
[2024-05-29 19:26:57] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 1 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 0 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 0 ms to minimize.
[2024-05-29 19:26:59] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:26:59] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 0 ms to minimize.
[2024-05-29 19:27:00] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2024-05-29 19:27:00] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 1 ms to minimize.
[2024-05-29 19:27:00] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 1 ms to minimize.
[2024-05-29 19:27:01] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2024-05-29 19:27:02] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2024-05-29 19:27:02] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 5 ms to minimize.
[2024-05-29 19:27:02] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 0 ms to minimize.
[2024-05-29 19:27:03] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2024-05-29 19:27:03] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2024-05-29 19:27:04] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:27:04] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 0 ms to minimize.
[2024-05-29 19:27:04] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 15440 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:27:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:27:04] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1291 ms.
Support contains 313 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 141 times.
Drop transitions removed 141 transitions
Iterating global reduction 0 with 141 rules applied. Total rules applied 143 place count 1402 transition count 1902
Applied a total of 143 rules in 390 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-29 19:27:07] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 19:27:07] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 19:27:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 99 ms returned sat
[2024-05-29 19:27:13] [INFO ] After 4544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 19:27:14] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 2 ms to minimize.
[2024-05-29 19:27:19] [INFO ] Deduced a trap composed of 7 places in 400 ms of which 1 ms to minimize.
[2024-05-29 19:27:20] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 1 ms to minimize.
[2024-05-29 19:27:20] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 1 ms to minimize.
[2024-05-29 19:27:21] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 1 ms to minimize.
[2024-05-29 19:27:21] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 1 ms to minimize.
[2024-05-29 19:27:22] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:27:22] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 0 ms to minimize.
[2024-05-29 19:27:23] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
[2024-05-29 19:27:23] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:27:24] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:27:24] [INFO ] Deduced a trap composed of 8 places in 390 ms of which 1 ms to minimize.
[2024-05-29 19:27:25] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 0 ms to minimize.
[2024-05-29 19:27:25] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:27:25] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:27:26] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2024-05-29 19:27:26] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 2 ms to minimize.
[2024-05-29 19:27:27] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 0 ms to minimize.
[2024-05-29 19:27:27] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2024-05-29 19:27:28] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 0 ms to minimize.
[2024-05-29 19:27:28] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:27:29] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2024-05-29 19:27:29] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 1 ms to minimize.
[2024-05-29 19:27:29] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 1 ms to minimize.
[2024-05-29 19:27:30] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:27:30] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:27:31] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:27:31] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 0 ms to minimize.
[2024-05-29 19:27:32] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 4 ms to minimize.
[2024-05-29 19:27:32] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 0 ms to minimize.
[2024-05-29 19:27:32] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2024-05-29 19:27:33] [INFO ] Deduced a trap composed of 3 places in 985 ms of which 2 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:27:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:27:33] [INFO ] After 26002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 830 ms.
Support contains 270 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 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 1402 transition count 1902
Applied a total of 3 rules in 384 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) 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
Running SMT prover for 7 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-29 19:27:35] [INFO ] Computed 401 invariants in 8 ms
[2024-05-29 19:27:36] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 19:27:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 81 ms returned sat
[2024-05-29 19:27:42] [INFO ] After 5733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 19:27:44] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 0 ms to minimize.
[2024-05-29 19:27:44] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2024-05-29 19:27:45] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2024-05-29 19:27:45] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 1 ms to minimize.
[2024-05-29 19:27:45] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2024-05-29 19:27:46] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 0 ms to minimize.
[2024-05-29 19:27:46] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 0 ms to minimize.
[2024-05-29 19:27:46] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 1 ms to minimize.
[2024-05-29 19:27:47] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:27:48] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:27:48] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2024-05-29 19:27:49] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2024-05-29 19:27:49] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 1 ms to minimize.
[2024-05-29 19:27:49] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 0 ms to minimize.
[2024-05-29 19:27:50] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 1 ms to minimize.
[2024-05-29 19:27:50] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 0 ms to minimize.
[2024-05-29 19:27:50] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 0 ms to minimize.
[2024-05-29 19:27:51] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2024-05-29 19:27:51] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2024-05-29 19:27:52] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2024-05-29 19:27:52] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2024-05-29 19:27:52] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2024-05-29 19:27:53] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 0 ms to minimize.
[2024-05-29 19:27:53] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2024-05-29 19:27:53] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2024-05-29 19:27:54] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2024-05-29 19:27:54] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2024-05-29 19:27:54] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2024-05-29 19:27:54] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 1 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2024-05-29 19:27:58] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2024-05-29 19:27:58] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-05-29 19:27:58] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2024-05-29 19:27:58] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2024-05-29 19:28:00] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2024-05-29 19:28:00] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:28:00] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:28:00] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-05-29 19:28:01] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2024-05-29 19:28:01] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:28:01] [INFO ] Deduced a trap composed of 11 places in 113 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:28:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:28:01] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 709 ms.
Support contains 185 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 1402 transition count 1902
Applied a total of 17 rules in 108 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 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 76 ms. (steps per millisecond=131 ) 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
Interrupted probabilistic random walk after 82847 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82847 steps, saw 31316 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2024-05-29 19:28:06] [INFO ] Computed 401 invariants in 23 ms
[2024-05-29 19:28:06] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 19:28:07] [INFO ] [Nat]Absence check using 401 positive place invariants in 75 ms returned sat
[2024-05-29 19:28:12] [INFO ] After 5088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 19:28:13] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 0 ms to minimize.
[2024-05-29 19:28:13] [INFO ] Deduced a trap composed of 7 places in 386 ms of which 1 ms to minimize.
[2024-05-29 19:28:14] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 1 ms to minimize.
[2024-05-29 19:28:14] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 1 ms to minimize.
[2024-05-29 19:28:15] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:28:15] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 1 ms to minimize.
[2024-05-29 19:28:16] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 0 ms to minimize.
[2024-05-29 19:28:16] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 0 ms to minimize.
[2024-05-29 19:28:17] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 0 ms to minimize.
[2024-05-29 19:28:17] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 1 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 0 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 1 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 1 ms to minimize.
[2024-05-29 19:28:19] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:28:19] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2024-05-29 19:28:20] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 3 ms to minimize.
[2024-05-29 19:28:20] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:28:20] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 1 ms to minimize.
[2024-05-29 19:28:21] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 0 ms to minimize.
[2024-05-29 19:28:21] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 0 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2024-05-29 19:28:23] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2024-05-29 19:28:23] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 1 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 0 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 0 ms to minimize.
[2024-05-29 19:28:25] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 1 ms to minimize.
[2024-05-29 19:28:25] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 0 ms to minimize.
[2024-05-29 19:28:26] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2024-05-29 19:28:26] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2024-05-29 19:28:27] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2024-05-29 19:28:27] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2024-05-29 19:28:27] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2024-05-29 19:28:28] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 1 ms to minimize.
[2024-05-29 19:28:28] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2024-05-29 19:28:28] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 1 ms to minimize.
[2024-05-29 19:28:29] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2024-05-29 19:28:29] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 0 ms to minimize.
[2024-05-29 19:28:29] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2024-05-29 19:28:30] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2024-05-29 19:28:30] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2024-05-29 19:28:31] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 0 ms to minimize.
[2024-05-29 19:28:31] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 1 ms to minimize.
[2024-05-29 19:28:31] [INFO ] Deduced a trap composed of 11 places in 264 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:28:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:28:31] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 610 ms.
Support contains 185 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 53 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2024-05-29 19:28:32] [INFO ] Invariant cache hit.
[2024-05-29 19:28:33] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-29 19:28:33] [INFO ] Invariant cache hit.
[2024-05-29 19:28:35] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
[2024-05-29 19:28:35] [INFO ] Redundant transitions in 344 ms returned []
[2024-05-29 19:28:35] [INFO ] Invariant cache hit.
[2024-05-29 19:28:36] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4497 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 48 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 19:28:37] [INFO ] Invariant cache hit.
[2024-05-29 19:28:37] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 19:28:38] [INFO ] [Nat]Absence check using 401 positive place invariants in 81 ms returned sat
[2024-05-29 19:28:45] [INFO ] After 7240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 19:28:46] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:28:47] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:28:48] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:28:49] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:28:49] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 0 ms to minimize.
[2024-05-29 19:28:50] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:28:50] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2024-05-29 19:28:50] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2024-05-29 19:28:51] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:28:51] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:28:52] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:28:52] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 0 ms to minimize.
[2024-05-29 19:28:53] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2024-05-29 19:28:53] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 0 ms to minimize.
[2024-05-29 19:28:53] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 0 ms to minimize.
[2024-05-29 19:28:54] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:28:54] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 0 ms to minimize.
[2024-05-29 19:28:55] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:28:55] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 0 ms to minimize.
[2024-05-29 19:28:56] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:28:56] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2024-05-29 19:28:56] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2024-05-29 19:28:57] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:28:57] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 0 ms to minimize.
[2024-05-29 19:28:58] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 0 ms to minimize.
[2024-05-29 19:28:58] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 0 ms to minimize.
[2024-05-29 19:28:58] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2024-05-29 19:28:59] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2024-05-29 19:28:59] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 0 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:29:00] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 1 ms to minimize.
[2024-05-29 19:29:01] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2024-05-29 19:29:02] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 0 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 0 ms to minimize.
[2024-05-29 19:29:03] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2024-05-29 19:29:04] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 1 ms to minimize.
[2024-05-29 19:29:05] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:29:06] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:29:07] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 1 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 0 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2024-05-29 19:29:08] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2024-05-29 19:29:09] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 0 ms to minimize.
[2024-05-29 19:29:09] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 0 ms to minimize.
[2024-05-29 19:29:10] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 1 ms to minimize.
[2024-05-29 19:29:10] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 2 ms to minimize.
[2024-05-29 19:29:10] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2024-05-29 19:29:11] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 0 ms to minimize.
[2024-05-29 19:29:11] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
[2024-05-29 19:29:11] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 19:29:12] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2024-05-29 19:29:12] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2024-05-29 19:29:12] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2024-05-29 19:29:12] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 0 ms to minimize.
[2024-05-29 19:29:13] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2024-05-29 19:29:13] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 1 ms to minimize.
[2024-05-29 19:29:13] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 0 ms to minimize.
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2024-05-29 19:29:14] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 1 ms to minimize.
[2024-05-29 19:29:15] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2024-05-29 19:29:15] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2024-05-29 19:29:15] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:29:15] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2024-05-29 19:29:16] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2024-05-29 19:29:16] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2024-05-29 19:29:16] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
[2024-05-29 19:29:17] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2024-05-29 19:29:17] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2024-05-29 19:29:17] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2024-05-29 19:29:18] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2024-05-29 19:29:18] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 0 ms to minimize.
[2024-05-29 19:29:18] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2024-05-29 19:29:18] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2024-05-29 19:29:19] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2024-05-29 19:29:19] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2024-05-29 19:29:19] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2024-05-29 19:29:20] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2024-05-29 19:29:20] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2024-05-29 19:29:20] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 0 ms to minimize.
[2024-05-29 19:29:20] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2024-05-29 19:29:21] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2024-05-29 19:29:21] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 0 ms to minimize.
[2024-05-29 19:29:21] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 0 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 0 ms to minimize.
[2024-05-29 19:29:22] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2024-05-29 19:29:23] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 1 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 0 ms to minimize.
[2024-05-29 19:29:24] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 0 ms to minimize.
[2024-05-29 19:29:25] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2024-05-29 19:29:25] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2024-05-29 19:29:25] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 0 ms to minimize.
[2024-05-29 19:29:26] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2024-05-29 19:29:26] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 1 ms to minimize.
[2024-05-29 19:29:26] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2024-05-29 19:29:26] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 0 ms to minimize.
[2024-05-29 19:29:27] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 0 ms to minimize.
[2024-05-29 19:29:27] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2024-05-29 19:29:27] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 1 ms to minimize.
[2024-05-29 19:29:28] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 0 ms to minimize.
[2024-05-29 19:29:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 41837 ms
[2024-05-29 19:29:28] [INFO ] Trap strengthening (SAT) tested/added 119/118 trap constraints in 41837 ms
[2024-05-29 19:29:28] [INFO ] Deduced a trap composed of 8 places in 374 ms of which 1 ms to minimize.
[2024-05-29 19:29:29] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 0 ms to minimize.
[2024-05-29 19:29:29] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 1 ms to minimize.
[2024-05-29 19:29:30] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 1 ms to minimize.
[2024-05-29 19:29:30] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 0 ms to minimize.
[2024-05-29 19:29:31] [INFO ] Deduced a trap composed of 8 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:29:31] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 2 ms to minimize.
[2024-05-29 19:29:32] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 1 ms to minimize.
[2024-05-29 19:29:32] [INFO ] Deduced a trap composed of 15 places in 369 ms of which 0 ms to minimize.
[2024-05-29 19:29:33] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2024-05-29 19:29:33] [INFO ] Deduced a trap composed of 16 places in 382 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 0 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2024-05-29 19:29:34] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2024-05-29 19:29:35] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2024-05-29 19:29:36] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 1 ms to minimize.
[2024-05-29 19:29:36] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:29:37] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:29:37] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:29:38] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 0 ms to minimize.
[2024-05-29 19:29:38] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 0 ms to minimize.
[2024-05-29 19:29:38] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 0 ms to minimize.
[2024-05-29 19:29:39] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 0 ms to minimize.
[2024-05-29 19:29:39] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 0 ms to minimize.
[2024-05-29 19:29:40] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:29:40] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 1 ms to minimize.
[2024-05-29 19:29:41] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 0 ms to minimize.
[2024-05-29 19:29:41] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2024-05-29 19:29:42] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 0 ms to minimize.
[2024-05-29 19:29:42] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 1 ms to minimize.
[2024-05-29 19:29:42] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 1 ms to minimize.
[2024-05-29 19:29:43] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:29:43] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2024-05-29 19:29:44] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 1 ms to minimize.
[2024-05-29 19:29:44] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:29:45] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:29:45] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 1 ms to minimize.
[2024-05-29 19:29:45] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:29:46] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:29:46] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 0 ms to minimize.
[2024-05-29 19:29:47] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2024-05-29 19:29:47] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:29:48] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:29:48] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 0 ms to minimize.
[2024-05-29 19:29:48] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 1 ms to minimize.
[2024-05-29 19:29:49] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 1 ms to minimize.
[2024-05-29 19:29:49] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 0 ms to minimize.
[2024-05-29 19:29:50] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 0 ms to minimize.
[2024-05-29 19:29:50] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:29:51] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2024-05-29 19:29:51] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 0 ms to minimize.
[2024-05-29 19:29:51] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:29:52] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2024-05-29 19:29:52] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:29:53] [INFO ] Deduced a trap composed of 23 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:29:53] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 0 ms to minimize.
[2024-05-29 19:29:54] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:29:54] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:29:55] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 0 ms to minimize.
[2024-05-29 19:29:55] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 0 ms to minimize.
[2024-05-29 19:29:55] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:29:56] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 0 ms to minimize.
[2024-05-29 19:29:56] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 0 ms to minimize.
[2024-05-29 19:29:57] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:29:57] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 1 ms to minimize.
[2024-05-29 19:29:57] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 28 places in 334 ms of which 1 ms to minimize.
[2024-05-29 19:29:58] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:29:59] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 1 ms to minimize.
[2024-05-29 19:29:59] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 0 ms to minimize.
[2024-05-29 19:30:00] [INFO ] Deduced a trap composed of 28 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:30:00] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 0 ms to minimize.
[2024-05-29 19:30:00] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 1 ms to minimize.
[2024-05-29 19:30:01] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:30:01] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 1 ms to minimize.
[2024-05-29 19:30:02] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 1 ms to minimize.
[2024-05-29 19:30:02] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 0 ms to minimize.
[2024-05-29 19:30:02] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 1 ms to minimize.
[2024-05-29 19:30:03] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 0 ms to minimize.
[2024-05-29 19:30:03] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 0 ms to minimize.
[2024-05-29 19:30:04] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 0 ms to minimize.
[2024-05-29 19:30:04] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 0 ms to minimize.
[2024-05-29 19:30:04] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:30:05] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 0 ms to minimize.
[2024-05-29 19:30:05] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 0 ms to minimize.
[2024-05-29 19:30:06] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 1 ms to minimize.
[2024-05-29 19:30:06] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:30:07] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:30:07] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:30:07] [INFO ] Deduced a trap composed of 28 places in 328 ms of which 0 ms to minimize.
[2024-05-29 19:30:08] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:30:08] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 0 ms to minimize.
[2024-05-29 19:30:09] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:30:09] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:30:10] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:10] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 0 ms to minimize.
[2024-05-29 19:30:10] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 0 ms to minimize.
[2024-05-29 19:30:11] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2024-05-29 19:30:11] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 1 ms to minimize.
[2024-05-29 19:30:12] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 0 ms to minimize.
[2024-05-29 19:30:12] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 0 ms to minimize.
[2024-05-29 19:30:12] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 0 ms to minimize.
[2024-05-29 19:30:13] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2024-05-29 19:30:13] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 1 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 1 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 0 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 5 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:30:17] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:30:17] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 0 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 0 ms to minimize.
[2024-05-29 19:30:18] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 0 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:30:19] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 1 ms to minimize.
[2024-05-29 19:30:20] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2024-05-29 19:30:20] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 0 ms to minimize.
[2024-05-29 19:30:21] [INFO ] Deduced a trap composed of 40 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:21] [INFO ] Deduced a trap composed of 40 places in 334 ms of which 1 ms to minimize.
[2024-05-29 19:30:21] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:22] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:30:22] [INFO ] Deduced a trap composed of 39 places in 353 ms of which 1 ms to minimize.
[2024-05-29 19:30:23] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 1 ms to minimize.
[2024-05-29 19:30:23] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:30:24] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:30:24] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 0 ms to minimize.
[2024-05-29 19:30:24] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:30:25] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 0 ms to minimize.
[2024-05-29 19:30:25] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2024-05-29 19:30:26] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2024-05-29 19:30:26] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 0 ms to minimize.
[2024-05-29 19:30:27] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 0 ms to minimize.
[2024-05-29 19:30:27] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 0 ms to minimize.
[2024-05-29 19:30:27] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:30:28] [INFO ] Deduced a trap composed of 40 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:30:28] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 0 ms to minimize.
[2024-05-29 19:30:29] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 1 ms to minimize.
[2024-05-29 19:30:30] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 0 ms to minimize.
[2024-05-29 19:30:31] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 0 ms to minimize.
[2024-05-29 19:30:31] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 1 ms to minimize.
[2024-05-29 19:30:32] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:30:32] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:30:32] [INFO ] Deduced a trap composed of 36 places in 320 ms of which 1 ms to minimize.
[2024-05-29 19:30:33] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:30:33] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:30:34] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:30:34] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:30:35] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 1 ms to minimize.
[2024-05-29 19:30:35] [INFO ] Deduced a trap composed of 40 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:35] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 1 ms to minimize.
[2024-05-29 19:30:36] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 1 ms to minimize.
[2024-05-29 19:30:36] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 0 ms to minimize.
[2024-05-29 19:30:37] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2024-05-29 19:30:37] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:30:38] [INFO ] Deduced a trap composed of 35 places in 321 ms of which 1 ms to minimize.
[2024-05-29 19:30:38] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 0 ms to minimize.
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 28 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:30:40] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:30:40] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 0 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 0 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 0 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 0 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 32 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 0 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:30:45] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 1 ms to minimize.
[2024-05-29 19:30:45] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 1 ms to minimize.
[2024-05-29 19:30:46] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2024-05-29 19:30:46] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 1 ms to minimize.
[2024-05-29 19:30:47] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:30:47] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 0 ms to minimize.
[2024-05-29 19:30:48] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 1 ms to minimize.
[2024-05-29 19:30:48] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2024-05-29 19:30:49] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:30:49] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2024-05-29 19:30:50] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 0 ms to minimize.
[2024-05-29 19:30:50] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:30:51] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 0 ms to minimize.
[2024-05-29 19:30:51] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 1 ms to minimize.
[2024-05-29 19:30:52] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 0 ms to minimize.
[2024-05-29 19:30:53] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:30:54] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:30:54] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:30:55] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2024-05-29 19:30:58] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2024-05-29 19:31:00] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 0 ms to minimize.
[2024-05-29 19:31:00] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2024-05-29 19:31:00] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:31:01] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 0 ms to minimize.
[2024-05-29 19:31:01] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 0 ms to minimize.
[2024-05-29 19:31:02] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:31:02] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 1 ms to minimize.
[2024-05-29 19:31:03] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:31:03] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 1 ms to minimize.
[2024-05-29 19:31:04] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 0 ms to minimize.
[2024-05-29 19:31:04] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:31:04] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 0 ms to minimize.
[2024-05-29 19:31:05] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:31:05] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 1 ms to minimize.
[2024-05-29 19:31:06] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:31:06] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 0 ms to minimize.
[2024-05-29 19:31:06] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 1 ms to minimize.
[2024-05-29 19:31:07] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:31:07] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 1 ms to minimize.
[2024-05-29 19:31:08] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 6 ms to minimize.
[2024-05-29 19:31:08] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 1 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 0 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 0 ms to minimize.
[2024-05-29 19:31:10] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2024-05-29 19:31:10] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:31:12] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 0 ms to minimize.
[2024-05-29 19:31:12] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:12] [INFO ] Deduced a trap composed of 20 places in 328 ms of which 0 ms to minimize.
[2024-05-29 19:31:13] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 0 ms to minimize.
[2024-05-29 19:31:13] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 0 ms to minimize.
[2024-05-29 19:31:14] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:31:14] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:14] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:31:15] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:31:15] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 0 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 0 ms to minimize.
[2024-05-29 19:31:16] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 0 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:31:17] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 0 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 1 ms to minimize.
[2024-05-29 19:31:18] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:31:19] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 0 ms to minimize.
[2024-05-29 19:31:19] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2024-05-29 19:31:19] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 1 ms to minimize.
[2024-05-29 19:31:20] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 0 ms to minimize.
[2024-05-29 19:31:21] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 0 ms to minimize.
[2024-05-29 19:31:22] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 0 ms to minimize.
[2024-05-29 19:31:23] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 1 ms to minimize.
[2024-05-29 19:31:23] [INFO ] Deduced a trap composed of 16 places in 398 ms of which 0 ms to minimize.
[2024-05-29 19:31:24] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2024-05-29 19:31:24] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2024-05-29 19:31:25] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 1 ms to minimize.
[2024-05-29 19:31:25] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2024-05-29 19:31:25] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 0 ms to minimize.
[2024-05-29 19:31:26] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 1 ms to minimize.
[2024-05-29 19:31:26] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 0 ms to minimize.
[2024-05-29 19:31:27] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2024-05-29 19:31:27] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 0 ms to minimize.
[2024-05-29 19:31:28] [INFO ] Deduced a trap composed of 7 places in 361 ms of which 0 ms to minimize.
[2024-05-29 19:31:28] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 0 ms to minimize.
[2024-05-29 19:31:29] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 1 ms to minimize.
[2024-05-29 19:31:29] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 1 ms to minimize.
[2024-05-29 19:31:30] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 1 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 0 ms to minimize.
[2024-05-29 19:31:31] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 1 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 0 ms to minimize.
[2024-05-29 19:31:32] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 0 ms to minimize.
[2024-05-29 19:31:33] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 0 ms to minimize.
[2024-05-29 19:31:33] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 1 ms to minimize.
[2024-05-29 19:31:34] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:31:34] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 1 ms to minimize.
[2024-05-29 19:31:35] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 0 ms to minimize.
[2024-05-29 19:31:35] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:31:36] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2024-05-29 19:31:36] [INFO ] Deduced a trap composed of 19 places in 360 ms of which 1 ms to minimize.
[2024-05-29 19:31:36] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:31:37] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 0 ms to minimize.
[2024-05-29 19:31:37] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 1 ms to minimize.
[2024-05-29 19:31:38] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 1 ms to minimize.
[2024-05-29 19:31:38] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 0 ms to minimize.
[2024-05-29 19:31:39] [INFO ] Deduced a trap composed of 27 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:31:39] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 0 ms to minimize.
[2024-05-29 19:31:39] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2024-05-29 19:31:40] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:31:40] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 0 ms to minimize.
[2024-05-29 19:31:41] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:31:41] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 0 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 1 ms to minimize.
[2024-05-29 19:31:42] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 0 ms to minimize.
[2024-05-29 19:31:43] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2024-05-29 19:31:44] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 0 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2024-05-29 19:31:45] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 0 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 5 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 0 ms to minimize.
[2024-05-29 19:31:46] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 1 ms to minimize.
[2024-05-29 19:31:47] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:31:47] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 1 ms to minimize.
[2024-05-29 19:31:48] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 0 ms to minimize.
[2024-05-29 19:31:48] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:49] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:31:49] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2024-05-29 19:31:49] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 1 ms to minimize.
[2024-05-29 19:31:50] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:31:50] [INFO ] Deduced a trap composed of 27 places in 346 ms of which 1 ms to minimize.
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 1 ms to minimize.
[2024-05-29 19:31:52] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:31:52] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:52] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 1 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 0 ms to minimize.
[2024-05-29 19:31:54] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 1 ms to minimize.
[2024-05-29 19:31:54] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 1 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 1 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 1 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 0 ms to minimize.
[2024-05-29 19:31:56] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 0 ms to minimize.
[2024-05-29 19:31:56] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 0 ms to minimize.
[2024-05-29 19:31:57] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 1 ms to minimize.
[2024-05-29 19:31:57] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2024-05-29 19:31:57] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 0 ms to minimize.
[2024-05-29 19:31:58] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 0 ms to minimize.
[2024-05-29 19:31:58] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 1 ms to minimize.
[2024-05-29 19:31:59] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:31:59] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2024-05-29 19:32:00] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 0 ms to minimize.
[2024-05-29 19:32:00] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 0 ms to minimize.
[2024-05-29 19:32:00] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2024-05-29 19:32:01] [INFO ] Deduced a trap composed of 27 places in 344 ms of which 1 ms to minimize.
[2024-05-29 19:32:01] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 2 ms to minimize.
[2024-05-29 19:32:02] [INFO ] Deduced a trap composed of 27 places in 348 ms of which 1 ms to minimize.
[2024-05-29 19:32:02] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 1 ms to minimize.
[2024-05-29 19:32:03] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 1 ms to minimize.
[2024-05-29 19:32:03] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 0 ms to minimize.
[2024-05-29 19:32:04] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 0 ms to minimize.
[2024-05-29 19:32:05] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 3 ms to minimize.
[2024-05-29 19:32:05] [INFO ] Deduced a trap composed of 12 places in 389 ms of which 1 ms to minimize.
[2024-05-29 19:32:05] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2024-05-29 19:32:07] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2024-05-29 19:32:07] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2024-05-29 19:32:08] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 0 ms to minimize.
[2024-05-29 19:32:08] [INFO ] Deduced a trap composed of 8 places in 385 ms of which 1 ms to minimize.
[2024-05-29 19:32:09] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2024-05-29 19:32:09] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 0 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2024-05-29 19:32:10] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2024-05-29 19:32:11] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 1 ms to minimize.
[2024-05-29 19:32:11] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 1 ms to minimize.
[2024-05-29 19:32:11] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 1 ms to minimize.
[2024-05-29 19:32:12] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:32:12] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 0 ms to minimize.
[2024-05-29 19:32:13] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 1 ms to minimize.
[2024-05-29 19:32:13] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 1 ms to minimize.
[2024-05-29 19:32:14] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 0 ms to minimize.
[2024-05-29 19:32:14] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 1 ms to minimize.
[2024-05-29 19:32:14] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 1 ms to minimize.
[2024-05-29 19:32:15] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 1 ms to minimize.
[2024-05-29 19:32:15] [INFO ] Deduced a trap composed of 19 places in 345 ms of which 0 ms to minimize.
[2024-05-29 19:32:16] [INFO ] Deduced a trap composed of 11 places in 366 ms of which 1 ms to minimize.
[2024-05-29 19:32:16] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 1 ms to minimize.
[2024-05-29 19:32:17] [INFO ] Deduced a trap composed of 15 places in 357 ms of which 1 ms to minimize.
[2024-05-29 19:32:17] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2024-05-29 19:32:18] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 0 ms to minimize.
[2024-05-29 19:32:18] [INFO ] Deduced a trap composed of 16 places in 347 ms of which 0 ms to minimize.
[2024-05-29 19:32:18] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 0 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2024-05-29 19:32:20] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2024-05-29 19:32:20] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 0 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 1 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 1 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 1 ms to minimize.
[2024-05-29 19:32:22] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2024-05-29 19:32:22] [INFO ] Deduced a trap composed of 23 places in 324 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 19:32:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 19:32:22] [INFO ] After 225321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
[2024-05-29 19:32:22] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 19:32:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9520 arcs took 11 ms.
[2024-05-29 19:32:23] [INFO ] Flatten gal took : 261 ms
Total runtime 346904 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-100A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1717011151048
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 25 (type EXCL) for 6 ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 6 ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 6 ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 6 ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 24 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: result : true
lola: markings : 207
lola: fired transitions : 206
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldRVs-PT-100A-ReachabilityFireability-2024-08 (obsolete)
lola: LAUNCH task # 31 (type EXCL) for 3 ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 3 ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 3 ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 3 ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-08
lola: result : true
lola: fired transitions : 205
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/369/ReachabilityFireability-22.sara.
lola: FINISHED task # 30 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 161
lola: fired transitions : 160
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 27 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 28 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ShieldRVs-PT-100A-ReachabilityFireability-2024-04 (obsolete)
sara: try reading problem file /home/mcc/execution/369/ReachabilityFireability-28.sara.
lola: FINISHED task # 27 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-04
lola: result : true
lola: fired transitions : 159
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 38 (type EXCL) for 0 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 0 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 0 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 37 (type SRCH) for 0 ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 37 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: result : true
lola: markings : 197
lola: fired transitions : 196
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 35 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 38 (type EXCL) for ShieldRVs-PT-100A-ReachabilityFireability-2024-00 (obsolete)
lola: FINISHED task # 34 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-00
lola: result : true
lola: fired transitions : 195
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 50 (type EXCL) for 9 ShieldRVs-PT-100A-ReachabilityFireability-2024-09
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 40 (type FNDP) for 15 ShieldRVs-PT-100A-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 15 ShieldRVs-PT-100A-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 15 ShieldRVs-PT-100A-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 40 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 167
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 41 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 44 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 53 (type FNDP) for 12 ShieldRVs-PT-100A-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 12 ShieldRVs-PT-100A-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type SRCH) for 12 ShieldRVs-PT-100A-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 53 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-10
lola: result : true
lola: fired transitions : 193
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 54 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 56 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-10 (obsolete)
lola: LAUNCH task # 59 (type FNDP) for 18 ShieldRVs-PT-100A-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 60 (type EQUN) for 18 ShieldRVs-PT-100A-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type SRCH) for 18 ShieldRVs-PT-100A-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/369/ReachabilityFireability-41.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 59 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 148
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 60 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 62 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 43 (type FNDP) for 9 ShieldRVs-PT-100A-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type EQUN) for 9 ShieldRVs-PT-100A-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type SRCH) for 9 ShieldRVs-PT-100A-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 49 (type SRCH) for ShieldRVs-PT-100A-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 85
lola: fired transitions : 84
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 43 (type FNDP) for ShieldRVs-PT-100A-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 46 (type EQUN) for ShieldRVs-PT-100A-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 50 (type EXCL) for ShieldRVs-PT-100A-ReachabilityFireability-2024-09 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-100A-ReachabilityFireability-2024-00: AG false tandem / insertion
ShieldRVs-PT-100A-ReachabilityFireability-2024-04: EF true tandem / insertion
ShieldRVs-PT-100A-ReachabilityFireability-2024-08: EF true tandem / insertion
ShieldRVs-PT-100A-ReachabilityFireability-2024-09: EF true tandem / insertion
ShieldRVs-PT-100A-ReachabilityFireability-2024-10: AG false findpath
ShieldRVs-PT-100A-ReachabilityFireability-2024-14: EF true findpath
ShieldRVs-PT-100A-ReachabilityFireability-2024-15: EF true findpath
Time elapsed: 7 secs. Pages in use: 3
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-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVs-PT-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789500545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;