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-167905976500302.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 ShieldRVt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 364K 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 ShieldRVt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679245781894

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=ReachabilityCardinality
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 202303021504
[2023-03-19 17:09:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:09:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:09:43] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-19 17:09:43] [INFO ] Transformed 1503 places.
[2023-03-19 17:09:43] [INFO ] Transformed 1503 transitions.
[2023-03-19 17:09:43] [INFO ] Found NUPN structural information;
[2023-03-19 17:09:43] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 15) seen :9
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-19 17:09:44] [INFO ] Computed 121 place invariants in 25 ms
[2023-03-19 17:09:44] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:09:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-19 17:09:46] [INFO ] After 1801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:09:47] [INFO ] Deduced a trap composed of 43 places in 391 ms of which 8 ms to minimize.
[2023-03-19 17:09:47] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 1 ms to minimize.
[2023-03-19 17:09:48] [INFO ] Deduced a trap composed of 40 places in 354 ms of which 7 ms to minimize.
[2023-03-19 17:09:48] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 2 ms to minimize.
[2023-03-19 17:09:49] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 2 ms to minimize.
[2023-03-19 17:09:49] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2023-03-19 17:09:49] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 1 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2023-03-19 17:09:50] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 0 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 1 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 1 ms to minimize.
[2023-03-19 17:09:51] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 61 places in 284 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2023-03-19 17:09:52] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 1 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 1 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 1 ms to minimize.
[2023-03-19 17:09:53] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 1 ms to minimize.
[2023-03-19 17:09:54] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 1 ms to minimize.
[2023-03-19 17:09:54] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 1 ms to minimize.
[2023-03-19 17:09:54] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 1 ms to minimize.
[2023-03-19 17:09:54] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 1 ms to minimize.
[2023-03-19 17:09:55] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 1 ms to minimize.
[2023-03-19 17:09:55] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 0 ms to minimize.
[2023-03-19 17:09:55] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 1 ms to minimize.
[2023-03-19 17:09:55] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8809 ms
[2023-03-19 17:09:56] [INFO ] Deduced a trap composed of 50 places in 420 ms of which 1 ms to minimize.
[2023-03-19 17:09:56] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 1 ms to minimize.
[2023-03-19 17:09:57] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 1 ms to minimize.
[2023-03-19 17:09:57] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2023-03-19 17:09:58] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 1 ms to minimize.
[2023-03-19 17:09:58] [INFO ] Deduced a trap composed of 46 places in 383 ms of which 4 ms to minimize.
[2023-03-19 17:09:58] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 1 ms to minimize.
[2023-03-19 17:09:59] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 1 ms to minimize.
[2023-03-19 17:09:59] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 0 ms to minimize.
[2023-03-19 17:09:59] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2023-03-19 17:10:00] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 0 ms to minimize.
[2023-03-19 17:10:00] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2023-03-19 17:10:00] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 1 ms to minimize.
[2023-03-19 17:10:00] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 0 ms to minimize.
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 1 ms to minimize.
[2023-03-19 17:10:01] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 1 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 1 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6495 ms
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 0 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 0 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3075 ms
[2023-03-19 17:10:07] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 3 ms to minimize.
[2023-03-19 17:10:07] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 1 ms to minimize.
[2023-03-19 17:10:08] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:10:08] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 1 ms to minimize.
[2023-03-19 17:10:09] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 1 ms to minimize.
[2023-03-19 17:10:09] [INFO ] Deduced a trap composed of 24 places in 373 ms of which 1 ms to minimize.
[2023-03-19 17:10:09] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 2793 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 17:10:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:10:09] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 328 ms.
Support contains 41 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 451 rules applied. Total rules applied 451 place count 1503 transition count 1052
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 453 rules applied. Total rules applied 904 place count 1052 transition count 1050
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 911 place count 1051 transition count 1044
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 917 place count 1045 transition count 1044
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 917 place count 1045 transition count 922
Deduced a syphon composed of 122 places in 2 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1161 place count 923 transition count 922
Discarding 198 places :
Symmetric choice reduction at 4 with 198 rule applications. Total rules 1359 place count 725 transition count 724
Iterating global reduction 4 with 198 rules applied. Total rules applied 1557 place count 725 transition count 724
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 1557 place count 725 transition count 644
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1717 place count 645 transition count 644
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 258
Deduced a syphon composed of 258 places in 4 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 4 with 516 rules applied. Total rules applied 2233 place count 387 transition count 386
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2401 place count 303 transition count 458
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2402 place count 303 transition count 457
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 2407 place count 303 transition count 452
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2412 place count 298 transition count 452
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2416 place count 298 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2417 place count 298 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2418 place count 297 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2419 place count 296 transition count 447
Applied a total of 2419 rules in 420 ms. Remains 296 /1503 variables (removed 1207) and now considering 447/1503 (removed 1056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 296/1503 places, 447/1503 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 447 rows 296 cols
[2023-03-19 17:10:10] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-19 17:10:10] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 17:10:11] [INFO ] [Nat]Absence check using 120 positive place invariants in 19 ms returned sat
[2023-03-19 17:10:11] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:11] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-19 17:10:11] [INFO ] After 191ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:11] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-19 17:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-19 17:10:11] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 4 ms to minimize.
[2023-03-19 17:10:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-19 17:10:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-19 17:10:11] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-19 17:10:12] [INFO ] After 1173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 69 ms.
Support contains 27 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 447/447 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 296 transition count 443
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 292 transition count 443
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 292 transition count 438
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 287 transition count 438
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 282 transition count 433
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 277 transition count 436
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 277 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 276 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 276 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 275 transition count 434
Applied a total of 42 rules in 80 ms. Remains 275 /296 variables (removed 21) and now considering 434/447 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 275/296 places, 434/447 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 205492 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205492 steps, saw 133660 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 434 rows 275 cols
[2023-03-19 17:10:15] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-19 17:10:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 17:10:15] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-19 17:10:16] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:16] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-19 17:10:16] [INFO ] After 336ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
[2023-03-19 17:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-19 17:10:16] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-19 17:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-19 17:10:16] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-19 17:10:17] [INFO ] After 1432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 62 ms.
Support contains 27 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 434/434 transitions.
Applied a total of 0 rules in 20 ms. Remains 275 /275 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 275/275 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 434/434 transitions.
Applied a total of 0 rules in 19 ms. Remains 275 /275 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2023-03-19 17:10:17] [INFO ] Invariant cache hit.
[2023-03-19 17:10:17] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-19 17:10:17] [INFO ] Invariant cache hit.
[2023-03-19 17:10:17] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-19 17:10:18] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-19 17:10:18] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 17:10:18] [INFO ] Invariant cache hit.
[2023-03-19 17:10:18] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1216 ms. Remains : 275/275 places, 434/434 transitions.
Graph (trivial) has 96 edges and 275 vertex of which 4 / 275 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 949 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 93 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 267 transition count 425
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 92 edges and 265 vertex of which 6 / 265 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 262 transition count 416
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 255 transition count 405
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 86 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 247 transition count 391
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 82 edges and 243 vertex of which 6 / 243 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 240 transition count 377
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 79 edges and 237 vertex of which 6 / 237 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 16 rules applied. Total rules applied 89 place count 234 transition count 365
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 77 edges and 231 vertex of which 6 / 231 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 15 rules applied. Total rules applied 104 place count 228 transition count 354
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 73 edges and 226 vertex of which 2 / 226 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 117 place count 225 transition count 344
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 72 edges and 224 vertex of which 2 / 224 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 122 place count 223 transition count 341
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 761 edges and 222 vertex of which 219 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 9 with 6 rules applied. Total rules applied 128 place count 219 transition count 334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 128 place count 219 transition count 332
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 133 place count 216 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 136 place count 214 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 139 place count 214 transition count 328
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 148 place count 214 transition count 319
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 165 place count 214 transition count 319
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 178 place count 214 transition count 306
Applied a total of 178 rules in 92 ms. Remains 214 /275 variables (removed 61) and now considering 306/434 (removed 128) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 306 rows 214 cols
[2023-03-19 17:10:18] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-19 17:10:18] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 17:10:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-19 17:10:19] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:19] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2023-03-19 17:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-19 17:10:19] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-19 17:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-19 17:10:19] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-19 17:10:19] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-19 17:10:19] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-19 17:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 275 places, 434 transitions and 2369 arcs took 4 ms.
[2023-03-19 17:10:19] [INFO ] Flatten gal took : 94 ms
Total runtime 36280 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-030B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
ReachabilityCardinality

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

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679245820137

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
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: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: LAUNCH task # 20 (type EXCL) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-03
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-03
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: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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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 # 19 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-03
lola: result : true
lola: markings : 22
lola: fired transitions : 21
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldRVt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 33 (type EXCL) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-05
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 6 ShieldRVt-PT-030B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 6 ShieldRVt-PT-030B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 6 ShieldRVt-PT-030B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-06
lola: result : true
lola: markings : 44
lola: fired transitions : 43
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 22 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 23 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-06 (obsolete)
lola: LAUNCH task # 35 (type FNDP) for 12 ShieldRVt-PT-030B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 36 (type EQUN) for 12 ShieldRVt-PT-030B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 38 (type SRCH) for 12 ShieldRVt-PT-030B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 20
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-06
lola: result : true
lola: fired transitions : 42
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 38 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-14
lola: result : true
lola: markings : 54
lola: fired transitions : 53
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 35 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 36 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 41 (type FNDP) for 9 ShieldRVt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type EQUN) for 9 ShieldRVt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 44 (type SRCH) for 9 ShieldRVt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 35 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-14
lola: result : unknown
lola: fired transitions : 6978
lola: tried executions : 943
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 44 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-07
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 41 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 42 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 29 (type FNDP) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type EQUN) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-05
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: LAUNCH task # 32 (type SRCH) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 41 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-07
lola: result : unknown
lola: fired transitions : 1591
lola: tried executions : 532
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/368/ReachabilityCardinality-17.sara.
sara: try reading problem file /home/mcc/execution/368/ReachabilityCardinality-23.sara.
sara: try reading problem file /home/mcc/execution/368/ReachabilityCardinality-36.sara.
lola: FINISHED task # 29 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 30
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 32 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-05
lola: result : true
lola: markings : 32
lola: fired transitions : 31
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 30 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 33 (type EXCL) for ShieldRVt-PT-030B-ReachabilityCardinality-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-ReachabilityCardinality-03: AG false tandem / insertion
ShieldRVt-PT-030B-ReachabilityCardinality-05: AG false findpath
ShieldRVt-PT-030B-ReachabilityCardinality-06: EF true tandem / insertion
ShieldRVt-PT-030B-ReachabilityCardinality-07: EF false tandem / insertion
ShieldRVt-PT-030B-ReachabilityCardinality-14: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 3

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="ReachabilityCardinality"
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 ShieldRVt-PT-030B, examination is ReachabilityCardinality"
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-167905976500302"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;