Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789800630.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789800630
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 364K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717015374115

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:42:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 20:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:42:56] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-29 20:42:56] [INFO ] Transformed 1503 places.
[2024-05-29 20:42:56] [INFO ] Transformed 1503 transitions.
[2024-05-29 20:42:56] [INFO ] Found NUPN structural information;
[2024-05-29 20:42:56] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-29 20:42:57] [INFO ] Computed 121 invariants in 29 ms
[2024-05-29 20:42:58] [INFO ] After 771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 20:42:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2024-05-29 20:43:02] [INFO ] After 3308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 20:43:03] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 31 ms to minimize.
[2024-05-29 20:43:03] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 1 ms to minimize.
[2024-05-29 20:43:03] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 2 ms to minimize.
[2024-05-29 20:43:04] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 2 ms to minimize.
[2024-05-29 20:43:04] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 1 ms to minimize.
[2024-05-29 20:43:05] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 0 ms to minimize.
[2024-05-29 20:43:05] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:43:05] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:43:06] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 1 ms to minimize.
[2024-05-29 20:43:06] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:43:06] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:43:07] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:43:07] [INFO ] Deduced a trap composed of 44 places in 359 ms of which 2 ms to minimize.
[2024-05-29 20:43:08] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 1 ms to minimize.
[2024-05-29 20:43:08] [INFO ] Deduced a trap composed of 36 places in 359 ms of which 1 ms to minimize.
[2024-05-29 20:43:09] [INFO ] Deduced a trap composed of 30 places in 348 ms of which 1 ms to minimize.
[2024-05-29 20:43:09] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2024-05-29 20:43:09] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 1 ms to minimize.
[2024-05-29 20:43:10] [INFO ] Deduced a trap composed of 38 places in 345 ms of which 1 ms to minimize.
[2024-05-29 20:43:10] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 1 ms to minimize.
[2024-05-29 20:43:10] [INFO ] Deduced a trap composed of 42 places in 334 ms of which 1 ms to minimize.
[2024-05-29 20:43:11] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 1 ms to minimize.
[2024-05-29 20:43:11] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 1 ms to minimize.
[2024-05-29 20:43:12] [INFO ] Deduced a trap composed of 33 places in 310 ms of which 0 ms to minimize.
[2024-05-29 20:43:12] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 0 ms to minimize.
[2024-05-29 20:43:12] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 1 ms to minimize.
[2024-05-29 20:43:13] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 0 ms to minimize.
[2024-05-29 20:43:13] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 0 ms to minimize.
[2024-05-29 20:43:13] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:43:14] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:43:14] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:43:14] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 0 ms to minimize.
[2024-05-29 20:43:14] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:43:14] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 12371 ms
[2024-05-29 20:43:15] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 5 ms to minimize.
[2024-05-29 20:43:16] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:43:16] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2024-05-29 20:43:16] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 0 ms to minimize.
[2024-05-29 20:43:17] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:43:17] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:43:17] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:43:18] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:43:18] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2024-05-29 20:43:18] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:43:18] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:43:19] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:43:19] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:43:19] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2024-05-29 20:43:20] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:43:20] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:43:20] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:43:20] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:43:21] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:43:21] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:43:21] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:43:21] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:43:22] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:43:22] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2024-05-29 20:43:22] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:43:22] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:43:23] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:43:23] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 20:43:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:43:23] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 538 ms.
Support contains 183 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 1503 transition count 1205
Reduce places removed 298 places and 0 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Iterating post reduction 1 with 364 rules applied. Total rules applied 662 place count 1205 transition count 1139
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 2 with 66 rules applied. Total rules applied 728 place count 1139 transition count 1139
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 728 place count 1139 transition count 1019
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 968 place count 1019 transition count 1019
Discarding 174 places :
Symmetric choice reduction at 3 with 174 rule applications. Total rules 1142 place count 845 transition count 845
Iterating global reduction 3 with 174 rules applied. Total rules applied 1316 place count 845 transition count 845
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 1316 place count 845 transition count 791
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1424 place count 791 transition count 791
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Deduced a syphon composed of 227 places in 2 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 1878 place count 564 transition count 564
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1974 place count 516 transition count 586
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 1981 place count 516 transition count 579
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1988 place count 509 transition count 579
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1989 place count 509 transition count 578
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1992 place count 509 transition count 578
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1993 place count 509 transition count 578
Applied a total of 1993 rules in 347 ms. Remains 509 /1503 variables (removed 994) and now considering 578/1503 (removed 925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 509/1503 places, 578/1503 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 11) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-15 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 578 rows 509 cols
[2024-05-29 20:43:24] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:43:25] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 20:43:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2024-05-29 20:43:26] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 20:43:26] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-29 20:43:26] [INFO ] After 484ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 20:43:26] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:43:26] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:43:26] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:43:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1447 ms
[2024-05-29 20:43:28] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 520 ms
[2024-05-29 20:43:28] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:43:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 886 ms
[2024-05-29 20:43:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-29 20:43:30] [INFO ] After 4196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 495 ms.
[2024-05-29 20:43:30] [INFO ] After 5572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 127 ms.
Support contains 137 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 578/578 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 509 transition count 570
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 501 transition count 567
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 498 transition count 567
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 22 place count 498 transition count 546
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 64 place count 477 transition count 546
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 104 place count 457 transition count 526
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 124 place count 447 transition count 536
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 447 transition count 535
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 447 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 446 transition count 534
Applied a total of 127 rules in 65 ms. Remains 446 /509 variables (removed 63) and now considering 534/578 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 446/509 places, 534/578 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 9) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 534 rows 446 cols
[2024-05-29 20:43:31] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 20:43:31] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:43:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2024-05-29 20:43:32] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:43:32] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-29 20:43:32] [INFO ] After 572ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 713 ms
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:43:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:43:34] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1224 ms
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2024-05-29 20:43:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-29 20:43:35] [INFO ] After 3599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 587 ms.
[2024-05-29 20:43:36] [INFO ] After 4913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 174 ms.
Support contains 136 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 534/534 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 445 transition count 533
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 445 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 444 transition count 532
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 444 transition count 531
Applied a total of 5 rules in 47 ms. Remains 444 /446 variables (removed 2) and now considering 531/534 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 444/446 places, 531/534 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 8) seen :4
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 531 rows 444 cols
[2024-05-29 20:43:37] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 20:43:37] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:43:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2024-05-29 20:43:37] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:37] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-29 20:43:38] [INFO ] After 373ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:43:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 555 ms
[2024-05-29 20:43:39] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:43:39] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:43:39] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:43:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2024-05-29 20:43:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:43:39] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:43:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-05-29 20:43:39] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 293 ms.
[2024-05-29 20:43:39] [INFO ] After 2607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 97 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 531/531 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 444 transition count 516
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 429 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 428 transition count 515
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 32 place count 428 transition count 507
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 48 place count 420 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 419 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 419 transition count 506
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 96 place count 396 transition count 483
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 112 place count 388 transition count 493
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 388 transition count 492
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 388 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 387 transition count 491
Applied a total of 116 rules in 53 ms. Remains 387 /444 variables (removed 57) and now considering 491/531 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 387/444 places, 491/531 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 218089 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218089 steps, saw 129081 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 491 rows 387 cols
[2024-05-29 20:43:43] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 20:43:43] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:43:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2024-05-29 20:43:43] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-29 20:43:44] [INFO ] After 450ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:44] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:43:44] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:43:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:43:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:43:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 315 ms
[2024-05-29 20:43:45] [INFO ] After 1571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 830 ms.
[2024-05-29 20:43:46] [INFO ] After 2914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 36 ms.
Support contains 97 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 387 /387 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 387/387 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 387 /387 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2024-05-29 20:43:46] [INFO ] Invariant cache hit.
[2024-05-29 20:43:46] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 20:43:46] [INFO ] Invariant cache hit.
[2024-05-29 20:43:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-29 20:43:47] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2024-05-29 20:43:47] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 20:43:47] [INFO ] Invariant cache hit.
[2024-05-29 20:43:47] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1228 ms. Remains : 387/387 places, 491/491 transitions.
Graph (trivial) has 54 edges and 387 vertex of which 2 / 387 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 22 place count 386 transition count 468
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 38 place count 386 transition count 468
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 386 transition count 460
Applied a total of 46 rules in 59 ms. Remains 386 /387 variables (removed 1) and now considering 460/491 (removed 31) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 460 rows 386 cols
[2024-05-29 20:43:47] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 20:43:48] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:43:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 20:43:48] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 20:43:48] [INFO ] After 212ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:48] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:43:48] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:43:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-05-29 20:43:49] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-29 20:43:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-29 20:43:49] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-29 20:43:49] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:43:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-29 20:43:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 387 places, 491 transitions and 2210 arcs took 4 ms.
[2024-05-29 20:43:49] [INFO ] Flatten gal took : 133 ms
Total runtime 54080 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
ReachabilityFireability

FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717015431594

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 23 (type EXCL) for 3 ShieldRVt-PT-030B-ReachabilityFireability-2024-03
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 9 ShieldRVt-PT-030B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 9 ShieldRVt-PT-030B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 9 ShieldRVt-PT-030B-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for ShieldRVt-PT-030B-ReachabilityFireability-2024-09
lola: result : true
lola: fired transitions : 46
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 15 (type SRCH) for ShieldRVt-PT-030B-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 48
lola: fired transitions : 47
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type EQUN) for ShieldRVt-PT-030B-ReachabilityFireability-2024-09 (obsolete)
lola: LAUNCH task # 31 (type FNDP) for 6 ShieldRVt-PT-030B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 6 ShieldRVt-PT-030B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 6 ShieldRVt-PT-030B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 34 (type SRCH) for ShieldRVt-PT-030B-ReachabilityFireability-2024-05
lola: result : true
lola: markings : 80
lola: fired transitions : 79
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 31 (type FNDP) for ShieldRVt-PT-030B-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 78
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 32 (type EQUN) for ShieldRVt-PT-030B-ReachabilityFireability-2024-05 (obsolete)
lola: LAUNCH task # 25 (type FNDP) for 0 ShieldRVt-PT-030B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 0 ShieldRVt-PT-030B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 0 ShieldRVt-PT-030B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 25 (type FNDP) for ShieldRVt-PT-030B-ReachabilityFireability-2024-01
lola: result : true
lola: fired transitions : 43
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 28 (type SRCH) for ShieldRVt-PT-030B-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 45
lola: fired transitions : 44
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type EQUN) for ShieldRVt-PT-030B-ReachabilityFireability-2024-01 (obsolete)
lola: LAUNCH task # 19 (type FNDP) for 3 ShieldRVt-PT-030B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 3 ShieldRVt-PT-030B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 3 ShieldRVt-PT-030B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 19 (type FNDP) for ShieldRVt-PT-030B-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 22
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 20 (type EQUN) for ShieldRVt-PT-030B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 22 (type SRCH) for ShieldRVt-PT-030B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 23 (type EXCL) for ShieldRVt-PT-030B-ReachabilityFireability-2024-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-ReachabilityFireability-2024-01: EF true findpath
ShieldRVt-PT-030B-ReachabilityFireability-2024-03: AG false findpath
ShieldRVt-PT-030B-ReachabilityFireability-2024-05: EF true findpath
ShieldRVt-PT-030B-ReachabilityFireability-2024-09: EF true findpath


Time elapsed: 0 secs. Pages in use: 2

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVt-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789800630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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