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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679349127386

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:52:08] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-20 21:52:08] [INFO ] Transformed 1503 places.
[2023-03-20 21:52:08] [INFO ] Transformed 1503 transitions.
[2023-03-20 21:52:08] [INFO ] Found NUPN structural information;
[2023-03-20 21:52:08] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-20 21:52:09] [INFO ] Computed 121 place invariants in 19 ms
[2023-03-20 21:52:10] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:52:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2023-03-20 21:52:13] [INFO ] After 2317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:52:14] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 8 ms to minimize.
[2023-03-20 21:52:14] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 2 ms to minimize.
[2023-03-20 21:52:15] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 1 ms to minimize.
[2023-03-20 21:52:15] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 2 ms to minimize.
[2023-03-20 21:52:16] [INFO ] Deduced a trap composed of 43 places in 349 ms of which 1 ms to minimize.
[2023-03-20 21:52:16] [INFO ] Deduced a trap composed of 46 places in 321 ms of which 1 ms to minimize.
[2023-03-20 21:52:16] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 2 ms to minimize.
[2023-03-20 21:52:17] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 1 ms to minimize.
[2023-03-20 21:52:17] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 1 ms to minimize.
[2023-03-20 21:52:18] [INFO ] Deduced a trap composed of 53 places in 299 ms of which 1 ms to minimize.
[2023-03-20 21:52:18] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 1 ms to minimize.
[2023-03-20 21:52:18] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
[2023-03-20 21:52:19] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2023-03-20 21:52:19] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 1 ms to minimize.
[2023-03-20 21:52:19] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 1 ms to minimize.
[2023-03-20 21:52:20] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 1 ms to minimize.
[2023-03-20 21:52:20] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 1 ms to minimize.
[2023-03-20 21:52:20] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2023-03-20 21:52:21] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 1 ms to minimize.
[2023-03-20 21:52:21] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 1 ms to minimize.
[2023-03-20 21:52:21] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 1 ms to minimize.
[2023-03-20 21:52:22] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 2 ms to minimize.
[2023-03-20 21:52:22] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 1 ms to minimize.
[2023-03-20 21:52:23] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 1 ms to minimize.
[2023-03-20 21:52:23] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 0 ms to minimize.
[2023-03-20 21:52:23] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 0 ms to minimize.
[2023-03-20 21:52:24] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 1 ms to minimize.
[2023-03-20 21:52:24] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:52:24] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 1 ms to minimize.
[2023-03-20 21:52:25] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 1 ms to minimize.
[2023-03-20 21:52:25] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 1 ms to minimize.
[2023-03-20 21:52:25] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 1 ms to minimize.
[2023-03-20 21:52:26] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 1 ms to minimize.
[2023-03-20 21:52:26] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 2 ms to minimize.
[2023-03-20 21:52:26] [INFO ] Deduced a trap composed of 61 places in 284 ms of which 1 ms to minimize.
[2023-03-20 21:52:27] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:52:27] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 1 ms to minimize.
[2023-03-20 21:52:27] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 0 ms to minimize.
[2023-03-20 21:52:27] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 1 ms to minimize.
[2023-03-20 21:52:28] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:52:28] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:52:28] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 4 ms to minimize.
[2023-03-20 21:52:29] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 2 ms to minimize.
[2023-03-20 21:52:29] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 0 ms to minimize.
[2023-03-20 21:52:29] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 0 ms to minimize.
[2023-03-20 21:52:29] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 1 ms to minimize.
[2023-03-20 21:52:30] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 2 ms to minimize.
[2023-03-20 21:52:30] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:52:30] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 1 ms to minimize.
[2023-03-20 21:52:30] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2023-03-20 21:52:31] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-20 21:52:31] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2023-03-20 21:52:31] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17826 ms
[2023-03-20 21:52:31] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 0 ms to minimize.
[2023-03-20 21:52:32] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 0 ms to minimize.
[2023-03-20 21:52:32] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 1 ms to minimize.
[2023-03-20 21:52:32] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2023-03-20 21:52:32] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2023-03-20 21:52:32] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 0 ms to minimize.
[2023-03-20 21:52:33] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 1 ms to minimize.
[2023-03-20 21:52:33] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2023-03-20 21:52:33] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 1 ms to minimize.
[2023-03-20 21:52:34] [INFO ] Deduced a trap composed of 46 places in 508 ms of which 1 ms to minimize.
[2023-03-20 21:52:35] [INFO ] Deduced a trap composed of 48 places in 496 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 21:52:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:52:35] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 410 ms.
Support contains 205 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1503 transition count 1212
Reduce places removed 291 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 339 rules applied. Total rules applied 630 place count 1212 transition count 1164
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 678 place count 1164 transition count 1164
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 678 place count 1164 transition count 1040
Deduced a syphon composed of 124 places in 6 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 926 place count 1040 transition count 1040
Discarding 169 places :
Symmetric choice reduction at 3 with 169 rule applications. Total rules 1095 place count 871 transition count 871
Iterating global reduction 3 with 169 rules applied. Total rules applied 1264 place count 871 transition count 871
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1264 place count 871 transition count 825
Deduced a syphon composed of 46 places in 5 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1356 place count 825 transition count 825
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 2 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 1798 place count 604 transition count 604
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1892 place count 557 transition count 621
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1906 place count 557 transition count 607
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1920 place count 543 transition count 607
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1922 place count 543 transition count 605
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1932 place count 543 transition count 605
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1933 place count 543 transition count 605
Applied a total of 1933 rules in 379 ms. Remains 543 /1503 variables (removed 960) and now considering 605/1503 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 543/1503 places, 605/1503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 7) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 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 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 605 rows 543 cols
[2023-03-20 21:52:36] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 21:52:36] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 21:52:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 21:52:37] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 21:52:37] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-20 21:52:38] [INFO ] After 498ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-20 21:52:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 864 ms
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:52:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2023-03-20 21:52:40] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-20 21:52:40] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-20 21:52:40] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-20 21:52:40] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:52:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-20 21:52:41] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-20 21:52:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 858 ms
[2023-03-20 21:52:41] [INFO ] After 3650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 867 ms.
[2023-03-20 21:52:42] [INFO ] After 5353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 186 ms.
Support contains 141 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 605/605 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 543 transition count 582
Reduce places removed 23 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 27 rules applied. Total rules applied 50 place count 520 transition count 578
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 516 transition count 578
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 54 place count 516 transition count 561
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 88 place count 499 transition count 561
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 495 transition count 557
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 495 transition count 557
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 495 transition count 556
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 494 transition count 556
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 150 place count 468 transition count 530
Renaming transitions due to excessive name length > 1024 char.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 164 place count 461 transition count 536
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 461 transition count 535
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 461 transition count 529
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 177 place count 455 transition count 529
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 455 transition count 529
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 455 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 454 transition count 528
Applied a total of 183 rules in 189 ms. Remains 454 /543 variables (removed 89) and now considering 528/605 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 454/543 places, 528/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 528 rows 454 cols
[2023-03-20 21:52:42] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 21:52:42] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:52:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-20 21:52:43] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:52:43] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 21:52:43] [INFO ] After 255ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 21:52:43] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 964 ms
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-20 21:52:44] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-20 21:52:45] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:52:46] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-20 21:52:47] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-20 21:52:47] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-20 21:52:47] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-20 21:52:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1778 ms
[2023-03-20 21:52:47] [INFO ] After 3861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-20 21:52:47] [INFO ] After 4727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 70 ms.
Support contains 140 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 528/528 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 453 transition count 527
Applied a total of 2 rules in 22 ms. Remains 453 /454 variables (removed 1) and now considering 527/528 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 453/454 places, 527/528 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 527 rows 453 cols
[2023-03-20 21:52:48] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 21:52:48] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:52:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 21:52:48] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:52:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 21:52:49] [INFO ] After 360ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:52:49] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-20 21:52:49] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-20 21:52:49] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-20 21:52:49] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:52:49] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-20 21:52:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 622 ms
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-20 21:52:50] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-20 21:52:51] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-20 21:52:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 775 ms
[2023-03-20 21:52:51] [INFO ] After 2205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-20 21:52:51] [INFO ] After 3032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 137 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 527/527 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 453 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 452 transition count 526
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 452 transition count 525
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 4 place count 451 transition count 525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 449 transition count 523
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 10 place count 448 transition count 524
Applied a total of 10 rules in 29 ms. Remains 448 /453 variables (removed 5) and now considering 524/527 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 448/453 places, 524/527 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 312309 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312309 steps, saw 208434 distinct states, run finished after 3002 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 524 rows 448 cols
[2023-03-20 21:52:54] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 21:52:54] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:52:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 21:52:55] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:52:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-20 21:52:55] [INFO ] After 357ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:52:55] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:52:55] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:52:55] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-20 21:52:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 663 ms
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-20 21:52:56] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2023-03-20 21:52:57] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-20 21:52:57] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-20 21:52:57] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-20 21:52:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 531 ms
[2023-03-20 21:52:57] [INFO ] After 2074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-20 21:52:57] [INFO ] After 2729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 59 ms.
Support contains 137 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 524/524 transitions.
Applied a total of 0 rules in 10 ms. Remains 448 /448 variables (removed 0) and now considering 524/524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 448/448 places, 524/524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 524/524 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2023-03-20 21:52:57] [INFO ] Invariant cache hit.
[2023-03-20 21:52:57] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-20 21:52:57] [INFO ] Invariant cache hit.
[2023-03-20 21:52:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-20 21:52:58] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-20 21:52:58] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 21:52:58] [INFO ] Invariant cache hit.
[2023-03-20 21:52:58] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 448/448 places, 524/524 transitions.
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 448 transition count 511
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 24 place count 448 transition count 511
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 29 place count 448 transition count 506
Applied a total of 29 rules in 25 ms. Remains 448 /448 variables (removed 0) and now considering 506/524 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 506 rows 448 cols
[2023-03-20 21:52:58] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 21:52:58] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:52:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 21:52:59] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2023-03-20 21:52:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-20 21:53:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 486 ms
[2023-03-20 21:53:00] [INFO ] After 1263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-20 21:53:00] [INFO ] After 1608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:53:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-20 21:53:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 524 transitions and 2031 arcs took 6 ms.
[2023-03-20 21:53:00] [INFO ] Flatten gal took : 86 ms
Total runtime 51829 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_030B
(NrP: 448 NrTr: 524 NrArc: 2031)

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

net check time: 0m 0.000sec

init dd package: 0m 3.125sec


before gc: list nodes free: 685560

after gc: idd nodes used:56309394, unused:7690606; list nodes free:33106491

RS generation: 30m33.239sec


-> last computed set: #nodes 56308947 (5.6e+07) #states 180,249,821,821,440 (14)


CANNOT_COMPUTE


BK_STOP 1679351049976

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.003sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978700303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;