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-171683789700619.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-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789700619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 239K 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-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717014859337

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:34:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:34:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:34:21] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-29 20:34:21] [INFO ] Transformed 1003 places.
[2024-05-29 20:34:21] [INFO ] Transformed 1003 transitions.
[2024-05-29 20:34:21] [INFO ] Found NUPN structural information;
[2024-05-29 20:34:21] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 15) seen :8
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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 :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 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2024-05-29 20:34:22] [INFO ] Computed 81 invariants in 20 ms
[2024-05-29 20:34:22] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 20:34:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 30 ms returned sat
[2024-05-29 20:34:24] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 20:34:25] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 7 ms to minimize.
[2024-05-29 20:34:25] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:34:25] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:34:26] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2024-05-29 20:34:26] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:34:26] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:34:26] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:34:26] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:34:27] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:34:28] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4087 ms
[2024-05-29 20:34:29] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:34:29] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:34:29] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:34:30] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:34:31] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 0 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:34:32] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:34:33] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 0 ms to minimize.
[2024-05-29 20:34:34] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2024-05-29 20:34:34] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 1 ms to minimize.
[2024-05-29 20:34:34] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:34:34] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:34:35] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:34:35] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:34:35] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 1 ms to minimize.
[2024-05-29 20:34:35] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:34:36] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:34:36] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:34:36] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-29 20:34:36] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:34:37] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:34:37] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:34:37] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:34:37] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:34:38] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2024-05-29 20:34:38] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:34:38] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:34:38] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:34:39] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:34:39] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 1 ms to minimize.
[2024-05-29 20:34:39] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 0 ms to minimize.
[2024-05-29 20:34:39] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:34:39] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:34:40] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 2 ms to minimize.
[2024-05-29 20:34:40] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:34:40] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 0 ms to minimize.
[2024-05-29 20:34:41] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 2 ms to minimize.
[2024-05-29 20:34:41] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:34:41] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:34:41] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:34:42] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:34:42] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:34:42] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:34:42] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:34:42] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 0 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:34:43] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:34:44] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:34:44] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:34:44] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:34:44] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 15181 ms
[2024-05-29 20:34:44] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2024-05-29 20:34:44] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:34:45] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:34:45] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:34:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 658 ms
[2024-05-29 20:34:45] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:34:45] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:34:45] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:34:46] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:34:46] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:34:46] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:34:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1413 ms
[2024-05-29 20:34:47] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 0 ms to minimize.
[2024-05-29 20:34:47] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:34:47] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2024-05-29 20:34:47] [INFO ] Deduced a trap composed of 27 places in 224 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:34:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:34:47] [INFO ] After 25252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 193 ms.
Support contains 98 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 253 place count 1003 transition count 750
Reduce places removed 253 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 255 rules applied. Total rules applied 508 place count 750 transition count 748
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 20 rules applied. Total rules applied 528 place count 749 transition count 729
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 547 place count 730 transition count 729
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 547 place count 730 transition count 652
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 701 place count 653 transition count 652
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 804 place count 550 transition count 549
Iterating global reduction 4 with 103 rules applied. Total rules applied 907 place count 550 transition count 549
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 907 place count 550 transition count 512
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 981 place count 513 transition count 512
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 1 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 4 with 324 rules applied. Total rules applied 1305 place count 351 transition count 350
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1385 place count 311 transition count 374
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1393 place count 311 transition count 366
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1401 place count 303 transition count 366
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1404 place count 303 transition count 363
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1405 place count 303 transition count 363
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1406 place count 303 transition count 362
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1408 place count 303 transition count 362
Applied a total of 1408 rules in 205 ms. Remains 303 /1003 variables (removed 700) and now considering 362/1003 (removed 641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 303/1003 places, 362/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) 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 5) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 362 rows 303 cols
[2024-05-29 20:34:48] [INFO ] Computed 81 invariants in 20 ms
[2024-05-29 20:34:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:34:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2024-05-29 20:34:48] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:34:49] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-29 20:34:49] [INFO ] After 156ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 487 ms
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-29 20:34:49] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:34:50] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:34:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-29 20:34:50] [INFO ] After 1050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-29 20:34:50] [INFO ] After 1452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 66 ms.
Support contains 58 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 362/362 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 303 transition count 346
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 287 transition count 344
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 285 transition count 344
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 285 transition count 338
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 48 place count 279 transition count 338
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 276 transition count 335
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 276 transition count 335
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 102 place count 252 transition count 311
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 114 place count 246 transition count 315
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 246 transition count 314
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 246 transition count 314
Applied a total of 117 rules in 47 ms. Remains 246 /303 variables (removed 57) and now considering 314/362 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 246/303 places, 314/362 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 441708 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{0=1}
Probabilistic random walk after 441708 steps, saw 316527 distinct states, run finished after 3002 ms. (steps per millisecond=147 ) properties seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 314 rows 246 cols
[2024-05-29 20:34:53] [INFO ] Computed 81 invariants in 6 ms
[2024-05-29 20:34:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:34:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 13 ms returned sat
[2024-05-29 20:34:53] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:53] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-29 20:34:53] [INFO ] After 73ms SMT Verify possible using 125 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:53] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:34:54] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:34:54] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:34:54] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:34:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2024-05-29 20:34:54] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-29 20:34:54] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 20:34:54] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 14 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 314/314 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 246 transition count 304
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 236 transition count 304
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 20 place count 236 transition count 291
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 223 transition count 291
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 221 transition count 289
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 221 transition count 289
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 197 transition count 265
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 118 place count 187 transition count 276
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 187 transition count 275
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 187 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 186 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 185 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 184 transition count 273
Applied a total of 123 rules in 39 ms. Remains 184 /246 variables (removed 62) and now considering 273/314 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 184/246 places, 273/314 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 433595 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 433595 steps, saw 296056 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 184 cols
[2024-05-29 20:34:57] [INFO ] Computed 80 invariants in 4 ms
[2024-05-29 20:34:57] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:34:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2024-05-29 20:34:57] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-29 20:34:57] [INFO ] After 42ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:57] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 20:34:57] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-29 20:34:58] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 14 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 184/184 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-29 20:34:58] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-29 20:34:58] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-29 20:34:58] [INFO ] Invariant cache hit.
[2024-05-29 20:34:58] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 184/184 places, 273/273 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 271
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 184 transition count 271
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 184 transition count 265
Applied a total of 16 rules in 17 ms. Remains 184 /184 variables (removed 0) and now considering 265/273 (removed 8) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 265 rows 184 cols
[2024-05-29 20:34:58] [INFO ] Computed 80 invariants in 2 ms
[2024-05-29 20:34:58] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:34:58] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2024-05-29 20:34:58] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:34:58] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-29 20:34:58] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-29 20:34:58] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-29 20:34:58] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:34:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-05-29 20:34:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 273 transitions and 1446 arcs took 3 ms.
[2024-05-29 20:34:59] [INFO ] Flatten gal took : 56 ms
Total runtime 38113 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/361
ReachabilityCardinality

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

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

BK_STOP 1717014900298

--------------------
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 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/361/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/361/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/361/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 9 (type SRCH) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-07
lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-05
lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldRVt-PT-020B-ReachabilityCardinality-2024-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-020B-ReachabilityCardinality-2024-05: EF false tandem / insertion
ShieldRVt-PT-020B-ReachabilityCardinality-2024-07: EF 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-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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-020B, 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 r373-tall-171683789700619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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