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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 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 489K 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-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717015628361

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-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:47:10] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-29 20:47:10] [INFO ] Transformed 2003 places.
[2024-05-29 20:47:10] [INFO ] Transformed 2003 transitions.
[2024-05-29 20:47:10] [INFO ] Found NUPN structural information;
[2024-05-29 20:47:10] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 12) seen :6
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2024-05-29 20:47:11] [INFO ] Computed 161 invariants in 38 ms
[2024-05-29 20:47:12] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2024-05-29 20:47:12] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:47:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2024-05-29 20:47:15] [INFO ] After 2123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:47:16] [INFO ] Deduced a trap composed of 43 places in 577 ms of which 16 ms to minimize.
[2024-05-29 20:47:16] [INFO ] Deduced a trap composed of 35 places in 562 ms of which 1 ms to minimize.
[2024-05-29 20:47:17] [INFO ] Deduced a trap composed of 28 places in 582 ms of which 2 ms to minimize.
[2024-05-29 20:47:18] [INFO ] Deduced a trap composed of 61 places in 573 ms of which 2 ms to minimize.
[2024-05-29 20:47:18] [INFO ] Deduced a trap composed of 24 places in 542 ms of which 1 ms to minimize.
[2024-05-29 20:47:19] [INFO ] Deduced a trap composed of 28 places in 543 ms of which 1 ms to minimize.
[2024-05-29 20:47:19] [INFO ] Deduced a trap composed of 44 places in 518 ms of which 2 ms to minimize.
[2024-05-29 20:47:20] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 2 ms to minimize.
[2024-05-29 20:47:20] [INFO ] Deduced a trap composed of 33 places in 494 ms of which 1 ms to minimize.
[2024-05-29 20:47:21] [INFO ] Deduced a trap composed of 39 places in 494 ms of which 1 ms to minimize.
[2024-05-29 20:47:22] [INFO ] Deduced a trap composed of 49 places in 509 ms of which 1 ms to minimize.
[2024-05-29 20:47:22] [INFO ] Deduced a trap composed of 40 places in 480 ms of which 1 ms to minimize.
[2024-05-29 20:47:23] [INFO ] Deduced a trap composed of 51 places in 457 ms of which 2 ms to minimize.
[2024-05-29 20:47:23] [INFO ] Deduced a trap composed of 34 places in 451 ms of which 1 ms to minimize.
[2024-05-29 20:47:24] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 2 ms to minimize.
[2024-05-29 20:47:24] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 1 ms to minimize.
[2024-05-29 20:47:25] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 1 ms to minimize.
[2024-05-29 20:47:25] [INFO ] Deduced a trap composed of 37 places in 421 ms of which 1 ms to minimize.
[2024-05-29 20:47:26] [INFO ] Deduced a trap composed of 25 places in 408 ms of which 1 ms to minimize.
[2024-05-29 20:47:26] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 1 ms to minimize.
[2024-05-29 20:47:27] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 1 ms to minimize.
[2024-05-29 20:47:27] [INFO ] Deduced a trap composed of 46 places in 369 ms of which 2 ms to minimize.
[2024-05-29 20:47:28] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 1 ms to minimize.
[2024-05-29 20:47:28] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 1 ms to minimize.
[2024-05-29 20:47:28] [INFO ] Deduced a trap composed of 43 places in 356 ms of which 0 ms to minimize.
[2024-05-29 20:47:29] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 1 ms to minimize.
[2024-05-29 20:47:29] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 1 ms to minimize.
[2024-05-29 20:47:30] [INFO ] Deduced a trap composed of 46 places in 342 ms of which 1 ms to minimize.
[2024-05-29 20:47:30] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 1 ms to minimize.
[2024-05-29 20:47:30] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 1 ms to minimize.
[2024-05-29 20:47:31] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:47:31] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 1 ms to minimize.
[2024-05-29 20:47:32] [INFO ] Deduced a trap composed of 40 places in 315 ms of which 0 ms to minimize.
[2024-05-29 20:47:32] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:47:32] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 1 ms to minimize.
[2024-05-29 20:47:32] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 17359 ms
[2024-05-29 20:47:33] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 1 ms to minimize.
[2024-05-29 20:47:34] [INFO ] Deduced a trap composed of 28 places in 493 ms of which 1 ms to minimize.
[2024-05-29 20:47:34] [INFO ] Deduced a trap composed of 33 places in 436 ms of which 1 ms to minimize.
[2024-05-29 20:47:35] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2024-05-29 20:47:35] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 2 ms to minimize.
[2024-05-29 20:47:36] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 1 ms to minimize.
[2024-05-29 20:47:36] [INFO ] Deduced a trap composed of 35 places in 406 ms of which 1 ms to minimize.
[2024-05-29 20:47:37] [INFO ] Deduced a trap composed of 41 places in 395 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:47:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:47:37] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 250 ms.
Support contains 47 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 608 transitions
Trivial Post-agglo rules discarded 608 transitions
Performed 608 trivial Post agglomeration. Transition count delta: 608
Iterating post reduction 0 with 608 rules applied. Total rules applied 608 place count 2003 transition count 1395
Reduce places removed 608 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 610 rules applied. Total rules applied 1218 place count 1395 transition count 1393
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 1228 place count 1394 transition count 1384
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1237 place count 1385 transition count 1384
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 160 Pre rules applied. Total rules applied 1237 place count 1385 transition count 1224
Deduced a syphon composed of 160 places in 4 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 1557 place count 1225 transition count 1224
Discarding 262 places :
Symmetric choice reduction at 4 with 262 rule applications. Total rules 1819 place count 963 transition count 962
Iterating global reduction 4 with 262 rules applied. Total rules applied 2081 place count 963 transition count 962
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 2081 place count 963 transition count 858
Deduced a syphon composed of 104 places in 5 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 2289 place count 859 transition count 858
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 1 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 722 rules applied. Total rules applied 3011 place count 498 transition count 497
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3213 place count 397 transition count 579
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 3223 place count 392 transition count 583
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3224 place count 392 transition count 582
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3228 place count 392 transition count 578
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3232 place count 388 transition count 578
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3235 place count 388 transition count 575
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3236 place count 388 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3237 place count 387 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3238 place count 386 transition count 574
Applied a total of 3238 rules in 436 ms. Remains 386 /2003 variables (removed 1617) and now considering 574/2003 (removed 1429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 386/2003 places, 574/2003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 229 ms. (steps per millisecond=43 ) 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 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 43 ms. (steps per millisecond=232 ) 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 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 315837 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 315837 steps, saw 173503 distinct states, run finished after 3003 ms. (steps per millisecond=105 ) properties seen :5
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 386 cols
[2024-05-29 20:47:41] [INFO ] Computed 160 invariants in 5 ms
[2024-05-29 20:47:41] [INFO ] [Real]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-29 20:47:41] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:47:41] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:47:42] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-29 20:47:42] [INFO ] After 51ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:42] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 20:47:42] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 574/574 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 386 transition count 563
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 375 transition count 563
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 22 place count 375 transition count 551
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 46 place count 363 transition count 551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 362 transition count 550
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 362 transition count 550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 362 transition count 549
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 361 transition count 549
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 348 transition count 536
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 106 place count 333 transition count 553
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 333 transition count 551
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 331 transition count 551
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 331 transition count 550
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 326 transition count 545
Applied a total of 116 rules in 99 ms. Remains 326 /386 variables (removed 60) and now considering 545/574 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 326/386 places, 545/574 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536795 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536795 steps, saw 395492 distinct states, run finished after 3002 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 545 rows 326 cols
[2024-05-29 20:47:45] [INFO ] Computed 160 invariants in 8 ms
[2024-05-29 20:47:45] [INFO ] [Real]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:47:45] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:47:45] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:47:45] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:47:45] [INFO ] After 23ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:45] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-29 20:47:45] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 545/545 transitions.
Applied a total of 0 rules in 10 ms. Remains 326 /326 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 326/326 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 545/545 transitions.
Applied a total of 0 rules in 9 ms. Remains 326 /326 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2024-05-29 20:47:45] [INFO ] Invariant cache hit.
[2024-05-29 20:47:46] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 20:47:46] [INFO ] Invariant cache hit.
[2024-05-29 20:47:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:47:46] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-05-29 20:47:46] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 20:47:46] [INFO ] Invariant cache hit.
[2024-05-29 20:47:46] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 326/326 places, 545/545 transitions.
Graph (trivial) has 148 edges and 326 vertex of which 4 / 326 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1113 edges and 324 vertex of which 322 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 145 edges and 320 vertex of which 4 / 320 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 318 transition count 536
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 144 edges and 316 vertex of which 6 / 316 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 313 transition count 527
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 142 edges and 310 vertex of which 8 / 310 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 306 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 302 vertex of which 8 / 302 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 298 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 294 vertex of which 6 / 294 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 291 transition count 488
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 130 edges and 288 vertex of which 4 / 288 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 87 place count 286 transition count 478
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 127 edges and 284 vertex of which 2 / 284 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 9 rules applied. Total rules applied 96 place count 283 transition count 472
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 101 place count 282 transition count 468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 101 place count 282 transition count 467
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 104 place count 280 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 107 place count 278 transition count 466
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 124 edges and 278 vertex of which 2 / 278 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 111 place count 277 transition count 463
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 126 edges and 276 vertex of which 6 / 276 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 115 place count 273 transition count 461
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t79.t2.t464.t248.t463.t254.t258 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 122 edges and 268 vertex of which 6 / 268 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 14 rules applied. Total rules applied 129 place count 265 transition count 447
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 120 edges and 262 vertex of which 8 / 262 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 15 rules applied. Total rules applied 144 place count 258 transition count 436
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 254 vertex of which 8 / 254 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 163 place count 250 transition count 422
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 246 vertex of which 8 / 246 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 182 place count 242 transition count 408
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 238 vertex of which 8 / 238 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 201 place count 234 transition count 394
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 230 vertex of which 8 / 230 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 220 place count 226 transition count 380
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 239 place count 218 transition count 366
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 96 edges and 214 vertex of which 6 / 214 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 258 place count 211 transition count 352
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 94 edges and 208 vertex of which 6 / 208 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 13 rules applied. Total rules applied 271 place count 205 transition count 343
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 91 edges and 202 vertex of which 6 / 202 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 19 with 16 rules applied. Total rules applied 287 place count 199 transition count 331
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 89 edges and 196 vertex of which 8 / 196 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 15 rules applied. Total rules applied 302 place count 192 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 86 edges and 188 vertex of which 10 / 188 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 21 with 20 rules applied. Total rules applied 322 place count 183 transition count 305
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 80 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 24 rules applied. Total rules applied 346 place count 174 transition count 287
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 76 edges and 170 vertex of which 6 / 170 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 365 place count 167 transition count 273
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 72 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 14 rules applied. Total rules applied 379 place count 162 transition count 263
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 69 edges and 160 vertex of which 2 / 160 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 25 with 9 rules applied. Total rules applied 388 place count 159 transition count 257
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 5 rules applied. Total rules applied 393 place count 158 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 2 Pre rules applied. Total rules applied 393 place count 158 transition count 251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 27 with 5 rules applied. Total rules applied 398 place count 155 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 398 place count 155 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 400 place count 154 transition count 250
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 401 place count 154 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 404 place count 152 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 408 place count 152 transition count 244
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 29 with 5 rules applied. Total rules applied 413 place count 152 transition count 239
Applied a total of 413 rules in 145 ms. Remains 152 /326 variables (removed 174) and now considering 239/545 (removed 306) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 239 rows 152 cols
[2024-05-29 20:47:46] [INFO ] Computed 74 invariants in 2 ms
[2024-05-29 20:47:47] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-29 20:47:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:47:47] [INFO ] [Nat]Absence check using 74 positive place invariants in 9 ms returned sat
[2024-05-29 20:47:47] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:47] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 20:47:47] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-29 20:47:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 326 places, 545 transitions and 3050 arcs took 6 ms.
[2024-05-29 20:47:47] [INFO ] Flatten gal took : 91 ms
Total runtime 37276 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717015668678

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
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 # 7 (type EXCL) for 0 ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 43
lola: fired transitions : 42
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-040B-ReachabilityCardinality-2024-03: EF true 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-040B"
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-040B, 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-171683789800639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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