Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800167.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r425-tajo-167905977800167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Feb 26 19:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 19:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 19:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 19:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 652K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679302740354

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:59:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:59:02] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-20 08:59:02] [INFO ] Transformed 1403 places.
[2023-03-20 08:59:02] [INFO ] Transformed 1903 transitions.
[2023-03-20 08:59:02] [INFO ] Found NUPN structural information;
[2023-03-20 08:59:02] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 7) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) 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 6) seen :2
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-20 08:59:03] [INFO ] Computed 401 place invariants in 27 ms
[2023-03-20 08:59:04] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:59:04] [INFO ] [Nat]Absence check using 401 positive place invariants in 76 ms returned sat
[2023-03-20 08:59:08] [INFO ] After 4012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 6 ms to minimize.
[2023-03-20 08:59:10] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2023-03-20 08:59:11] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2023-03-20 08:59:11] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 1 ms to minimize.
[2023-03-20 08:59:12] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2023-03-20 08:59:12] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-20 08:59:12] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 1 ms to minimize.
[2023-03-20 08:59:13] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-20 08:59:13] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2023-03-20 08:59:14] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 0 ms to minimize.
[2023-03-20 08:59:14] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-20 08:59:14] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 2 ms to minimize.
[2023-03-20 08:59:15] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-20 08:59:15] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-20 08:59:16] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
[2023-03-20 08:59:16] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 0 ms to minimize.
[2023-03-20 08:59:16] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-20 08:59:17] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 1 ms to minimize.
[2023-03-20 08:59:17] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-20 08:59:17] [INFO ] Deduced a trap composed of 8 places in 324 ms of which 1 ms to minimize.
[2023-03-20 08:59:18] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2023-03-20 08:59:18] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 0 ms to minimize.
[2023-03-20 08:59:19] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 1 ms to minimize.
[2023-03-20 08:59:19] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 0 ms to minimize.
[2023-03-20 08:59:20] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2023-03-20 08:59:20] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2023-03-20 08:59:20] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-20 08:59:21] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 0 ms to minimize.
[2023-03-20 08:59:21] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-20 08:59:21] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 1 ms to minimize.
[2023-03-20 08:59:22] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2023-03-20 08:59:22] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-20 08:59:22] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2023-03-20 08:59:23] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 1 ms to minimize.
[2023-03-20 08:59:23] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2023-03-20 08:59:24] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 0 ms to minimize.
[2023-03-20 08:59:24] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 0 ms to minimize.
[2023-03-20 08:59:25] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 0 ms to minimize.
[2023-03-20 08:59:25] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-20 08:59:25] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2023-03-20 08:59:26] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-20 08:59:26] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 2 ms to minimize.
[2023-03-20 08:59:27] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-20 08:59:27] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 0 ms to minimize.
[2023-03-20 08:59:27] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-20 08:59:27] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2023-03-20 08:59:28] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-20 08:59:28] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-20 08:59:28] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 0 ms to minimize.
[2023-03-20 08:59:29] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-20 08:59:29] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:59:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:59:29] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 475 ms.
Support contains 86 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 6 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 184 times.
Drop transitions removed 184 transitions
Iterating global reduction 0 with 184 rules applied. Total rules applied 186 place count 1402 transition count 1902
Applied a total of 186 rules in 654 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 656 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 08:59:31] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 08:59:31] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 08:59:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 76 ms returned sat
[2023-03-20 08:59:35] [INFO ] After 3575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 08:59:36] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 0 ms to minimize.
[2023-03-20 08:59:37] [INFO ] Deduced a trap composed of 7 places in 421 ms of which 1 ms to minimize.
[2023-03-20 08:59:37] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 1 ms to minimize.
[2023-03-20 08:59:38] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-20 08:59:38] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 5 ms to minimize.
[2023-03-20 08:59:38] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2023-03-20 08:59:39] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2023-03-20 08:59:39] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 0 ms to minimize.
[2023-03-20 08:59:40] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 0 ms to minimize.
[2023-03-20 08:59:40] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-20 08:59:40] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 1 ms to minimize.
[2023-03-20 08:59:41] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 1 ms to minimize.
[2023-03-20 08:59:41] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-20 08:59:42] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 2 ms to minimize.
[2023-03-20 08:59:42] [INFO ] Deduced a trap composed of 7 places in 361 ms of which 1 ms to minimize.
[2023-03-20 08:59:43] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 2 ms to minimize.
[2023-03-20 08:59:43] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 1 ms to minimize.
[2023-03-20 08:59:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7258 ms
[2023-03-20 08:59:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7260 ms
[2023-03-20 08:59:44] [INFO ] Deduced a trap composed of 7 places in 429 ms of which 1 ms to minimize.
[2023-03-20 08:59:44] [INFO ] Deduced a trap composed of 11 places in 392 ms of which 1 ms to minimize.
[2023-03-20 08:59:45] [INFO ] Deduced a trap composed of 7 places in 422 ms of which 1 ms to minimize.
[2023-03-20 08:59:45] [INFO ] Deduced a trap composed of 7 places in 426 ms of which 1 ms to minimize.
[2023-03-20 08:59:46] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 1 ms to minimize.
[2023-03-20 08:59:46] [INFO ] Deduced a trap composed of 16 places in 439 ms of which 1 ms to minimize.
[2023-03-20 08:59:47] [INFO ] Deduced a trap composed of 8 places in 459 ms of which 0 ms to minimize.
[2023-03-20 08:59:47] [INFO ] Deduced a trap composed of 12 places in 465 ms of which 1 ms to minimize.
[2023-03-20 08:59:48] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-20 08:59:48] [INFO ] Deduced a trap composed of 7 places in 437 ms of which 1 ms to minimize.
[2023-03-20 08:59:49] [INFO ] Deduced a trap composed of 7 places in 479 ms of which 1 ms to minimize.
[2023-03-20 08:59:50] [INFO ] Deduced a trap composed of 7 places in 463 ms of which 1 ms to minimize.
[2023-03-20 08:59:50] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2023-03-20 08:59:51] [INFO ] Deduced a trap composed of 7 places in 506 ms of which 1 ms to minimize.
[2023-03-20 08:59:52] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 1 ms to minimize.
[2023-03-20 08:59:52] [INFO ] Deduced a trap composed of 7 places in 441 ms of which 1 ms to minimize.
[2023-03-20 08:59:52] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 1 ms to minimize.
[2023-03-20 08:59:53] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 1 ms to minimize.
[2023-03-20 08:59:53] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 0 ms to minimize.
[2023-03-20 08:59:54] [INFO ] Deduced a trap composed of 7 places in 482 ms of which 1 ms to minimize.
[2023-03-20 08:59:55] [INFO ] Deduced a trap composed of 7 places in 481 ms of which 1 ms to minimize.
[2023-03-20 08:59:55] [INFO ] Deduced a trap composed of 7 places in 510 ms of which 1 ms to minimize.
[2023-03-20 08:59:56] [INFO ] Deduced a trap composed of 7 places in 443 ms of which 1 ms to minimize.
[2023-03-20 08:59:56] [INFO ] Deduced a trap composed of 10 places in 468 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:59:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:59:56] [INFO ] After 25146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 368 ms.
Support contains 83 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 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1402 transition count 1902
Applied a total of 1 rules in 127 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 128 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 88427 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88427 steps, saw 37480 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 09:00:00] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 09:00:00] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:00:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 63 ms returned sat
[2023-03-20 09:00:02] [INFO ] After 1678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:00:03] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 0 ms to minimize.
[2023-03-20 09:00:04] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-20 09:00:04] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 1 ms to minimize.
[2023-03-20 09:00:05] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-20 09:00:05] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 1 ms to minimize.
[2023-03-20 09:00:05] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-20 09:00:06] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 0 ms to minimize.
[2023-03-20 09:00:06] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-20 09:00:07] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 0 ms to minimize.
[2023-03-20 09:00:07] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-20 09:00:07] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 0 ms to minimize.
[2023-03-20 09:00:08] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 0 ms to minimize.
[2023-03-20 09:00:08] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 1 ms to minimize.
[2023-03-20 09:00:09] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-20 09:00:09] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-20 09:00:09] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2023-03-20 09:00:10] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-20 09:00:10] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 1 ms to minimize.
[2023-03-20 09:00:11] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 1 ms to minimize.
[2023-03-20 09:00:11] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-20 09:00:11] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-20 09:00:12] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2023-03-20 09:00:12] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-20 09:00:13] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 1 ms to minimize.
[2023-03-20 09:00:13] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2023-03-20 09:00:14] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2023-03-20 09:00:14] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 1 ms to minimize.
[2023-03-20 09:00:14] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2023-03-20 09:00:15] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 1 ms to minimize.
[2023-03-20 09:00:15] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-20 09:00:16] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 2 ms to minimize.
[2023-03-20 09:00:16] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-20 09:00:16] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
[2023-03-20 09:00:17] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-20 09:00:17] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-20 09:00:17] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-20 09:00:18] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2023-03-20 09:00:18] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-20 09:00:18] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 0 ms to minimize.
[2023-03-20 09:00:19] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 0 ms to minimize.
[2023-03-20 09:00:19] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 1 ms to minimize.
[2023-03-20 09:00:19] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-20 09:00:20] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-20 09:00:20] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2023-03-20 09:00:21] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2023-03-20 09:00:21] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-20 09:00:21] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 0 ms to minimize.
[2023-03-20 09:00:21] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-20 09:00:22] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2023-03-20 09:00:22] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-20 09:00:22] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-20 09:00:23] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 0 ms to minimize.
[2023-03-20 09:00:23] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-20 09:00:23] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2023-03-20 09:00:24] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-20 09:00:24] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-20 09:00:24] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2023-03-20 09:00:25] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2023-03-20 09:00:25] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2023-03-20 09:00:25] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:00:26] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 09:00:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:00:26] [INFO ] After 25355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 345 ms.
Support contains 83 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 71 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 72 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 65 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-20 09:00:26] [INFO ] Invariant cache hit.
[2023-03-20 09:00:27] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-20 09:00:27] [INFO ] Invariant cache hit.
[2023-03-20 09:00:29] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2023-03-20 09:00:30] [INFO ] Redundant transitions in 436 ms returned []
[2023-03-20 09:00:30] [INFO ] Invariant cache hit.
[2023-03-20 09:00:30] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4236 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 54 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 09:00:31] [INFO ] Invariant cache hit.
[2023-03-20 09:00:31] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:00:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 58 ms returned sat
[2023-03-20 09:00:36] [INFO ] After 5326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:00:37] [INFO ] Deduced a trap composed of 7 places in 444 ms of which 1 ms to minimize.
[2023-03-20 09:00:38] [INFO ] Deduced a trap composed of 9 places in 418 ms of which 1 ms to minimize.
[2023-03-20 09:00:38] [INFO ] Deduced a trap composed of 7 places in 411 ms of which 1 ms to minimize.
[2023-03-20 09:00:39] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 1 ms to minimize.
[2023-03-20 09:00:39] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 1 ms to minimize.
[2023-03-20 09:00:40] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-20 09:00:40] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 1 ms to minimize.
[2023-03-20 09:00:40] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2023-03-20 09:00:41] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-20 09:00:42] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 0 ms to minimize.
[2023-03-20 09:00:42] [INFO ] Deduced a trap composed of 7 places in 382 ms of which 1 ms to minimize.
[2023-03-20 09:00:42] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2023-03-20 09:00:43] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 0 ms to minimize.
[2023-03-20 09:00:43] [INFO ] Deduced a trap composed of 7 places in 426 ms of which 1 ms to minimize.
[2023-03-20 09:00:44] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 1 ms to minimize.
[2023-03-20 09:00:44] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-20 09:00:45] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 0 ms to minimize.
[2023-03-20 09:00:45] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2023-03-20 09:00:46] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 1 ms to minimize.
[2023-03-20 09:00:46] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 1 ms to minimize.
[2023-03-20 09:00:47] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 0 ms to minimize.
[2023-03-20 09:00:47] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 1 ms to minimize.
[2023-03-20 09:00:48] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 1 ms to minimize.
[2023-03-20 09:00:48] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-20 09:00:49] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 1 ms to minimize.
[2023-03-20 09:00:49] [INFO ] Deduced a trap composed of 7 places in 386 ms of which 1 ms to minimize.
[2023-03-20 09:00:50] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 1 ms to minimize.
[2023-03-20 09:00:50] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 2 ms to minimize.
[2023-03-20 09:00:51] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 0 ms to minimize.
[2023-03-20 09:00:51] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2023-03-20 09:00:51] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2023-03-20 09:00:52] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 1 ms to minimize.
[2023-03-20 09:00:52] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-20 09:00:53] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 0 ms to minimize.
[2023-03-20 09:00:53] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 1 ms to minimize.
[2023-03-20 09:00:53] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 1 ms to minimize.
[2023-03-20 09:00:54] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-20 09:00:54] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 0 ms to minimize.
[2023-03-20 09:00:55] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-20 09:00:55] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2023-03-20 09:00:55] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 0 ms to minimize.
[2023-03-20 09:00:56] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-20 09:00:56] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2023-03-20 09:00:56] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 0 ms to minimize.
[2023-03-20 09:00:57] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-20 09:00:57] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 0 ms to minimize.
[2023-03-20 09:00:57] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-20 09:00:58] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 1 ms to minimize.
[2023-03-20 09:00:58] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2023-03-20 09:00:59] [INFO ] Deduced a trap composed of 7 places in 417 ms of which 1 ms to minimize.
[2023-03-20 09:00:59] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 1 ms to minimize.
[2023-03-20 09:01:00] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 1 ms to minimize.
[2023-03-20 09:01:00] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 1 ms to minimize.
[2023-03-20 09:01:01] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 1 ms to minimize.
[2023-03-20 09:01:01] [INFO ] Deduced a trap composed of 7 places in 396 ms of which 1 ms to minimize.
[2023-03-20 09:01:02] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-20 09:01:02] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2023-03-20 09:01:03] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2023-03-20 09:01:03] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2023-03-20 09:01:03] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 1 ms to minimize.
[2023-03-20 09:01:04] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2023-03-20 09:01:04] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-20 09:01:05] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-20 09:01:05] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-20 09:01:06] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2023-03-20 09:01:06] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-20 09:01:06] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 1 ms to minimize.
[2023-03-20 09:01:07] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 1 ms to minimize.
[2023-03-20 09:01:07] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-20 09:01:08] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 1 ms to minimize.
[2023-03-20 09:01:08] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 1 ms to minimize.
[2023-03-20 09:01:09] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-20 09:01:09] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 0 ms to minimize.
[2023-03-20 09:01:10] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-20 09:01:10] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 0 ms to minimize.
[2023-03-20 09:01:11] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
[2023-03-20 09:01:11] [INFO ] Deduced a trap composed of 7 places in 383 ms of which 1 ms to minimize.
[2023-03-20 09:01:11] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2023-03-20 09:01:12] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 2 ms to minimize.
[2023-03-20 09:01:12] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 0 ms to minimize.
[2023-03-20 09:01:13] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-20 09:01:13] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-20 09:01:13] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 0 ms to minimize.
[2023-03-20 09:01:14] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 0 ms to minimize.
[2023-03-20 09:01:14] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 1 ms to minimize.
[2023-03-20 09:01:15] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-20 09:01:15] [INFO ] Deduced a trap composed of 7 places in 383 ms of which 0 ms to minimize.
[2023-03-20 09:01:15] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 1 ms to minimize.
[2023-03-20 09:01:16] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 1 ms to minimize.
[2023-03-20 09:01:16] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2023-03-20 09:01:17] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-20 09:01:17] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 14 ms to minimize.
[2023-03-20 09:01:17] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-20 09:01:18] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-20 09:01:18] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 0 ms to minimize.
[2023-03-20 09:01:18] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 3 ms to minimize.
[2023-03-20 09:01:19] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 0 ms to minimize.
[2023-03-20 09:01:19] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-20 09:01:19] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 0 ms to minimize.
[2023-03-20 09:01:20] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-20 09:01:20] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 14 ms to minimize.
[2023-03-20 09:01:21] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:01:21] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 4 ms to minimize.
[2023-03-20 09:01:21] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2023-03-20 09:01:22] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-03-20 09:01:22] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 0 ms to minimize.
[2023-03-20 09:01:22] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 0 ms to minimize.
[2023-03-20 09:01:23] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-20 09:01:23] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2023-03-20 09:01:23] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:01:24] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 0 ms to minimize.
[2023-03-20 09:01:24] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:01:24] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 0 ms to minimize.
[2023-03-20 09:01:25] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-20 09:01:25] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 1 ms to minimize.
[2023-03-20 09:01:25] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-20 09:01:26] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 1 ms to minimize.
[2023-03-20 09:01:27] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-20 09:01:27] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 0 ms to minimize.
[2023-03-20 09:01:27] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 0 ms to minimize.
[2023-03-20 09:01:28] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-20 09:01:28] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 0 ms to minimize.
[2023-03-20 09:01:29] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-20 09:01:29] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 0 ms to minimize.
[2023-03-20 09:01:29] [INFO ] Deduced a trap composed of 7 places in 311 ms of which 0 ms to minimize.
[2023-03-20 09:01:30] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 0 ms to minimize.
[2023-03-20 09:01:30] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2023-03-20 09:01:31] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 0 ms to minimize.
[2023-03-20 09:01:31] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 2 ms to minimize.
[2023-03-20 09:01:31] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 1 ms to minimize.
[2023-03-20 09:01:32] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 0 ms to minimize.
[2023-03-20 09:01:32] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 0 ms to minimize.
[2023-03-20 09:01:33] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-20 09:01:33] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2023-03-20 09:01:34] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-03-20 09:01:34] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2023-03-20 09:01:34] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-20 09:01:35] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-20 09:01:35] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 1 ms to minimize.
[2023-03-20 09:01:36] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 1 ms to minimize.
[2023-03-20 09:01:36] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2023-03-20 09:01:36] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 0 ms to minimize.
[2023-03-20 09:01:37] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-20 09:01:37] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-20 09:01:37] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-20 09:01:38] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 1 ms to minimize.
[2023-03-20 09:01:38] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2023-03-20 09:01:38] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 0 ms to minimize.
[2023-03-20 09:01:39] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-20 09:01:39] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:01:39] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-20 09:01:40] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:01:40] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:01:40] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-20 09:01:41] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2023-03-20 09:01:41] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 1 ms to minimize.
[2023-03-20 09:01:42] [INFO ] Deduced a trap composed of 7 places in 380 ms of which 2 ms to minimize.
[2023-03-20 09:01:42] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-20 09:01:42] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2023-03-20 09:01:43] [INFO ] Deduced a trap composed of 7 places in 376 ms of which 1 ms to minimize.
[2023-03-20 09:01:43] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 0 ms to minimize.
[2023-03-20 09:01:44] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2023-03-20 09:01:44] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:01:44] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-20 09:01:45] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2023-03-20 09:01:45] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-20 09:01:45] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 1 ms to minimize.
[2023-03-20 09:01:46] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2023-03-20 09:01:46] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-20 09:01:47] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2023-03-20 09:01:47] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2023-03-20 09:01:47] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 1 ms to minimize.
[2023-03-20 09:01:48] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:01:48] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 0 ms to minimize.
[2023-03-20 09:01:48] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 0 ms to minimize.
[2023-03-20 09:01:49] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 0 ms to minimize.
[2023-03-20 09:01:49] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 1 ms to minimize.
[2023-03-20 09:01:50] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:01:50] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2023-03-20 09:01:50] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 0 ms to minimize.
[2023-03-20 09:01:51] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 1 ms to minimize.
[2023-03-20 09:01:51] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 1 ms to minimize.
[2023-03-20 09:01:51] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 0 ms to minimize.
[2023-03-20 09:01:52] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-20 09:01:52] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 1 ms to minimize.
[2023-03-20 09:01:53] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-20 09:01:53] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 0 ms to minimize.
[2023-03-20 09:01:54] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 2 ms to minimize.
[2023-03-20 09:01:54] [INFO ] Deduced a trap composed of 12 places in 332 ms of which 1 ms to minimize.
[2023-03-20 09:01:54] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2023-03-20 09:01:55] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 0 ms to minimize.
[2023-03-20 09:01:55] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 0 ms to minimize.
[2023-03-20 09:01:55] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 1 ms to minimize.
[2023-03-20 09:01:56] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 0 ms to minimize.
[2023-03-20 09:01:56] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2023-03-20 09:01:57] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:01:57] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 0 ms to minimize.
[2023-03-20 09:01:57] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2023-03-20 09:01:58] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2023-03-20 09:01:58] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-20 09:01:59] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 0 ms to minimize.
[2023-03-20 09:01:59] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2023-03-20 09:01:59] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 1 ms to minimize.
[2023-03-20 09:02:00] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-20 09:02:00] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2023-03-20 09:02:01] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:02:01] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 1 ms to minimize.
[2023-03-20 09:02:01] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 1 ms to minimize.
[2023-03-20 09:02:02] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:02:02] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-20 09:02:02] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 0 ms to minimize.
[2023-03-20 09:02:03] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 1 ms to minimize.
[2023-03-20 09:02:03] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-20 09:02:03] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:02:04] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:02:04] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 1 ms to minimize.
[2023-03-20 09:02:04] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-20 09:02:05] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-20 09:02:05] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 0 ms to minimize.
[2023-03-20 09:02:05] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-20 09:02:06] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:02:06] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:02:06] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2023-03-20 09:02:06] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-20 09:02:07] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2023-03-20 09:02:07] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2023-03-20 09:02:09] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2023-03-20 09:02:10] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 1 ms to minimize.
[2023-03-20 09:02:10] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
[2023-03-20 09:02:11] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2023-03-20 09:02:11] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 1 ms to minimize.
[2023-03-20 09:02:11] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2023-03-20 09:02:12] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2023-03-20 09:02:12] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-20 09:02:13] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:02:13] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-20 09:02:13] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 0 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-20 09:02:14] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-20 09:02:15] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2023-03-20 09:02:16] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-20 09:02:16] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-20 09:02:18] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2023-03-20 09:02:18] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-20 09:02:18] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2023-03-20 09:02:19] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2023-03-20 09:02:19] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 1 ms to minimize.
[2023-03-20 09:02:19] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 0 ms to minimize.
[2023-03-20 09:02:20] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-20 09:02:20] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2023-03-20 09:02:20] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 1 ms to minimize.
[2023-03-20 09:02:21] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-20 09:02:21] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 0 ms to minimize.
[2023-03-20 09:02:21] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 0 ms to minimize.
[2023-03-20 09:02:22] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 0 ms to minimize.
[2023-03-20 09:02:22] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2023-03-20 09:02:22] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 0 ms to minimize.
[2023-03-20 09:02:23] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:02:23] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 1 ms to minimize.
[2023-03-20 09:02:23] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2023-03-20 09:02:24] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:02:24] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-20 09:02:24] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2023-03-20 09:02:25] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:02:25] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-20 09:02:25] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2023-03-20 09:02:26] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:02:26] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-20 09:02:26] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2023-03-20 09:02:27] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 1 ms to minimize.
[2023-03-20 09:02:27] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-20 09:02:27] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 0 ms to minimize.
[2023-03-20 09:02:27] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:02:29] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-20 09:02:30] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-20 09:02:30] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 0 ms to minimize.
[2023-03-20 09:02:31] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-20 09:02:31] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-20 09:02:31] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 1 ms to minimize.
[2023-03-20 09:02:32] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2023-03-20 09:02:32] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 1 ms to minimize.
[2023-03-20 09:02:32] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 0 ms to minimize.
[2023-03-20 09:02:33] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
[2023-03-20 09:02:34] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 0 ms to minimize.
[2023-03-20 09:02:35] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 0 ms to minimize.
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 1 ms to minimize.
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 1 ms to minimize.
[2023-03-20 09:02:36] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 1 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-20 09:02:39] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 0 ms to minimize.
[2023-03-20 09:02:40] [INFO ] Deduced a trap composed of 7 places in 368 ms of which 1 ms to minimize.
[2023-03-20 09:02:40] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 0 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 0 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 0 ms to minimize.
[2023-03-20 09:02:41] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2023-03-20 09:02:42] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2023-03-20 09:02:43] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 0 ms to minimize.
[2023-03-20 09:02:44] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 1 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2023-03-20 09:02:45] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-20 09:02:46] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2023-03-20 09:02:46] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 1 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 0 ms to minimize.
[2023-03-20 09:02:48] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 0 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2023-03-20 09:02:49] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 1 ms to minimize.
[2023-03-20 09:02:50] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2023-03-20 09:02:51] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-20 09:02:51] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 1 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 1 ms to minimize.
[2023-03-20 09:02:52] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-20 09:02:53] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2023-03-20 09:02:53] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 1 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 0 ms to minimize.
[2023-03-20 09:02:54] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 1 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 3 ms to minimize.
[2023-03-20 09:02:55] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-20 09:02:56] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:02:56] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 0 ms to minimize.
[2023-03-20 09:02:56] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2023-03-20 09:02:57] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2023-03-20 09:02:57] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 3 ms to minimize.
[2023-03-20 09:02:57] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
[2023-03-20 09:02:58] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:02:58] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 0 ms to minimize.
[2023-03-20 09:02:58] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:02:59] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 0 ms to minimize.
[2023-03-20 09:02:59] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 0 ms to minimize.
[2023-03-20 09:03:00] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 0 ms to minimize.
[2023-03-20 09:03:00] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 0 ms to minimize.
[2023-03-20 09:03:00] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 0 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 0 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-20 09:03:01] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 0 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 0 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 0 ms to minimize.
[2023-03-20 09:03:02] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2023-03-20 09:03:03] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:03:03] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-20 09:03:03] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-20 09:03:04] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2023-03-20 09:03:04] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-03-20 09:03:04] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 2 ms to minimize.
[2023-03-20 09:03:04] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-20 09:03:06] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-20 09:03:06] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:03:07] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-20 09:03:07] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2023-03-20 09:03:07] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:03:08] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2023-03-20 09:03:08] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 1 ms to minimize.
[2023-03-20 09:03:09] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2023-03-20 09:03:09] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-20 09:03:09] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 1 ms to minimize.
[2023-03-20 09:03:11] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 0 ms to minimize.
[2023-03-20 09:03:12] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-20 09:03:12] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 0 ms to minimize.
[2023-03-20 09:03:12] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 0 ms to minimize.
[2023-03-20 09:03:13] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 0 ms to minimize.
[2023-03-20 09:03:13] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 0 ms to minimize.
[2023-03-20 09:03:13] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2023-03-20 09:03:14] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2023-03-20 09:03:14] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 0 ms to minimize.
[2023-03-20 09:03:14] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:03:15] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 0 ms to minimize.
[2023-03-20 09:03:15] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2023-03-20 09:03:15] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 0 ms to minimize.
[2023-03-20 09:03:16] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 1 ms to minimize.
[2023-03-20 09:03:16] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:03:16] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 0 ms to minimize.
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:03:19] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 0 ms to minimize.
[2023-03-20 09:03:19] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 0 ms to minimize.
[2023-03-20 09:03:19] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2023-03-20 09:03:19] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-20 09:03:20] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-20 09:03:20] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2023-03-20 09:03:20] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2023-03-20 09:03:21] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:03:21] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2023-03-20 09:03:21] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:03:21] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2023-03-20 09:03:22] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-03-20 09:03:22] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-20 09:03:22] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2023-03-20 09:03:23] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2023-03-20 09:03:23] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 0 ms to minimize.
[2023-03-20 09:03:23] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 0 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 0 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 1 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:03:25] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:03:25] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2023-03-20 09:03:25] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-20 09:03:26] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 0 ms to minimize.
[2023-03-20 09:03:26] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:03:26] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2023-03-20 09:03:26] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 0 ms to minimize.
[2023-03-20 09:03:27] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2023-03-20 09:03:27] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-20 09:03:27] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 0 ms to minimize.
[2023-03-20 09:03:28] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2023-03-20 09:03:28] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:03:28] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:03:29] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-20 09:03:29] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2023-03-20 09:03:29] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 0 ms to minimize.
[2023-03-20 09:03:30] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 1 ms to minimize.
[2023-03-20 09:03:30] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2023-03-20 09:03:30] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 0 ms to minimize.
[2023-03-20 09:03:31] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:03:31] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-20 09:03:31] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 0 ms to minimize.
[2023-03-20 09:03:32] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:03:32] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 1 ms to minimize.
[2023-03-20 09:03:32] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2023-03-20 09:03:32] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:03:33] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 0 ms to minimize.
[2023-03-20 09:03:33] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2023-03-20 09:03:33] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 0 ms to minimize.
[2023-03-20 09:03:35] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2023-03-20 09:03:35] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2023-03-20 09:03:35] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 1 ms to minimize.
[2023-03-20 09:03:35] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 1 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-20 09:03:38] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2023-03-20 09:03:38] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-20 09:03:38] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:03:40] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2023-03-20 09:03:40] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-20 09:03:40] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-20 09:03:40] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2023-03-20 09:03:40] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-20 09:03:41] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:03:41] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:03:41] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 1 ms to minimize.
[2023-03-20 09:03:42] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2023-03-20 09:03:42] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2023-03-20 09:03:42] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 1 ms to minimize.
[2023-03-20 09:03:43] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 0 ms to minimize.
[2023-03-20 09:03:43] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-20 09:03:43] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2023-03-20 09:03:43] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 0 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 0 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2023-03-20 09:03:46] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:03:46] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:03:46] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 1 ms to minimize.
[2023-03-20 09:03:47] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2023-03-20 09:03:47] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-20 09:03:47] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 0 ms to minimize.
[2023-03-20 09:03:47] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2023-03-20 09:03:48] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2023-03-20 09:03:48] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-03-20 09:03:48] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 0 ms to minimize.
[2023-03-20 09:03:48] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2023-03-20 09:03:49] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-20 09:03:49] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 0 ms to minimize.
[2023-03-20 09:03:49] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 0 ms to minimize.
[2023-03-20 09:03:49] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-03-20 09:03:49] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2023-03-20 09:03:50] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 1 ms to minimize.
[2023-03-20 09:03:50] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2023-03-20 09:03:50] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 1 ms to minimize.
[2023-03-20 09:03:50] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2023-03-20 09:03:52] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 0 ms to minimize.
[2023-03-20 09:03:52] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-20 09:03:52] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:03:52] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-03-20 09:03:53] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 0 ms to minimize.
[2023-03-20 09:03:53] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-20 09:03:53] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2023-03-20 09:03:53] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-20 09:03:54] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2023-03-20 09:03:54] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 0 ms to minimize.
[2023-03-20 09:03:54] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 0 ms to minimize.
[2023-03-20 09:03:54] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-20 09:03:55] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2023-03-20 09:03:55] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-20 09:03:55] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-03-20 09:03:55] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2023-03-20 09:03:56] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-20 09:03:56] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-20 09:03:56] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:03:56] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2023-03-20 09:03:57] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 0 ms to minimize.
[2023-03-20 09:03:57] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2023-03-20 09:03:57] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:03:57] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 1 ms to minimize.
[2023-03-20 09:03:58] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2023-03-20 09:03:58] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 1 ms to minimize.
[2023-03-20 09:03:58] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2023-03-20 09:03:58] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 0 ms to minimize.
[2023-03-20 09:03:59] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2023-03-20 09:03:59] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2023-03-20 09:03:59] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 0 ms to minimize.
[2023-03-20 09:04:00] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2023-03-20 09:04:00] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:04:00] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 1 ms to minimize.
[2023-03-20 09:04:01] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2023-03-20 09:04:01] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 0 ms to minimize.
[2023-03-20 09:04:01] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 0 ms to minimize.
[2023-03-20 09:04:02] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2023-03-20 09:04:02] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 0 ms to minimize.
[2023-03-20 09:04:02] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 0 ms to minimize.
[2023-03-20 09:04:03] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:04:03] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 0 ms to minimize.
[2023-03-20 09:04:03] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 1 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:04:04] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 0 ms to minimize.
[2023-03-20 09:04:05] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 0 ms to minimize.
[2023-03-20 09:04:05] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 0 ms to minimize.
[2023-03-20 09:04:05] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 1 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 0 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 0 ms to minimize.
[2023-03-20 09:04:06] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 0 ms to minimize.
[2023-03-20 09:04:07] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 0 ms to minimize.
[2023-03-20 09:04:08] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:04:08] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2023-03-20 09:04:08] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 1 ms to minimize.
[2023-03-20 09:04:09] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:04:09] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 0 ms to minimize.
[2023-03-20 09:04:09] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 1 ms to minimize.
[2023-03-20 09:04:10] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 1 ms to minimize.
[2023-03-20 09:04:10] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-20 09:04:10] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 0 ms to minimize.
[2023-03-20 09:04:11] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2023-03-20 09:04:11] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 0 ms to minimize.
[2023-03-20 09:04:11] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 1 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 0 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2023-03-20 09:04:12] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 0 ms to minimize.
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 1 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 0 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 0 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 0 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 1 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 09:04:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:04:16] [INFO ] After 225137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
[2023-03-20 09:04:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 09:04:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9568 arcs took 11 ms.
[2023-03-20 09:04:16] [INFO ] Flatten gal took : 244 ms
Total runtime 314907 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/2776/inv_0_ --invariant=/tmp/2776/inv_1_ --invariant=/tmp/2776/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15950972 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099572 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r425-tajo-167905977800167"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;