Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718400143.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 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 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679556762454

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:32:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:32:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:32:45] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-23 07:32:45] [INFO ] Transformed 2403 places.
[2023-03-23 07:32:45] [INFO ] Transformed 2363 transitions.
[2023-03-23 07:32:45] [INFO ] Found NUPN structural information;
[2023-03-23 07:32:45] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-23 07:32:46] [INFO ] Computed 361 place invariants in 30 ms
[2023-03-23 07:32:48] [INFO ] After 1332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 07:32:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 213 ms returned sat
[2023-03-23 07:32:56] [INFO ] After 6959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 07:33:00] [INFO ] Deduced a trap composed of 16 places in 3300 ms of which 28 ms to minimize.
[2023-03-23 07:33:01] [INFO ] Deduced a trap composed of 19 places in 1221 ms of which 5 ms to minimize.
[2023-03-23 07:33:04] [INFO ] Deduced a trap composed of 34 places in 2347 ms of which 12 ms to minimize.
[2023-03-23 07:33:06] [INFO ] Deduced a trap composed of 15 places in 1602 ms of which 17 ms to minimize.
[2023-03-23 07:33:07] [INFO ] Deduced a trap composed of 23 places in 1660 ms of which 23 ms to minimize.
[2023-03-23 07:33:08] [INFO ] Deduced a trap composed of 14 places in 878 ms of which 1 ms to minimize.
[2023-03-23 07:33:10] [INFO ] Deduced a trap composed of 21 places in 1133 ms of which 2 ms to minimize.
[2023-03-23 07:33:11] [INFO ] Deduced a trap composed of 20 places in 1086 ms of which 2 ms to minimize.
[2023-03-23 07:33:12] [INFO ] Deduced a trap composed of 26 places in 1089 ms of which 2 ms to minimize.
[2023-03-23 07:33:13] [INFO ] Deduced a trap composed of 22 places in 961 ms of which 9 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-23 07:33:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:33:13] [INFO ] After 25575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1037 ms.
Support contains 149 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2403 transition count 2190
Reduce places removed 173 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 2230 transition count 2183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 360 place count 2223 transition count 2183
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 360 place count 2223 transition count 1985
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 756 place count 2025 transition count 1985
Discarding 249 places :
Symmetric choice reduction at 3 with 249 rule applications. Total rules 1005 place count 1776 transition count 1736
Iterating global reduction 3 with 249 rules applied. Total rules applied 1254 place count 1776 transition count 1736
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1254 place count 1776 transition count 1652
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1422 place count 1692 transition count 1652
Performed 538 Post agglomeration using F-continuation condition.Transition count delta: 538
Deduced a syphon composed of 538 places in 5 ms
Reduce places removed 538 places and 0 transitions.
Iterating global reduction 3 with 1076 rules applied. Total rules applied 2498 place count 1154 transition count 1114
Partial Free-agglomeration rule applied 246 times.
Drop transitions removed 246 transitions
Iterating global reduction 3 with 246 rules applied. Total rules applied 2744 place count 1154 transition count 1114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2745 place count 1153 transition count 1113
Applied a total of 2745 rules in 791 ms. Remains 1153 /2403 variables (removed 1250) and now considering 1113/2363 (removed 1250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 792 ms. Remains : 1153/2403 places, 1113/2363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1113 rows 1153 cols
[2023-03-23 07:33:16] [INFO ] Computed 361 place invariants in 20 ms
[2023-03-23 07:33:16] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:33:16] [INFO ] [Nat]Absence check using 354 positive place invariants in 179 ms returned sat
[2023-03-23 07:33:16] [INFO ] [Nat]Absence check using 354 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-23 07:33:18] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:33:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:33:19] [INFO ] After 844ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:33:19] [INFO ] Deduced a trap composed of 5 places in 471 ms of which 1 ms to minimize.
[2023-03-23 07:33:20] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 0 ms to minimize.
[2023-03-23 07:33:20] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-23 07:33:20] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-23 07:33:21] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 2 ms to minimize.
[2023-03-23 07:33:21] [INFO ] Deduced a trap composed of 6 places in 552 ms of which 26 ms to minimize.
[2023-03-23 07:33:22] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 1 ms to minimize.
[2023-03-23 07:33:22] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2023-03-23 07:33:22] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 2 ms to minimize.
[2023-03-23 07:33:23] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 0 ms to minimize.
[2023-03-23 07:33:23] [INFO ] Deduced a trap composed of 7 places in 382 ms of which 0 ms to minimize.
[2023-03-23 07:33:24] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 1 ms to minimize.
[2023-03-23 07:33:24] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2023-03-23 07:33:24] [INFO ] Deduced a trap composed of 8 places in 471 ms of which 0 ms to minimize.
[2023-03-23 07:33:25] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-23 07:33:25] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-23 07:33:26] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 1 ms to minimize.
[2023-03-23 07:33:26] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2023-03-23 07:33:26] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2023-03-23 07:33:27] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:33:27] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2023-03-23 07:33:27] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-23 07:33:27] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-23 07:33:28] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-23 07:33:28] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2023-03-23 07:33:28] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-23 07:33:29] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 1 ms to minimize.
[2023-03-23 07:33:29] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2023-03-23 07:33:29] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2023-03-23 07:33:30] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 2 ms to minimize.
[2023-03-23 07:33:30] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 0 ms to minimize.
[2023-03-23 07:33:30] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2023-03-23 07:33:31] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-23 07:33:31] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-23 07:33:31] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-23 07:33:31] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2023-03-23 07:33:32] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-23 07:33:32] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 0 ms to minimize.
[2023-03-23 07:33:32] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-23 07:33:32] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 13400 ms
[2023-03-23 07:33:33] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 1 ms to minimize.
[2023-03-23 07:33:33] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 13 ms to minimize.
[2023-03-23 07:33:34] [INFO ] Deduced a trap composed of 7 places in 464 ms of which 4 ms to minimize.
[2023-03-23 07:33:34] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 1 ms to minimize.
[2023-03-23 07:33:35] [INFO ] Deduced a trap composed of 10 places in 486 ms of which 1 ms to minimize.
[2023-03-23 07:33:35] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 15 ms to minimize.
[2023-03-23 07:33:35] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 21 ms to minimize.
[2023-03-23 07:33:36] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:33:36] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2023-03-23 07:33:36] [INFO ] Deduced a trap composed of 10 places in 375 ms of which 1 ms to minimize.
[2023-03-23 07:33:38] [INFO ] Deduced a trap composed of 11 places in 1115 ms of which 0 ms to minimize.
[2023-03-23 07:33:38] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-23 07:33:39] [INFO ] Deduced a trap composed of 21 places in 470 ms of which 1 ms to minimize.
[2023-03-23 07:33:39] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2023-03-23 07:33:39] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 0 ms to minimize.
[2023-03-23 07:33:39] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 2 ms to minimize.
[2023-03-23 07:33:40] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2023-03-23 07:33:40] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 0 ms to minimize.
[2023-03-23 07:33:40] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 3 ms to minimize.
[2023-03-23 07:33:41] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 3 ms to minimize.
[2023-03-23 07:33:41] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:33:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:33:41] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 163 ms.
Support contains 122 out of 1153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1153/1153 places, 1113/1113 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1153 transition count 1111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1151 transition count 1111
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1151 transition count 1109
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1149 transition count 1109
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 72 place count 1117 transition count 1077
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1117 transition count 1077
Applied a total of 76 rules in 216 ms. Remains 1117 /1153 variables (removed 36) and now considering 1077/1113 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1117/1153 places, 1077/1113 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1077 rows 1117 cols
[2023-03-23 07:33:42] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-23 07:33:42] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:33:43] [INFO ] [Nat]Absence check using 355 positive place invariants in 104 ms returned sat
[2023-03-23 07:33:43] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-23 07:33:44] [INFO ] After 1419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:33:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:33:45] [INFO ] After 762ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:33:45] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-23 07:33:46] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:33:46] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:33:46] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-23 07:33:46] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2023-03-23 07:33:47] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-23 07:33:47] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2023-03-23 07:33:47] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-23 07:33:48] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-23 07:33:48] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 2 ms to minimize.
[2023-03-23 07:33:49] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 0 ms to minimize.
[2023-03-23 07:33:49] [INFO ] Deduced a trap composed of 3 places in 819 ms of which 2 ms to minimize.
[2023-03-23 07:33:50] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 0 ms to minimize.
[2023-03-23 07:33:50] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:33:50] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 0 ms to minimize.
[2023-03-23 07:33:51] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-23 07:33:51] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2023-03-23 07:33:51] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-23 07:33:51] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-23 07:33:52] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-23 07:33:52] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:33:52] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:33:52] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:33:53] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 0 ms to minimize.
[2023-03-23 07:33:53] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2023-03-23 07:33:53] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-23 07:33:53] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-23 07:33:54] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-23 07:33:54] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:33:54] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:33:54] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:33:54] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:33:55] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-23 07:33:55] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:33:55] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-23 07:33:55] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 10160 ms
[2023-03-23 07:33:56] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-23 07:33:56] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-23 07:33:56] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 2 ms to minimize.
[2023-03-23 07:33:57] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 1 ms to minimize.
[2023-03-23 07:33:57] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-23 07:33:57] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-23 07:33:58] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-23 07:33:58] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2023-03-23 07:33:58] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2023-03-23 07:33:59] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 0 ms to minimize.
[2023-03-23 07:33:59] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-23 07:33:59] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-23 07:33:59] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2023-03-23 07:34:00] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-23 07:34:00] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 1 ms to minimize.
[2023-03-23 07:34:01] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:34:01] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-23 07:34:01] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2023-03-23 07:34:01] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-23 07:34:01] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 1 ms to minimize.
[2023-03-23 07:34:02] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-23 07:34:02] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:34:02] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2023-03-23 07:34:03] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2023-03-23 07:34:03] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2023-03-23 07:34:03] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7553 ms
[2023-03-23 07:34:04] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-23 07:34:04] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 1 ms to minimize.
[2023-03-23 07:34:04] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:34:05] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 2 ms to minimize.
[2023-03-23 07:34:05] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
[2023-03-23 07:34:05] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-23 07:34:05] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-23 07:34:06] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:34:06] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2023-03-23 07:34:06] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 0 ms to minimize.
[2023-03-23 07:34:07] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-23 07:34:07] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 6 ms to minimize.
[2023-03-23 07:34:07] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-23 07:34:07] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 3975 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-23 07:34:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:34:07] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 161 ms.
Support contains 119 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1077/1077 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1113 transition count 1073
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1113 transition count 1073
Applied a total of 10 rules in 142 ms. Remains 1113 /1117 variables (removed 4) and now considering 1073/1077 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 1113/1117 places, 1073/1077 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1073 rows 1113 cols
[2023-03-23 07:34:08] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-23 07:34:08] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:34:08] [INFO ] [Nat]Absence check using 355 positive place invariants in 63 ms returned sat
[2023-03-23 07:34:08] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 07:34:10] [INFO ] After 1284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:34:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:34:10] [INFO ] After 483ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 07:34:11] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 0 ms to minimize.
[2023-03-23 07:34:11] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 1 ms to minimize.
[2023-03-23 07:34:12] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2023-03-23 07:34:12] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 1 ms to minimize.
[2023-03-23 07:34:12] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2023-03-23 07:34:13] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-23 07:34:13] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2023-03-23 07:34:14] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 0 ms to minimize.
[2023-03-23 07:34:14] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2023-03-23 07:34:14] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2023-03-23 07:34:15] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2023-03-23 07:34:15] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:34:15] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-23 07:34:16] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-03-23 07:34:16] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-23 07:34:16] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-23 07:34:17] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-23 07:34:17] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-23 07:34:17] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 0 ms to minimize.
[2023-03-23 07:34:17] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2023-03-23 07:34:18] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-23 07:34:18] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:34:18] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:34:19] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 1 ms to minimize.
[2023-03-23 07:34:19] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-23 07:34:19] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 1 ms to minimize.
[2023-03-23 07:34:19] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-23 07:34:20] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 0 ms to minimize.
[2023-03-23 07:34:20] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:34:20] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2023-03-23 07:34:20] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-23 07:34:21] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 0 ms to minimize.
[2023-03-23 07:34:21] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-23 07:34:21] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-23 07:34:21] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-23 07:34:22] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:34:22] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 1 ms to minimize.
[2023-03-23 07:34:22] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2023-03-23 07:34:22] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11858 ms
[2023-03-23 07:34:23] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2023-03-23 07:34:23] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2023-03-23 07:34:24] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-23 07:34:24] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2023-03-23 07:34:25] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-23 07:34:25] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 0 ms to minimize.
[2023-03-23 07:34:25] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-23 07:34:26] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-23 07:34:26] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 0 ms to minimize.
[2023-03-23 07:34:26] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:34:27] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-23 07:34:27] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 0 ms to minimize.
[2023-03-23 07:34:27] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2023-03-23 07:34:27] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-23 07:34:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-23 07:34:28] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 0 ms to minimize.
[2023-03-23 07:34:28] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2023-03-23 07:34:28] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-23 07:34:29] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-23 07:34:29] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-23 07:34:29] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:34:29] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-23 07:34:30] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:34:30] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7016 ms
[2023-03-23 07:34:30] [INFO ] After 20161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 741 ms.
[2023-03-23 07:34:31] [INFO ] After 22473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 94 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 1073/1073 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1113 transition count 1071
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1111 transition count 1071
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 1111 transition count 1065
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 1105 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1104 transition count 1064
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1104 transition count 1064
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 place count 1087 transition count 1047
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 1087 transition count 1047
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1085 transition count 1045
Applied a total of 58 rules in 303 ms. Remains 1085 /1113 variables (removed 28) and now considering 1045/1073 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 1085/1113 places, 1045/1073 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 129080 steps, run timeout after 3003 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 129080 steps, saw 80374 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1045 rows 1085 cols
[2023-03-23 07:34:34] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-23 07:34:34] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:34:35] [INFO ] [Nat]Absence check using 355 positive place invariants in 105 ms returned sat
[2023-03-23 07:34:35] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 07:34:36] [INFO ] After 1497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:34:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:34:38] [INFO ] After 1268ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 07:34:38] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-23 07:34:38] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-23 07:34:39] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 0 ms to minimize.
[2023-03-23 07:34:39] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2023-03-23 07:34:39] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-23 07:34:40] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2023-03-23 07:34:40] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-23 07:34:40] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2023-03-23 07:34:40] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-23 07:34:41] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-23 07:34:41] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-23 07:34:41] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2023-03-23 07:34:42] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 0 ms to minimize.
[2023-03-23 07:34:42] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-23 07:34:42] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-23 07:34:42] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:34:43] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:34:43] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-23 07:34:43] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-23 07:34:44] [INFO ] Deduced a trap composed of 12 places in 504 ms of which 1 ms to minimize.
[2023-03-23 07:34:44] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-23 07:34:44] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-23 07:34:45] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-23 07:34:45] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:34:45] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-23 07:34:45] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2023-03-23 07:34:46] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 14 ms to minimize.
[2023-03-23 07:34:46] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-23 07:34:46] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8090 ms
[2023-03-23 07:34:47] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 3 ms to minimize.
[2023-03-23 07:34:47] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-23 07:34:47] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:34:48] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-23 07:34:48] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2023-03-23 07:34:48] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-23 07:34:48] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:34:49] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2023-03-23 07:34:49] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-23 07:34:49] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-23 07:34:50] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-23 07:34:50] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 1 ms to minimize.
[2023-03-23 07:34:50] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-23 07:34:51] [INFO ] Deduced a trap composed of 13 places in 342 ms of which 1 ms to minimize.
[2023-03-23 07:34:51] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-23 07:34:51] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-23 07:34:52] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-23 07:34:52] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-23 07:34:52] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:34:52] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 13 ms to minimize.
[2023-03-23 07:34:53] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2023-03-23 07:34:53] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2023-03-23 07:34:53] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 13 ms to minimize.
[2023-03-23 07:34:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6852 ms
[2023-03-23 07:34:53] [INFO ] After 16930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 814 ms.
[2023-03-23 07:34:54] [INFO ] After 19621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 141 ms.
Support contains 94 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 1045/1045 transitions.
Applied a total of 0 rules in 25 ms. Remains 1085 /1085 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1085/1085 places, 1045/1045 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 1045/1045 transitions.
Applied a total of 0 rules in 24 ms. Remains 1085 /1085 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
[2023-03-23 07:34:54] [INFO ] Invariant cache hit.
[2023-03-23 07:34:55] [INFO ] Implicit Places using invariants in 923 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 927 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1084/1085 places, 1045/1045 transitions.
Applied a total of 0 rules in 26 ms. Remains 1084 /1084 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 977 ms. Remains : 1084/1085 places, 1045/1045 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 137058 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137058 steps, saw 87417 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1045 rows 1084 cols
[2023-03-23 07:34:59] [INFO ] Computed 360 place invariants in 15 ms
[2023-03-23 07:34:59] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:34:59] [INFO ] [Nat]Absence check using 354 positive place invariants in 128 ms returned sat
[2023-03-23 07:34:59] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-23 07:35:01] [INFO ] After 1420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:35:01] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 0 ms to minimize.
[2023-03-23 07:35:01] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:35:02] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2023-03-23 07:35:02] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-03-23 07:35:02] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2023-03-23 07:35:02] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2023-03-23 07:35:03] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 1 ms to minimize.
[2023-03-23 07:35:03] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:35:03] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-23 07:35:03] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:35:04] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2023-03-23 07:35:04] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-23 07:35:04] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-23 07:35:04] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2023-03-23 07:35:05] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-23 07:35:05] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-23 07:35:05] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2023-03-23 07:35:06] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:35:06] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 1 ms to minimize.
[2023-03-23 07:35:06] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:35:07] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 1 ms to minimize.
[2023-03-23 07:35:07] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:35:07] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:35:07] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-23 07:35:08] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-23 07:35:08] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 1 ms to minimize.
[2023-03-23 07:35:08] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 1 ms to minimize.
[2023-03-23 07:35:09] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-23 07:35:09] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 0 ms to minimize.
[2023-03-23 07:35:09] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-23 07:35:09] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-23 07:35:10] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2023-03-23 07:35:10] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-23 07:35:10] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9274 ms
[2023-03-23 07:35:11] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 0 ms to minimize.
[2023-03-23 07:35:11] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-23 07:35:12] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:35:12] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:35:12] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2023-03-23 07:35:13] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 1 ms to minimize.
[2023-03-23 07:35:13] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:35:13] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-23 07:35:14] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-23 07:35:14] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 1 ms to minimize.
[2023-03-23 07:35:14] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-23 07:35:15] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-23 07:35:15] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 1 ms to minimize.
[2023-03-23 07:35:16] [INFO ] Deduced a trap composed of 8 places in 876 ms of which 1 ms to minimize.
[2023-03-23 07:35:16] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-23 07:35:17] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-23 07:35:17] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2023-03-23 07:35:17] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:35:17] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-23 07:35:18] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-23 07:35:18] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-23 07:35:18] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:35:18] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-23 07:35:19] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-23 07:35:19] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-23 07:35:19] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-23 07:35:19] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-23 07:35:19] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-23 07:35:20] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-23 07:35:20] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2023-03-23 07:35:20] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-23 07:35:20] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2023-03-23 07:35:20] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9697 ms
[2023-03-23 07:35:20] [INFO ] After 21307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 713 ms.
[2023-03-23 07:35:21] [INFO ] After 22385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 94 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 1045/1045 transitions.
Applied a total of 0 rules in 40 ms. Remains 1084 /1084 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1084/1084 places, 1045/1045 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 1045/1045 transitions.
Applied a total of 0 rules in 55 ms. Remains 1084 /1084 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
[2023-03-23 07:35:21] [INFO ] Invariant cache hit.
[2023-03-23 07:35:22] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-23 07:35:22] [INFO ] Invariant cache hit.
[2023-03-23 07:35:24] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2408 ms to find 0 implicit places.
[2023-03-23 07:35:24] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-23 07:35:24] [INFO ] Invariant cache hit.
[2023-03-23 07:35:24] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3265 ms. Remains : 1084/1084 places, 1045/1045 transitions.
Applied a total of 0 rules in 23 ms. Remains 1084 /1084 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 07:35:25] [INFO ] Invariant cache hit.
[2023-03-23 07:35:25] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:35:25] [INFO ] [Nat]Absence check using 354 positive place invariants in 110 ms returned sat
[2023-03-23 07:35:25] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 17 ms returned sat
[2023-03-23 07:35:27] [INFO ] After 1266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:35:27] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 2 ms to minimize.
[2023-03-23 07:35:27] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 1 ms to minimize.
[2023-03-23 07:35:28] [INFO ] Deduced a trap composed of 8 places in 528 ms of which 1 ms to minimize.
[2023-03-23 07:35:28] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2023-03-23 07:35:29] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-23 07:35:30] [INFO ] Deduced a trap composed of 9 places in 1395 ms of which 0 ms to minimize.
[2023-03-23 07:35:30] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-23 07:35:31] [INFO ] Deduced a trap composed of 8 places in 472 ms of which 1 ms to minimize.
[2023-03-23 07:35:31] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-23 07:35:32] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 0 ms to minimize.
[2023-03-23 07:35:32] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:35:32] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-23 07:35:32] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-23 07:35:33] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2023-03-23 07:35:33] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-23 07:35:33] [INFO ] Deduced a trap composed of 8 places in 612 ms of which 0 ms to minimize.
[2023-03-23 07:35:34] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:35:34] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 0 ms to minimize.
[2023-03-23 07:35:34] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2023-03-23 07:35:35] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-23 07:35:35] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-23 07:35:35] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2023-03-23 07:35:36] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 0 ms to minimize.
[2023-03-23 07:35:36] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-23 07:35:36] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:35:36] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-23 07:35:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:35:37] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2023-03-23 07:35:37] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 10048 ms
[2023-03-23 07:35:38] [INFO ] Deduced a trap composed of 5 places in 542 ms of which 1 ms to minimize.
[2023-03-23 07:35:38] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-23 07:35:39] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 1 ms to minimize.
[2023-03-23 07:35:39] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 0 ms to minimize.
[2023-03-23 07:35:39] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:35:40] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2023-03-23 07:35:40] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-23 07:35:40] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2023-03-23 07:35:41] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:35:41] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-23 07:35:41] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2023-03-23 07:35:41] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2023-03-23 07:35:42] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-23 07:35:42] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-23 07:35:42] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2023-03-23 07:35:42] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-23 07:35:43] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-23 07:35:43] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-23 07:35:43] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 1 ms to minimize.
[2023-03-23 07:35:44] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-23 07:35:44] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:35:44] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2023-03-23 07:35:44] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-23 07:35:45] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:35:45] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2023-03-23 07:35:45] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-23 07:35:45] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:35:46] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8289 ms
[2023-03-23 07:35:46] [INFO ] After 20245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 861 ms.
[2023-03-23 07:35:46] [INFO ] After 21582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 07:35:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-23 07:35:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1084 places, 1045 transitions and 4991 arcs took 14 ms.
[2023-03-23 07:35:47] [INFO ] Flatten gal took : 157 ms
Total runtime 182094 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 040B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1084 places, 1045 transitions, 4991 arcs.
Final Score: 86373.054
Took : 51 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679556999337

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldIIPs-PT-040B, 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 r395-oct2-167903718400143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B 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 ;