Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717016072074

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 20:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:54:34] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-29 20:54:34] [INFO ] Transformed 2503 places.
[2024-05-29 20:54:34] [INFO ] Transformed 2503 transitions.
[2024-05-29 20:54:34] [INFO ] Found NUPN structural information;
[2024-05-29 20:54:34] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 16) seen :7
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-29 20:54:35] [INFO ] Computed 201 invariants in 37 ms
[2024-05-29 20:54:36] [INFO ] [Real]Absence check using 201 positive place invariants in 81 ms returned sat
[2024-05-29 20:54:36] [INFO ] After 1160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 20:54:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 83 ms returned sat
[2024-05-29 20:54:46] [INFO ] After 9315ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-29 20:54:47] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 15 ms to minimize.
[2024-05-29 20:54:48] [INFO ] Deduced a trap composed of 47 places in 698 ms of which 1 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 42 places in 692 ms of which 2 ms to minimize.
[2024-05-29 20:54:49] [INFO ] Deduced a trap composed of 39 places in 638 ms of which 2 ms to minimize.
[2024-05-29 20:54:50] [INFO ] Deduced a trap composed of 41 places in 635 ms of which 1 ms to minimize.
[2024-05-29 20:54:51] [INFO ] Deduced a trap composed of 22 places in 578 ms of which 1 ms to minimize.
[2024-05-29 20:54:51] [INFO ] Deduced a trap composed of 32 places in 566 ms of which 2 ms to minimize.
[2024-05-29 20:54:52] [INFO ] Deduced a trap composed of 62 places in 517 ms of which 1 ms to minimize.
[2024-05-29 20:54:53] [INFO ] Deduced a trap composed of 28 places in 533 ms of which 1 ms to minimize.
[2024-05-29 20:54:53] [INFO ] Deduced a trap composed of 30 places in 528 ms of which 1 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 45 places in 533 ms of which 2 ms to minimize.
[2024-05-29 20:54:54] [INFO ] Deduced a trap composed of 38 places in 497 ms of which 1 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 45 places in 476 ms of which 2 ms to minimize.
[2024-05-29 20:54:55] [INFO ] Deduced a trap composed of 38 places in 471 ms of which 1 ms to minimize.
[2024-05-29 20:54:56] [INFO ] Deduced a trap composed of 43 places in 461 ms of which 1 ms to minimize.
[2024-05-29 20:54:56] [INFO ] Deduced a trap composed of 30 places in 455 ms of which 3 ms to minimize.
[2024-05-29 20:54:57] [INFO ] Deduced a trap composed of 45 places in 466 ms of which 1 ms to minimize.
[2024-05-29 20:54:58] [INFO ] Deduced a trap composed of 35 places in 462 ms of which 2 ms to minimize.
[2024-05-29 20:54:58] [INFO ] Deduced a trap composed of 42 places in 452 ms of which 1 ms to minimize.
[2024-05-29 20:54:59] [INFO ] Deduced a trap composed of 47 places in 416 ms of which 2 ms to minimize.
[2024-05-29 20:54:59] [INFO ] Deduced a trap composed of 66 places in 452 ms of which 1 ms to minimize.
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 50 places in 456 ms of which 2 ms to minimize.
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 7 ms to minimize.
[2024-05-29 20:55:01] [INFO ] Deduced a trap composed of 73 places in 398 ms of which 1 ms to minimize.
[2024-05-29 20:55:01] [INFO ] Deduced a trap composed of 66 places in 380 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 20:55:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:55:01] [INFO ] After 25310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 629 ms.
Support contains 140 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 664 place count 2503 transition count 1839
Reduce places removed 664 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 666 rules applied. Total rules applied 1330 place count 1839 transition count 1837
Reduce places removed 1 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 2 with 49 rules applied. Total rules applied 1379 place count 1838 transition count 1789
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1427 place count 1790 transition count 1789
Performed 212 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 212 Pre rules applied. Total rules applied 1427 place count 1790 transition count 1577
Deduced a syphon composed of 212 places in 4 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 4 with 424 rules applied. Total rules applied 1851 place count 1578 transition count 1577
Discarding 314 places :
Symmetric choice reduction at 4 with 314 rule applications. Total rules 2165 place count 1264 transition count 1263
Iterating global reduction 4 with 314 rules applied. Total rules applied 2479 place count 1264 transition count 1263
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 112 Pre rules applied. Total rules applied 2479 place count 1264 transition count 1151
Deduced a syphon composed of 112 places in 5 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 2703 place count 1152 transition count 1151
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 419
Deduced a syphon composed of 419 places in 3 ms
Reduce places removed 419 places and 0 transitions.
Iterating global reduction 4 with 838 rules applied. Total rules applied 3541 place count 733 transition count 732
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3743 place count 632 transition count 799
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 3789 place count 609 transition count 818
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 3796 place count 609 transition count 811
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 3803 place count 602 transition count 811
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 3809 place count 602 transition count 805
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 3811 place count 602 transition count 805
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3812 place count 601 transition count 804
Applied a total of 3812 rules in 610 ms. Remains 601 /2503 variables (removed 1902) and now considering 804/2503 (removed 1699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 601/2503 places, 804/2503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :1
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) 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
Running SMT prover for 6 properties.
// Phase 1: matrix 804 rows 601 cols
[2024-05-29 20:55:03] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 20:55:03] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2024-05-29 20:55:03] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:55:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2024-05-29 20:55:04] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:55:04] [INFO ] State equation strengthened by 320 read => feed constraints.
[2024-05-29 20:55:05] [INFO ] After 850ms SMT Verify possible using 320 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:55:06] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:55:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2024-05-29 20:55:06] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-29 20:55:06] [INFO ] After 2388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1373 ms.
[2024-05-29 20:55:08] [INFO ] After 4530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 45 ms.
Support contains 132 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 804/804 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 601 transition count 803
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 600 transition count 803
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 593 transition count 796
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 590 transition count 796
Applied a total of 22 rules in 35 ms. Remains 590 /601 variables (removed 11) and now considering 796/804 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 590/601 places, 796/804 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 167576 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 167576 steps, saw 107560 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :2
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 796 rows 590 cols
[2024-05-29 20:55:11] [INFO ] Computed 201 invariants in 5 ms
[2024-05-29 20:55:11] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2024-05-29 20:55:12] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:55:12] [INFO ] [Nat]Absence check using 201 positive place invariants in 38 ms returned sat
[2024-05-29 20:55:12] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:12] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-05-29 20:55:13] [INFO ] After 810ms SMT Verify possible using 326 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:13] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:55:13] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:55:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:55:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2024-05-29 20:55:14] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:55:14] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:55:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2024-05-29 20:55:14] [INFO ] After 2037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 846 ms.
[2024-05-29 20:55:15] [INFO ] After 3615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 107 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 796/796 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 590 transition count 792
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 586 transition count 791
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 585 transition count 791
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 585 transition count 785
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 579 transition count 785
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 577 transition count 783
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 577 transition count 783
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 56 place count 562 transition count 768
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 556 transition count 771
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 556 transition count 770
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 554 transition count 768
Applied a total of 71 rules in 70 ms. Remains 554 /590 variables (removed 36) and now considering 768/796 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 554/590 places, 768/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 172330 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172330 steps, saw 111476 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 768 rows 554 cols
[2024-05-29 20:55:19] [INFO ] Computed 201 invariants in 6 ms
[2024-05-29 20:55:19] [INFO ] [Real]Absence check using 201 positive place invariants in 40 ms returned sat
[2024-05-29 20:55:19] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:55:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2024-05-29 20:55:19] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:19] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-29 20:55:20] [INFO ] After 499ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-29 20:55:20] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-29 20:55:21] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:55:21] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:55:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2024-05-29 20:55:21] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-29 20:55:21] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 370 ms.
[2024-05-29 20:55:21] [INFO ] After 2540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 47 ms.
Support contains 107 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 768/768 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 554/554 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 768/768 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-29 20:55:21] [INFO ] Invariant cache hit.
[2024-05-29 20:55:22] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 20:55:22] [INFO ] Invariant cache hit.
[2024-05-29 20:55:22] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-29 20:55:23] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
[2024-05-29 20:55:23] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-29 20:55:23] [INFO ] Invariant cache hit.
[2024-05-29 20:55:23] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2058 ms. Remains : 554/554 places, 768/768 transitions.
Graph (trivial) has 115 edges and 554 vertex of which 2 / 554 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1774 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 115 edges and 551 vertex of which 4 / 551 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 549 transition count 763
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 113 edges and 546 vertex of which 2 / 546 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 545 transition count 756
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 112 edges and 544 vertex of which 2 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 543 transition count 751
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.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 542 transition count 748
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 542 transition count 747
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 540 transition count 747
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 80 place count 540 transition count 699
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 106 place count 540 transition count 699
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 118 place count 540 transition count 687
Applied a total of 118 rules in 86 ms. Remains 540 /554 variables (removed 14) and now considering 687/768 (removed 81) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 687 rows 540 cols
[2024-05-29 20:55:24] [INFO ] Computed 194 invariants in 6 ms
[2024-05-29 20:55:24] [INFO ] [Real]Absence check using 194 positive place invariants in 28 ms returned sat
[2024-05-29 20:55:24] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:55:24] [INFO ] [Nat]Absence check using 194 positive place invariants in 28 ms returned sat
[2024-05-29 20:55:24] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:55:24] [INFO ] After 217ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-29 20:55:25] [INFO ] After 826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2024-05-29 20:55:25] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:55:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 20:55:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 768 transitions and 3745 arcs took 9 ms.
[2024-05-29 20:55:26] [INFO ] Flatten gal took : 96 ms
Total runtime 52383 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

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

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

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

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

