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.r426-tajo-167905978600167.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 marciexred
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 r426-tajo-167905978600167
=====================================================================

--------------------
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 1679345749717

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:55:51] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-20 20:55:51] [INFO ] Transformed 1403 places.
[2023-03-20 20:55:51] [INFO ] Transformed 1903 transitions.
[2023-03-20 20:55:51] [INFO ] Found NUPN structural information;
[2023-03-20 20:55:51] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :1
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 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-20 20:55:52] [INFO ] Computed 401 place invariants in 26 ms
[2023-03-20 20:55:53] [INFO ] [Real]Absence check using 401 positive place invariants in 108 ms returned sat
[2023-03-20 20:55:53] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 20:55:54] [INFO ] [Nat]Absence check using 401 positive place invariants in 66 ms returned sat
[2023-03-20 20:55:58] [INFO ] After 3960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 20:56:01] [INFO ] Deduced a trap composed of 8 places in 440 ms of which 17 ms to minimize.
[2023-03-20 20:56:05] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 0 ms to minimize.
[2023-03-20 20:56:06] [INFO ] Deduced a trap composed of 10 places in 540 ms of which 7 ms to minimize.
[2023-03-20 20:56:06] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 14 ms to minimize.
[2023-03-20 20:56:06] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-20 20:56:07] [INFO ] Deduced a trap composed of 8 places in 442 ms of which 1 ms to minimize.
[2023-03-20 20:56:07] [INFO ] Deduced a trap composed of 8 places in 439 ms of which 14 ms to minimize.
[2023-03-20 20:56:08] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 1 ms to minimize.
[2023-03-20 20:56:08] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 1 ms to minimize.
[2023-03-20 20:56:09] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 0 ms to minimize.
[2023-03-20 20:56:09] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-20 20:56:09] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 ms to minimize.
[2023-03-20 20:56:10] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 1 ms to minimize.
[2023-03-20 20:56:10] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2023-03-20 20:56:10] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 1 ms to minimize.
[2023-03-20 20:56:11] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2023-03-20 20:56:11] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 0 ms to minimize.
[2023-03-20 20:56:11] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 2 ms to minimize.
[2023-03-20 20:56:12] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 5 ms to minimize.
[2023-03-20 20:56:12] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 3 ms to minimize.
[2023-03-20 20:56:12] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 0 ms to minimize.
[2023-03-20 20:56:13] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-20 20:56:13] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 1 ms to minimize.
[2023-03-20 20:56:14] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2023-03-20 20:56:14] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-20 20:56:14] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2023-03-20 20:56:15] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 0 ms to minimize.
[2023-03-20 20:56:15] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-20 20:56:15] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 0 ms to minimize.
[2023-03-20 20:56:15] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 0 ms to minimize.
[2023-03-20 20:56:16] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-20 20:56:16] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 2 ms to minimize.
[2023-03-20 20:56:16] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-20 20:56:17] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 4 ms to minimize.
[2023-03-20 20:56:17] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2023-03-20 20:56:17] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2023-03-20 20:56:18] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2023-03-20 20:56:18] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-20 20:56:18] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 1 ms to minimize.
[2023-03-20 20:56:19] [INFO ] Deduced a trap composed of 12 places in 263 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 20:56:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:56:19] [INFO ] After 25277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 578 ms.
Support contains 151 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 177 times.
Drop transitions removed 177 transitions
Iterating global reduction 0 with 177 rules applied. Total rules applied 179 place count 1402 transition count 1902
Applied a total of 179 rules in 367 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 369 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) 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 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 20:56:20] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 20:56:21] [INFO ] [Real]Absence check using 401 positive place invariants in 50 ms returned sat
[2023-03-20 20:56:21] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:56:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 20:56:24] [INFO ] After 2691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:56:28] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 0 ms to minimize.
[2023-03-20 20:56:37] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9466 ms
[2023-03-20 20:56:39] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 1 ms to minimize.
[2023-03-20 20:56:39] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 1 ms to minimize.
[2023-03-20 20:56:39] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2023-03-20 20:56:40] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 0 ms to minimize.
[2023-03-20 20:56:40] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 0 ms to minimize.
[2023-03-20 20:56:40] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2023-03-20 20:56:41] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 0 ms to minimize.
[2023-03-20 20:56:41] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2023-03-20 20:56:41] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-20 20:56:42] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 2 ms to minimize.
[2023-03-20 20:56:42] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-20 20:56:42] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 0 ms to minimize.
[2023-03-20 20:56:43] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2023-03-20 20:56:43] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2023-03-20 20:56:43] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 4 ms to minimize.
[2023-03-20 20:56:43] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 0 ms to minimize.
[2023-03-20 20:56:44] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 0 ms to minimize.
[2023-03-20 20:56:44] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-20 20:56:44] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 0 ms to minimize.
[2023-03-20 20:56:45] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 0 ms to minimize.
[2023-03-20 20:56:45] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:56:45] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 0 ms to minimize.
[2023-03-20 20:56:46] [INFO ] Deduced a trap composed of 13 places in 286 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 20:56:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:56:46] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 532 ms.
Support contains 86 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 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1402 transition count 1902
Applied a total of 8 rules in 219 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 219 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
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 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 20:56:47] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 20:56:47] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:56:48] [INFO ] [Nat]Absence check using 401 positive place invariants in 56 ms returned sat
[2023-03-20 20:56:53] [INFO ] After 5674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:56:54] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 3 ms to minimize.
[2023-03-20 20:56:55] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-20 20:56:55] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 2 ms to minimize.
[2023-03-20 20:56:55] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 3 ms to minimize.
[2023-03-20 20:56:55] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-20 20:56:56] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2023-03-20 20:56:56] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 0 ms to minimize.
[2023-03-20 20:56:56] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 0 ms to minimize.
[2023-03-20 20:56:57] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-20 20:56:57] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2023-03-20 20:56:57] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 0 ms to minimize.
[2023-03-20 20:56:58] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-20 20:56:59] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-20 20:56:59] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-20 20:56:59] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 1 ms to minimize.
[2023-03-20 20:57:00] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 0 ms to minimize.
[2023-03-20 20:57:00] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 0 ms to minimize.
[2023-03-20 20:57:00] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 1 ms to minimize.
[2023-03-20 20:57:01] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 0 ms to minimize.
[2023-03-20 20:57:01] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 0 ms to minimize.
[2023-03-20 20:57:02] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2023-03-20 20:57:02] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 0 ms to minimize.
[2023-03-20 20:57:02] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 1 ms to minimize.
[2023-03-20 20:57:03] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-20 20:57:03] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2023-03-20 20:57:03] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 0 ms to minimize.
[2023-03-20 20:57:04] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-20 20:57:04] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-20 20:57:05] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2023-03-20 20:57:05] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 1 ms to minimize.
[2023-03-20 20:57:05] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-20 20:57:06] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 1 ms to minimize.
[2023-03-20 20:57:06] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-20 20:57:06] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-20 20:57:07] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2023-03-20 20:57:07] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 1 ms to minimize.
[2023-03-20 20:57:07] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2023-03-20 20:57:08] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2023-03-20 20:57:08] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2023-03-20 20:57:08] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 0 ms to minimize.
[2023-03-20 20:57:09] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-20 20:57:09] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-20 20:57:09] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-20 20:57:10] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 0 ms to minimize.
[2023-03-20 20:57:10] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 0 ms to minimize.
[2023-03-20 20:57:10] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2023-03-20 20:57:10] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-20 20:57:11] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-20 20:57:11] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 0 ms to minimize.
[2023-03-20 20:57:11] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 0 ms to minimize.
[2023-03-20 20:57:12] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2023-03-20 20:57:12] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-20 20:57:12] [INFO ] Deduced a trap composed of 11 places in 275 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 20:57:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:57:12] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 308 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 78 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 78 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 128722 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128722 steps, saw 50598 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 20:57:16] [INFO ] Invariant cache hit.
[2023-03-20 20:57:16] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:57:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 64 ms returned sat
[2023-03-20 20:57:20] [INFO ] After 3219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:57:21] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 0 ms to minimize.
[2023-03-20 20:57:21] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 0 ms to minimize.
[2023-03-20 20:57:22] [INFO ] Deduced a trap composed of 7 places in 414 ms of which 1 ms to minimize.
[2023-03-20 20:57:22] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-20 20:57:22] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:57:23] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:57:23] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-20 20:57:23] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-20 20:57:24] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-20 20:57:24] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 0 ms to minimize.
[2023-03-20 20:57:24] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-20 20:57:25] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-20 20:57:25] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 0 ms to minimize.
[2023-03-20 20:57:25] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2023-03-20 20:57:26] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-20 20:57:26] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-20 20:57:26] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2023-03-20 20:57:27] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-20 20:57:27] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2023-03-20 20:57:27] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-20 20:57:27] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-20 20:57:28] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-20 20:57:28] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-20 20:57:28] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2023-03-20 20:57:29] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:57:29] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-20 20:57:29] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 0 ms to minimize.
[2023-03-20 20:57:30] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-20 20:57:30] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:57:30] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:57:30] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-20 20:57:31] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-20 20:57:31] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-03-20 20:57:31] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2023-03-20 20:57:32] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 0 ms to minimize.
[2023-03-20 20:57:32] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 0 ms to minimize.
[2023-03-20 20:57:33] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 2 ms to minimize.
[2023-03-20 20:57:33] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-20 20:57:34] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-20 20:57:34] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 0 ms to minimize.
[2023-03-20 20:57:34] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 0 ms to minimize.
[2023-03-20 20:57:35] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 1 ms to minimize.
[2023-03-20 20:57:35] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 0 ms to minimize.
[2023-03-20 20:57:36] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-20 20:57:36] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2023-03-20 20:57:36] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 0 ms to minimize.
[2023-03-20 20:57:37] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-20 20:57:37] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2023-03-20 20:57:37] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:57:37] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2023-03-20 20:57:38] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:57:38] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:57:38] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:57:38] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-20 20:57:39] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:57:39] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:57:39] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:57:39] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2023-03-20 20:57:40] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:57:40] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:57:40] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2023-03-20 20:57:40] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2023-03-20 20:57:41] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:57:41] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-20 20:57:41] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 0 ms to minimize.
[2023-03-20 20:57:41] [INFO ] Deduced a trap composed of 15 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 20:57:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:57:41] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 328 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 64 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 64 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 73 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-20 20:57:42] [INFO ] Invariant cache hit.
[2023-03-20 20:57:43] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-20 20:57:43] [INFO ] Invariant cache hit.
[2023-03-20 20:57:44] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
[2023-03-20 20:57:45] [INFO ] Redundant transitions in 461 ms returned []
[2023-03-20 20:57:45] [INFO ] Invariant cache hit.
[2023-03-20 20:57:46] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3847 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 43 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 20:57:46] [INFO ] Invariant cache hit.
[2023-03-20 20:57:46] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:57:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 48 ms returned sat
[2023-03-20 20:57:49] [INFO ] After 3205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:57:50] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2023-03-20 20:57:51] [INFO ] Deduced a trap composed of 7 places in 376 ms of which 1 ms to minimize.
[2023-03-20 20:57:51] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 1 ms to minimize.
[2023-03-20 20:57:52] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-20 20:57:52] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-20 20:57:52] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2023-03-20 20:57:53] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 0 ms to minimize.
[2023-03-20 20:57:53] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-20 20:57:53] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 0 ms to minimize.
[2023-03-20 20:57:54] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2023-03-20 20:57:54] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 0 ms to minimize.
[2023-03-20 20:57:54] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 0 ms to minimize.
[2023-03-20 20:57:55] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2023-03-20 20:57:55] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 1 ms to minimize.
[2023-03-20 20:57:56] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-20 20:57:56] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2023-03-20 20:57:56] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 1 ms to minimize.
[2023-03-20 20:57:57] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 0 ms to minimize.
[2023-03-20 20:57:57] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-20 20:57:58] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2023-03-20 20:57:58] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2023-03-20 20:57:58] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 1 ms to minimize.
[2023-03-20 20:57:59] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 0 ms to minimize.
[2023-03-20 20:57:59] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 1 ms to minimize.
[2023-03-20 20:58:00] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2023-03-20 20:58:00] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-20 20:58:00] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-20 20:58:01] [INFO ] Deduced a trap composed of 7 places in 311 ms of which 1 ms to minimize.
[2023-03-20 20:58:01] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 0 ms to minimize.
[2023-03-20 20:58:02] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 1 ms to minimize.
[2023-03-20 20:58:02] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-20 20:58:03] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
[2023-03-20 20:58:03] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 0 ms to minimize.
[2023-03-20 20:58:03] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 0 ms to minimize.
[2023-03-20 20:58:04] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 0 ms to minimize.
[2023-03-20 20:58:04] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 0 ms to minimize.
[2023-03-20 20:58:05] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2023-03-20 20:58:05] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2023-03-20 20:58:05] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 0 ms to minimize.
[2023-03-20 20:58:06] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-20 20:58:06] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-20 20:58:06] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-20 20:58:06] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-20 20:58:07] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:58:07] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-20 20:58:07] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:58:08] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2023-03-20 20:58:08] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-20 20:58:08] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:58:08] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:58:08] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:58:09] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:58:09] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:58:09] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:58:09] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2023-03-20 20:58:10] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:58:10] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 0 ms to minimize.
[2023-03-20 20:58:10] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 8 ms to minimize.
[2023-03-20 20:58:10] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:58:11] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2023-03-20 20:58:11] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 0 ms to minimize.
[2023-03-20 20:58:11] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:58:12] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-20 20:58:12] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:58:12] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-20 20:58:12] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
[2023-03-20 20:58:13] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:58:13] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:58:13] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 12 ms to minimize.
[2023-03-20 20:58:13] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:58:14] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 1 ms to minimize.
[2023-03-20 20:58:14] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:58:14] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 2 ms to minimize.
[2023-03-20 20:58:14] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:58:15] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:58:15] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:58:15] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-20 20:58:15] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:58:16] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-20 20:58:16] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-20 20:58:17] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 1 ms to minimize.
[2023-03-20 20:58:17] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2023-03-20 20:58:17] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2023-03-20 20:58:18] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 1 ms to minimize.
[2023-03-20 20:58:18] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2023-03-20 20:58:19] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 1 ms to minimize.
[2023-03-20 20:58:19] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2023-03-20 20:58:19] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-20 20:58:20] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-20 20:58:20] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 0 ms to minimize.
[2023-03-20 20:58:21] [INFO ] Deduced a trap composed of 13 places in 393 ms of which 1 ms to minimize.
[2023-03-20 20:58:21] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 0 ms to minimize.
[2023-03-20 20:58:22] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 1 ms to minimize.
[2023-03-20 20:58:22] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 0 ms to minimize.
[2023-03-20 20:58:22] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-20 20:58:23] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2023-03-20 20:58:23] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-20 20:58:23] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-20 20:58:24] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2023-03-20 20:58:24] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-20 20:58:24] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:58:24] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2023-03-20 20:58:25] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 0 ms to minimize.
[2023-03-20 20:58:25] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-20 20:58:25] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 1 ms to minimize.
[2023-03-20 20:58:26] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 0 ms to minimize.
[2023-03-20 20:58:26] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-20 20:58:27] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-20 20:58:27] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2023-03-20 20:58:27] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2023-03-20 20:58:28] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2023-03-20 20:58:28] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2023-03-20 20:58:28] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-20 20:58:29] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2023-03-20 20:58:29] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-20 20:58:29] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 0 ms to minimize.
[2023-03-20 20:58:30] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:58:30] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 1 ms to minimize.
[2023-03-20 20:58:30] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2023-03-20 20:58:31] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-20 20:58:31] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 0 ms to minimize.
[2023-03-20 20:58:31] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-20 20:58:32] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 0 ms to minimize.
[2023-03-20 20:58:32] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:58:32] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 1 ms to minimize.
[2023-03-20 20:58:32] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:58:33] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 0 ms to minimize.
[2023-03-20 20:58:33] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 0 ms to minimize.
[2023-03-20 20:58:33] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-20 20:58:34] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-20 20:58:34] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2023-03-20 20:58:34] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-20 20:58:35] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 1 ms to minimize.
[2023-03-20 20:58:35] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:58:35] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-20 20:58:36] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:58:36] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2023-03-20 20:58:36] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:58:36] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:58:37] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:58:37] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:58:37] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:58:38] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:58:38] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:58:38] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 0 ms to minimize.
[2023-03-20 20:58:38] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-20 20:58:39] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:58:39] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-03-20 20:58:39] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-20 20:58:40] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:58:40] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:58:40] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:58:41] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:58:41] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:58:41] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:58:42] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:58:42] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:58:42] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 0 ms to minimize.
[2023-03-20 20:58:42] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:58:43] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-20 20:58:43] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-20 20:58:44] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 1 ms to minimize.
[2023-03-20 20:58:44] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-20 20:58:45] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 1 ms to minimize.
[2023-03-20 20:58:45] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2023-03-20 20:58:45] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 1 ms to minimize.
[2023-03-20 20:58:46] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
[2023-03-20 20:58:46] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-20 20:58:46] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 1 ms to minimize.
[2023-03-20 20:58:47] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 0 ms to minimize.
[2023-03-20 20:58:47] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-20 20:58:47] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 1 ms to minimize.
[2023-03-20 20:58:48] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-20 20:58:48] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 1 ms to minimize.
[2023-03-20 20:58:49] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-20 20:58:49] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 1 ms to minimize.
[2023-03-20 20:58:49] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-20 20:58:50] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 0 ms to minimize.
[2023-03-20 20:58:50] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 0 ms to minimize.
[2023-03-20 20:58:50] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 1 ms to minimize.
[2023-03-20 20:58:51] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:58:51] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-20 20:58:52] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 0 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 8 places in 374 ms of which 1 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 0 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 1 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 0 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 0 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 1 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 0 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 1 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 0 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2023-03-20 20:59:01] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 0 ms to minimize.
[2023-03-20 20:59:02] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2023-03-20 20:59:05] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-20 20:59:10] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 0 ms to minimize.
[2023-03-20 20:59:10] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 0 ms to minimize.
[2023-03-20 20:59:10] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-20 20:59:11] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-20 20:59:11] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-20 20:59:11] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-20 20:59:12] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2023-03-20 20:59:12] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-20 20:59:12] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2023-03-20 20:59:12] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:59:13] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:59:13] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 0 ms to minimize.
[2023-03-20 20:59:13] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2023-03-20 20:59:14] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2023-03-20 20:59:14] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-20 20:59:15] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 0 ms to minimize.
[2023-03-20 20:59:15] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-20 20:59:15] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 0 ms to minimize.
[2023-03-20 20:59:16] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-20 20:59:16] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2023-03-20 20:59:16] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 0 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 0 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 0 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 0 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 0 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 0 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-20 20:59:25] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 0 ms to minimize.
[2023-03-20 20:59:25] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-20 20:59:25] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
[2023-03-20 20:59:27] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 0 ms to minimize.
[2023-03-20 20:59:27] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 0 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 0 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 1 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 1 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 0 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 0 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2023-03-20 20:59:34] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:59:34] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:59:34] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:59:34] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:59:35] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-20 20:59:35] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:59:35] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:59:35] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:59:36] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:59:36] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:59:36] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:59:36] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 0 ms to minimize.
[2023-03-20 20:59:37] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:59:37] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:59:37] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:59:37] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:59:38] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:59:38] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:59:38] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:59:38] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2023-03-20 20:59:38] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:59:39] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:39] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-20 20:59:39] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:59:39] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-20 20:59:39] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 16 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 0 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 0 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2023-03-20 21:00:12] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 6 ms to minimize.
[2023-03-20 21:00:12] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-20 21:00:12] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2023-03-20 21:00:12] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2023-03-20 21:00:13] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 0 ms to minimize.
[2023-03-20 21:00:13] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-20 21:00:13] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-20 21:00:13] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-03-20 21:00:13] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:14] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2023-03-20 21:00:14] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 0 ms to minimize.
[2023-03-20 21:00:14] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2023-03-20 21:00:14] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2023-03-20 21:00:15] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2023-03-20 21:00:15] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2023-03-20 21:00:15] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 21:00:15] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-20 21:00:16] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2023-03-20 21:00:17] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:00:17] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-20 21:00:17] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-20 21:00:17] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:00:17] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-20 21:00:18] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-20 21:00:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-20 21:00:18] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-20 21:00:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-20 21:00:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-20 21:00:19] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-20 21:00:19] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-20 21:00:19] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-20 21:00:19] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 21:00:19] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-20 21:00:20] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2023-03-20 21:00:20] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2023-03-20 21:00:20] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2023-03-20 21:00:20] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:20] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-20 21:00:21] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2023-03-20 21:00:21] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-20 21:00:21] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-20 21:00:21] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 0 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 0 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-20 21:00:34] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2023-03-20 21:00:34] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 31 places in 2385 ms of which 26 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2023-03-20 21:00:38] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-20 21:00:38] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 1 ms to minimize.
[2023-03-20 21:00:39] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-03-20 21:00:39] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 0 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2023-03-20 21:00:41] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 0 ms to minimize.
[2023-03-20 21:00:41] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:00:41] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2023-03-20 21:00:42] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2023-03-20 21:00:42] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 1 ms to minimize.
[2023-03-20 21:00:42] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 1 ms to minimize.
[2023-03-20 21:00:43] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2023-03-20 21:00:43] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 0 ms to minimize.
[2023-03-20 21:00:43] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 1 ms to minimize.
[2023-03-20 21:00:44] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 0 ms to minimize.
[2023-03-20 21:00:44] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:00:44] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2023-03-20 21:00:45] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:00:45] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2023-03-20 21:00:45] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 1 ms to minimize.
[2023-03-20 21:00:46] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 0 ms to minimize.
[2023-03-20 21:00:46] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-20 21:00:46] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 1 ms to minimize.
[2023-03-20 21:00:47] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 1 ms to minimize.
[2023-03-20 21:00:47] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 0 ms to minimize.
[2023-03-20 21:00:47] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 0 ms to minimize.
[2023-03-20 21:00:48] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 1 ms to minimize.
[2023-03-20 21:00:48] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2023-03-20 21:00:48] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2023-03-20 21:00:49] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-20 21:00:49] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-20 21:00:50] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 0 ms to minimize.
[2023-03-20 21:00:50] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 0 ms to minimize.
[2023-03-20 21:00:50] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 0 ms to minimize.
[2023-03-20 21:00:51] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 1 ms to minimize.
[2023-03-20 21:00:51] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2023-03-20 21:00:51] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 1 ms to minimize.
[2023-03-20 21:00:52] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 0 ms to minimize.
[2023-03-20 21:00:52] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 0 ms to minimize.
[2023-03-20 21:00:52] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:00:53] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 0 ms to minimize.
[2023-03-20 21:00:53] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 0 ms to minimize.
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 0 ms to minimize.
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 0 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Trap strengthening (SAT) tested/added 641/640 trap constraints in 191897 ms
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-20 21:01:07] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 0 ms to minimize.
[2023-03-20 21:01:09] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 1 ms to minimize.
[2023-03-20 21:01:10] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 1 ms to minimize.
[2023-03-20 21:01:10] [INFO ] Deduced a trap composed of 7 places in 386 ms of which 1 ms to minimize.
[2023-03-20 21:01:11] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2023-03-20 21:01:11] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 0 ms to minimize.
[2023-03-20 21:01:12] [INFO ] Deduced a trap composed of 8 places in 424 ms of which 0 ms to minimize.
[2023-03-20 21:01:12] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 1 ms to minimize.
[2023-03-20 21:01:13] [INFO ] Deduced a trap composed of 16 places in 433 ms of which 1 ms to minimize.
[2023-03-20 21:01:13] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 1 ms to minimize.
[2023-03-20 21:01:14] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2023-03-20 21:01:14] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 0 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 15 places in 426 ms of which 1 ms to minimize.
[2023-03-20 21:01:16] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 0 ms to minimize.
[2023-03-20 21:01:16] [INFO ] Deduced a trap composed of 7 places in 406 ms of which 1 ms to minimize.
[2023-03-20 21:01:17] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 1 ms to minimize.
[2023-03-20 21:01:17] [INFO ] Deduced a trap composed of 15 places in 408 ms of which 1 ms to minimize.
[2023-03-20 21:01:18] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 0 ms to minimize.
[2023-03-20 21:01:18] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 1 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 1 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 1 ms to minimize.
[2023-03-20 21:01:20] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-20 21:01:20] [INFO ] Deduced a trap composed of 7 places in 386 ms of which 1 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 0 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 0 ms to minimize.
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 0 ms to minimize.
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 0 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Deduced a trap composed of 19 places in 345 ms of which 1 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 0 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Deduced a trap composed of 20 places in 345 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 0 ms to minimize.
[2023-03-20 21:01:29] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 1 ms to minimize.
[2023-03-20 21:01:30] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 0 ms to minimize.
[2023-03-20 21:01:30] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2023-03-20 21:01:31] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 1 ms to minimize.
[2023-03-20 21:01:32] [INFO ] Deduced a trap composed of 3 places in 879 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.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 21:01:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:01:32] [INFO ] After 225899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
[2023-03-20 21:01:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 21:01:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1402 places, 1902 transitions and 9568 arcs took 10 ms.
[2023-03-20 21:01:32] [INFO ] Flatten gal took : 256 ms
Total runtime 341517 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_100A
(NrP: 1402 NrTr: 1902 NrArc: 9568)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.315sec

net check time: 0m 0.002sec

init dd package: 0m 3.253sec


before gc: list nodes free: 1857534

after gc: idd nodes used:11471, unused:63988529; list nodes free:280959380

before gc: list nodes free: 1192312

after gc: idd nodes used:14398, unused:63985602; list nodes free:280945846

before gc: list nodes free: 1147193

after gc: idd nodes used:14783, unused:63985217; list nodes free:280944386

before gc: list nodes free: 1186130

after gc: idd nodes used:14863, unused:63985137; list nodes free:280943806

before gc: list nodes free: 1117809

after gc: idd nodes used:16341, unused:63983659; list nodes free:280936470

before gc: list nodes free: 732098

after gc: idd nodes used:16254, unused:63983746; list nodes free:280937385

before gc: list nodes free: 1006530

after gc: idd nodes used:15986, unused:63984014; list nodes free:280938598

before gc: list nodes free: 1208023

after gc: idd nodes used:16440, unused:63983560; list nodes free:280936447

before gc: list nodes free: 1087421

after gc: idd nodes used:17473, unused:63982527; list nodes free:280931567

before gc: list nodes free: 1026285

after gc: idd nodes used:17684, unused:63982316; list nodes free:280930733

before gc: list nodes free: 738185

after gc: idd nodes used:17983, unused:63982017; list nodes free:280929287

before gc: list nodes free: 857583

after gc: idd nodes used:17802, unused:63982198; list nodes free:280930055

before gc: list nodes free: 939567

after gc: idd nodes used:18021, unused:63981979; list nodes free:280928985

before gc: list nodes free: 1067576

after gc: idd nodes used:17820, unused:63982180; list nodes free:280930202
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6318408 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096420 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.015sec

8300 9906 10460 10979 11467 12526 11765 12081 12888 14712 14295 14776 14936 15236 14804 14810 14909 15102 14948 15025 15408 14775 15363 15952 15234 15862 16434 16425 16839 16217 17132 16223 16178 16179 16362 15801 16073 16176 16406 16077 16113 16317 16583 16328 16681 16731 16735 16984 17485 17574 17043 17208 16790 17614 17996 18062 17738 17566 17211 17994 18447 17842 17711 17632 17499 17517 17714 18095 17955 18014 17937 17739 17794 17838 17919 17855 18112 17712 17696 18033

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="marciexred"
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 marciexred"
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 r426-tajo-167905978600167"
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 ;