Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976300127.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679242610383

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:16:52] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-19 16:16:52] [INFO ] Transformed 1203 places.
[2023-03-19 16:16:52] [INFO ] Transformed 1353 transitions.
[2023-03-19 16:16:52] [INFO ] Found NUPN structural information;
[2023-03-19 16:16:52] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-19 16:16:52] [INFO ] Computed 121 place invariants in 17 ms
[2023-03-19 16:16:53] [INFO ] [Real]Absence check using 121 positive place invariants in 41 ms returned sat
[2023-03-19 16:16:53] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 16:16:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 46 ms returned sat
[2023-03-19 16:16:55] [INFO ] After 1600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 16:16:56] [INFO ] Deduced a trap composed of 30 places in 600 ms of which 28 ms to minimize.
[2023-03-19 16:16:56] [INFO ] Deduced a trap composed of 34 places in 518 ms of which 2 ms to minimize.
[2023-03-19 16:16:57] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 1 ms to minimize.
[2023-03-19 16:16:57] [INFO ] Deduced a trap composed of 22 places in 510 ms of which 15 ms to minimize.
[2023-03-19 16:16:58] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 2 ms to minimize.
[2023-03-19 16:16:59] [INFO ] Deduced a trap composed of 33 places in 567 ms of which 3 ms to minimize.
[2023-03-19 16:16:59] [INFO ] Deduced a trap composed of 41 places in 558 ms of which 2 ms to minimize.
[2023-03-19 16:17:00] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 1 ms to minimize.
[2023-03-19 16:17:00] [INFO ] Deduced a trap composed of 43 places in 340 ms of which 1 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 2 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 0 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 1 ms to minimize.
[2023-03-19 16:17:02] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2023-03-19 16:17:02] [INFO ] Deduced a trap composed of 44 places in 367 ms of which 1 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Deduced a trap composed of 34 places in 547 ms of which 1 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Deduced a trap composed of 30 places in 349 ms of which 1 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 30 places in 358 ms of which 2 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 1 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 1 ms to minimize.
[2023-03-19 16:17:05] [INFO ] Deduced a trap composed of 40 places in 522 ms of which 1 ms to minimize.
[2023-03-19 16:17:05] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 1 ms to minimize.
[2023-03-19 16:17:06] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:17:06] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 2 ms to minimize.
[2023-03-19 16:17:06] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 1 ms to minimize.
[2023-03-19 16:17:07] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 1 ms to minimize.
[2023-03-19 16:17:07] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 1 ms to minimize.
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 1 ms to minimize.
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 0 ms to minimize.
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 0 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 5 ms to minimize.
[2023-03-19 16:17:10] [INFO ] Deduced a trap composed of 41 places in 430 ms of which 1 ms to minimize.
[2023-03-19 16:17:10] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 1 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 1 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 1 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 1 ms to minimize.
[2023-03-19 16:17:12] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 0 ms to minimize.
[2023-03-19 16:17:12] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 0 ms to minimize.
[2023-03-19 16:17:12] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 1 ms to minimize.
[2023-03-19 16:17:13] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2023-03-19 16:17:13] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 1 ms to minimize.
[2023-03-19 16:17:13] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 1 ms to minimize.
[2023-03-19 16:17:14] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 1 ms to minimize.
[2023-03-19 16:17:14] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 0 ms to minimize.
[2023-03-19 16:17:14] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 1 ms to minimize.
[2023-03-19 16:17:14] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 19137 ms
[2023-03-19 16:17:15] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 1 ms to minimize.
[2023-03-19 16:17:15] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 2 ms to minimize.
[2023-03-19 16:17:16] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:17:16] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 0 ms to minimize.
[2023-03-19 16:17:16] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 0 ms to minimize.
[2023-03-19 16:17:17] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 1 ms to minimize.
[2023-03-19 16:17:17] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 4 ms to minimize.
[2023-03-19 16:17:17] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 1 ms to minimize.
[2023-03-19 16:17:18] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 3 ms to minimize.
[2023-03-19 16:17:18] [INFO ] Deduced a trap composed of 25 places in 391 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-19 16:17:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:17:18] [INFO ] After 25306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 655 ms.
Support contains 115 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1203 transition count 1257
Reduce places removed 96 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 101 rules applied. Total rules applied 197 place count 1107 transition count 1252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 202 place count 1102 transition count 1252
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 202 place count 1102 transition count 1106
Deduced a syphon composed of 146 places in 2 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 494 place count 956 transition count 1106
Discarding 177 places :
Symmetric choice reduction at 3 with 177 rule applications. Total rules 671 place count 779 transition count 929
Iterating global reduction 3 with 177 rules applied. Total rules applied 848 place count 779 transition count 929
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 848 place count 779 transition count 872
Deduced a syphon composed of 57 places in 15 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 962 place count 722 transition count 872
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1360 place count 523 transition count 673
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 1413 place count 523 transition count 673
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1414 place count 522 transition count 672
Applied a total of 1414 rules in 475 ms. Remains 522 /1203 variables (removed 681) and now considering 672/1353 (removed 681) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 522/1203 places, 672/1353 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 672 rows 522 cols
[2023-03-19 16:17:20] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:17:20] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 16:17:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:17:21] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 16:17:21] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:17:22] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1915 ms
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:17:23] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-19 16:17:24] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 3 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2023-03-19 16:17:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2131 ms
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 661 ms
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:17:26] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:17:27] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:17:27] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:17:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 593 ms
[2023-03-19 16:17:27] [INFO ] After 6332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-19 16:17:27] [INFO ] After 6914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 50 ms.
Support contains 112 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 672/672 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 522 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 521 transition count 671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 521 transition count 670
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 520 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 519 transition count 669
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 519 transition count 669
Applied a total of 6 rules in 81 ms. Remains 519 /522 variables (removed 3) and now considering 669/672 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 519/522 places, 669/672 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 669 rows 519 cols
[2023-03-19 16:17:28] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 16:17:28] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:17:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-19 16:17:29] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:17:29] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:17:29] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-19 16:17:29] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:17:29] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:17:30] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:17:30] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:17:30] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:17:30] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1343 ms
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:17:31] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:17:33] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:17:33] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2193 ms
[2023-03-19 16:17:33] [INFO ] After 4389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-19 16:17:33] [INFO ] After 4877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 101 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 669/669 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 512 transition count 662
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 511 transition count 661
Applied a total of 15 rules in 80 ms. Remains 511 /519 variables (removed 8) and now considering 661/669 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 511/519 places, 661/669 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 295273 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295273 steps, saw 65570 distinct states, run finished after 3003 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 661 rows 511 cols
[2023-03-19 16:17:36] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:17:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:17:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-19 16:17:37] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:17:37] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2023-03-19 16:17:37] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-19 16:17:38] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1813 ms
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:17:39] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:17:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1389 ms
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:17:41] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:17:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1048 ms
[2023-03-19 16:17:42] [INFO ] After 4954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 352 ms.
[2023-03-19 16:17:42] [INFO ] After 5437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 55 ms.
Support contains 101 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 661/661 transitions.
Applied a total of 0 rules in 26 ms. Remains 511 /511 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 511/511 places, 661/661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 661/661 transitions.
Applied a total of 0 rules in 18 ms. Remains 511 /511 variables (removed 0) and now considering 661/661 (removed 0) transitions.
[2023-03-19 16:17:42] [INFO ] Invariant cache hit.
[2023-03-19 16:17:42] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-19 16:17:42] [INFO ] Invariant cache hit.
[2023-03-19 16:17:43] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-19 16:17:43] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-19 16:17:43] [INFO ] Invariant cache hit.
[2023-03-19 16:17:43] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 511/511 places, 661/661 transitions.
Applied a total of 0 rules in 14 ms. Remains 511 /511 variables (removed 0) and now considering 661/661 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-19 16:17:43] [INFO ] Invariant cache hit.
[2023-03-19 16:17:43] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:17:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-19 16:17:44] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:17:44] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-19 16:17:44] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:17:44] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:17:44] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:17:45] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:17:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:17:47] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2638 ms
[2023-03-19 16:17:47] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:17:47] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2023-03-19 16:17:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-19 16:17:47] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-19 16:17:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 562 ms
[2023-03-19 16:17:47] [INFO ] After 3926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-19 16:17:48] [INFO ] After 4350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 16:17:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-19 16:17:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 511 places, 661 transitions and 2971 arcs took 8 ms.
[2023-03-19 16:17:48] [INFO ] Flatten gal took : 113 ms
Total runtime 56549 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
ReachabilityFireability

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679242669460

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 3 ShieldRVs-PT-030B-ReachabilityFireability-10
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 3 ShieldRVs-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 3 ShieldRVs-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SRCH) for 3 ShieldRVs-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 9 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 68
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 10 (type EQUN) for ShieldRVs-PT-030B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 12 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 13 (type EXCL) for ShieldRVs-PT-030B-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 19 (type EXCL) for 6 ShieldRVs-PT-030B-ReachabilityFireability-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 6 ShieldRVs-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 6 ShieldRVs-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 6 ShieldRVs-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 18 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-12
lola: result : true
lola: markings : 125
lola: fired transitions : 124
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 16 (type EQUN) for ShieldRVs-PT-030B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 19 (type EXCL) for ShieldRVs-PT-030B-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 25 (type EXCL) for 0 ShieldRVs-PT-030B-ReachabilityFireability-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 0 ShieldRVs-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 0 ShieldRVs-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 24 (type SRCH) for 0 ShieldRVs-PT-030B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-12
lola: result : unknown
lola: fired transitions : 239
lola: tried executions : 22
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/367/ReachabilityFireability-10.sara.
lola: FINISHED task # 21 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 111
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ShieldRVs-PT-030B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldRVs-PT-030B-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-ReachabilityFireability-08: EF true findpath
ShieldRVs-PT-030B-ReachabilityFireability-10: EF true findpath
ShieldRVs-PT-030B-ReachabilityFireability-12: EF true tandem / insertion


Time elapsed: 1 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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVs-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 r423-tajo-167905976300127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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