BK_STOP 1717016127938

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 17 (type EXCL) for 3 ShieldRVt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldRVt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldRVt-PT-050B-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldRVt-PT-050B-ReachabilityFireability-2024-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: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: FINISHED task # 16 (type SRCH) for ShieldRVt-PT-050B-ReachabilityFireability-2024-03
lola: result : true
lola: markings : 29
lola: fired transitions : 28
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldRVt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldRVt-PT-050B-ReachabilityFireability-2024-03 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 0 ShieldRVt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 6 ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 6 ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type SRCH) for 6 ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 27
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 22 (type SRCH) for ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 348
lola: fired transitions : 351
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 20 (type EQUN) for ShieldRVt-PT-050B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 32 (type FNDP) for 9 ShieldRVt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 9 ShieldRVt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 9 ShieldRVt-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 239
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 20 (type EQUN) for ShieldRVt-PT-050B-ReachabilityFireability-2024-12
lola: result : unknown
lola: FINISHED task # 35 (type SRCH) for ShieldRVt-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 72
lola: fired transitions : 71
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 32 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 33 (type EQUN) for ShieldRVt-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 25 (type FNDP) for 0 ShieldRVt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 0 ShieldRVt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 28 (type SRCH) for 0 ShieldRVt-PT-050B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 32 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 70
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 28 (type SRCH) for ShieldRVt-PT-050B-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 52
lola: fired transitions : 51
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldRVt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldRVt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldRVt-PT-050B-ReachabilityFireability-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-050B-ReachabilityFireability-2024-01: EF true tandem / insertion
ShieldRVt-PT-050B-ReachabilityFireability-2024-03: AG false tandem / insertion
ShieldRVt-PT-050B-ReachabilityFireability-2024-12: EF true tandem / insertion
ShieldRVt-PT-050B-ReachabilityFireability-2024-14: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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