Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 244K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679340301125

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:25:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:25:03] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-20 19:25:03] [INFO ] Transformed 803 places.
[2023-03-20 19:25:03] [INFO ] Transformed 903 transitions.
[2023-03-20 19:25:03] [INFO ] Found NUPN structural information;
[2023-03-20 19:25:03] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 11 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 15) seen :9
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-20 19:25:03] [INFO ] Computed 81 place invariants in 22 ms
[2023-03-20 19:25:04] [INFO ] [Real]Absence check using 81 positive place invariants in 78 ms returned sat
[2023-03-20 19:25:04] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 19:25:04] [INFO ] [Nat]Absence check using 81 positive place invariants in 36 ms returned sat
[2023-03-20 19:25:06] [INFO ] After 1351ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-20 19:25:06] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 37 ms to minimize.
[2023-03-20 19:25:07] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 1 ms to minimize.
[2023-03-20 19:25:07] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 2 ms to minimize.
[2023-03-20 19:25:09] [INFO ] Deduced a trap composed of 26 places in 1514 ms of which 2 ms to minimize.
[2023-03-20 19:25:09] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 1 ms to minimize.
[2023-03-20 19:25:09] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-20 19:25:10] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 1 ms to minimize.
[2023-03-20 19:25:10] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 0 ms to minimize.
[2023-03-20 19:25:11] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 1 ms to minimize.
[2023-03-20 19:25:11] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 2 ms to minimize.
[2023-03-20 19:25:11] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 1 ms to minimize.
[2023-03-20 19:25:12] [INFO ] Deduced a trap composed of 21 places in 323 ms of which 1 ms to minimize.
[2023-03-20 19:25:12] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2023-03-20 19:25:12] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 1 ms to minimize.
[2023-03-20 19:25:13] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 1 ms to minimize.
[2023-03-20 19:25:13] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 1 ms to minimize.
[2023-03-20 19:25:13] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-03-20 19:25:14] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2023-03-20 19:25:14] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 0 ms to minimize.
[2023-03-20 19:25:14] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2023-03-20 19:25:14] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2023-03-20 19:25:15] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-20 19:25:15] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 0 ms to minimize.
[2023-03-20 19:25:15] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 1 ms to minimize.
[2023-03-20 19:25:16] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2023-03-20 19:25:16] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 1 ms to minimize.
[2023-03-20 19:25:16] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 0 ms to minimize.
[2023-03-20 19:25:16] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 1 ms to minimize.
[2023-03-20 19:25:17] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 1 ms to minimize.
[2023-03-20 19:25:17] [INFO ] Deduced a trap composed of 31 places in 439 ms of which 2 ms to minimize.
[2023-03-20 19:25:18] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 1 ms to minimize.
[2023-03-20 19:25:18] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-20 19:25:18] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 0 ms to minimize.
[2023-03-20 19:25:18] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 2 ms to minimize.
[2023-03-20 19:25:19] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 1 ms to minimize.
[2023-03-20 19:25:19] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2023-03-20 19:25:19] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2023-03-20 19:25:20] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-20 19:25:20] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
[2023-03-20 19:25:20] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 2 ms to minimize.
[2023-03-20 19:25:20] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 0 ms to minimize.
[2023-03-20 19:25:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-20 19:25:21] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-03-20 19:25:21] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-20 19:25:21] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 1 ms to minimize.
[2023-03-20 19:25:21] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 0 ms to minimize.
[2023-03-20 19:25:21] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 2 ms to minimize.
[2023-03-20 19:25:22] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:25:22] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2023-03-20 19:25:22] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-03-20 19:25:22] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 1 ms to minimize.
[2023-03-20 19:25:22] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 1 ms to minimize.
[2023-03-20 19:25:23] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:25:23] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2023-03-20 19:25:23] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2023-03-20 19:25:23] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 4 ms to minimize.
[2023-03-20 19:25:23] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 5 ms to minimize.
[2023-03-20 19:25:24] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2023-03-20 19:25:24] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:25:24] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:25:24] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2023-03-20 19:25:24] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2023-03-20 19:25:25] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2023-03-20 19:25:25] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2023-03-20 19:25:25] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-20 19:25:25] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2023-03-20 19:25:26] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 1 ms to minimize.
[2023-03-20 19:25:26] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 2 ms to minimize.
[2023-03-20 19:25:26] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 2 ms to minimize.
[2023-03-20 19:25:26] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:25:26] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2023-03-20 19:25:27] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 1 ms to minimize.
[2023-03-20 19:25:27] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2023-03-20 19:25:27] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 1 ms to minimize.
[2023-03-20 19:25:28] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 1 ms to minimize.
[2023-03-20 19:25:28] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 1 ms to minimize.
[2023-03-20 19:25:29] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 1 ms to minimize.
[2023-03-20 19:25:29] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 1 ms to minimize.
[2023-03-20 19:25:29] [INFO ] Deduced a trap composed of 30 places in 248 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:25:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:25:29] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 98 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 803 transition count 845
Reduce places removed 58 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 62 rules applied. Total rules applied 120 place count 745 transition count 841
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 741 transition count 841
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 124 place count 741 transition count 752
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 302 place count 652 transition count 752
Discarding 107 places :
Symmetric choice reduction at 3 with 107 rule applications. Total rules 409 place count 545 transition count 645
Iterating global reduction 3 with 107 rules applied. Total rules applied 516 place count 545 transition count 645
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 516 place count 545 transition count 606
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 594 place count 506 transition count 606
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 812 place count 397 transition count 497
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 837 place count 397 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 838 place count 396 transition count 496
Applied a total of 838 rules in 298 ms. Remains 396 /803 variables (removed 407) and now considering 496/903 (removed 407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 396/803 places, 496/903 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 496 rows 396 cols
[2023-03-20 19:25:30] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 19:25:30] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 19:25:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-20 19:25:31] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 19:25:31] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:25:31] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:25:31] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:25:31] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:25:31] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:25:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1378 ms
[2023-03-20 19:25:32] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-20 19:25:37] [INFO ] Deduced a trap composed of 11 places in 4902 ms of which 26 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:25:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5930 ms
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2023-03-20 19:25:39] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2023-03-20 19:25:40] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-20 19:25:40] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-20 19:25:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1383 ms
[2023-03-20 19:25:40] [INFO ] After 9290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-20 19:25:40] [INFO ] After 9832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 ms.
Support contains 85 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 496/496 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 396 transition count 495
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 395 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 394 transition count 494
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 394 transition count 492
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 392 transition count 492
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 384 transition count 484
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 384 transition count 484
Applied a total of 29 rules in 100 ms. Remains 384 /396 variables (removed 12) and now considering 484/496 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 384/396 places, 484/496 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 484 rows 384 cols
[2023-03-20 19:25:41] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 19:25:41] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:25:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 16 ms returned sat
[2023-03-20 19:25:41] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 555 ms
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:25:42] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:25:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:25:44] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:25:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 13 ms to minimize.
[2023-03-20 19:25:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1722 ms
[2023-03-20 19:25:44] [INFO ] After 2810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-20 19:25:44] [INFO ] After 3128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 59 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 484/484 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 384 transition count 477
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 377 transition count 477
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 377 transition count 469
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 369 transition count 469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 368 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 368 transition count 468
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 72 place count 348 transition count 448
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 348 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 347 transition count 447
Applied a total of 78 rules in 127 ms. Remains 347 /384 variables (removed 37) and now considering 447/484 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 347/384 places, 447/484 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 447 rows 347 cols
[2023-03-20 19:25:44] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 19:25:45] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:25:45] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-20 19:25:45] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:25:45] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:25:45] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-20 19:25:45] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:25:45] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:25:48] [INFO ] Deduced a trap composed of 24 places in 2054 ms of which 26 ms to minimize.
[2023-03-20 19:25:48] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-20 19:25:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-20 19:25:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:25:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:25:51] [INFO ] Deduced a trap composed of 16 places in 2786 ms of which 26 ms to minimize.
[2023-03-20 19:25:51] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:25:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-20 19:25:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6107 ms
[2023-03-20 19:25:51] [INFO ] After 6412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-20 19:25:51] [INFO ] After 6652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 40 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 347 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 346 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 346 transition count 443
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 343 transition count 443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 342 transition count 442
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 342 transition count 442
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 328 transition count 428
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 328 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 327 transition count 427
Applied a total of 43 rules in 114 ms. Remains 327 /347 variables (removed 20) and now considering 427/447 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 327/347 places, 427/447 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645346 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645346 steps, saw 117644 distinct states, run finished after 3002 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 327 cols
[2023-03-20 19:25:54] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 19:25:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:25:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 553 ms returned sat
[2023-03-20 19:25:57] [INFO ] After 2042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:25:57] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:25:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 707 ms
[2023-03-20 19:25:58] [INFO ] After 2829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-20 19:25:58] [INFO ] After 3623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 40 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 24 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 327/327 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 19 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-20 19:25:58] [INFO ] Invariant cache hit.
[2023-03-20 19:26:04] [INFO ] Implicit Places using invariants in 5524 ms returned []
[2023-03-20 19:26:04] [INFO ] Invariant cache hit.
[2023-03-20 19:26:04] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 5944 ms to find 0 implicit places.
[2023-03-20 19:26:04] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-20 19:26:04] [INFO ] Invariant cache hit.
[2023-03-20 19:26:04] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6294 ms. Remains : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 7 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 19:26:04] [INFO ] Invariant cache hit.
[2023-03-20 19:26:05] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:26:05] [INFO ] [Nat]Absence check using 81 positive place invariants in 16 ms returned sat
[2023-03-20 19:26:05] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:26:05] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-20 19:26:05] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:26:05] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:26:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1137 ms
[2023-03-20 19:26:06] [INFO ] After 1466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-20 19:26:06] [INFO ] After 1626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 19:26:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 19:26:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 427 transitions and 1968 arcs took 4 ms.
[2023-03-20 19:26:07] [INFO ] Flatten gal took : 142 ms
Total runtime 64115 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_020B
(NrP: 327 NrTr: 427 NrArc: 1968)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.018sec

net check time: 0m 0.000sec

init dd package: 0m 3.119sec


before gc: list nodes free: 2042620

after gc: idd nodes used:589302, unused:63410698; list nodes free:280364553

before gc: list nodes free: 212139

after gc: idd nodes used:751826, unused:63248174; list nodes free:279635754

before gc: list nodes free: 762563

after gc: idd nodes used:891718, unused:63108282; list nodes free:281053933

before gc: list nodes free: 1042637

after gc: idd nodes used:896802, unused:63103198; list nodes free:281037816
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6258964 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097060 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

639488 887046 872040

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-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 r426-tajo-167905978500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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