Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717900463.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 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 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 349K 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 ShieldPPPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679515837590

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=ShieldPPPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:10:39] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-22 20:10:39] [INFO ] Transformed 1363 places.
[2023-03-22 20:10:39] [INFO ] Transformed 1263 transitions.
[2023-03-22 20:10:39] [INFO ] Found NUPN structural information;
[2023-03-22 20:10:39] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 16) seen :14
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2023-03-22 20:10:40] [INFO ] Computed 221 place invariants in 22 ms
[2023-03-22 20:10:40] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:10:41] [INFO ] [Nat]Absence check using 221 positive place invariants in 176 ms returned sat
[2023-03-22 20:10:42] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:10:43] [INFO ] Deduced a trap composed of 17 places in 513 ms of which 13 ms to minimize.
[2023-03-22 20:10:43] [INFO ] Deduced a trap composed of 18 places in 453 ms of which 1 ms to minimize.
[2023-03-22 20:10:44] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 1 ms to minimize.
[2023-03-22 20:10:44] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 2 ms to minimize.
[2023-03-22 20:10:44] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 1 ms to minimize.
[2023-03-22 20:10:45] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 1 ms to minimize.
[2023-03-22 20:10:45] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 3 ms to minimize.
[2023-03-22 20:10:45] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 1 ms to minimize.
[2023-03-22 20:10:46] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2023-03-22 20:10:46] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 1 ms to minimize.
[2023-03-22 20:10:46] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 0 ms to minimize.
[2023-03-22 20:10:47] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 2 ms to minimize.
[2023-03-22 20:10:47] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 0 ms to minimize.
[2023-03-22 20:10:48] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 0 ms to minimize.
[2023-03-22 20:10:48] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2023-03-22 20:10:48] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2023-03-22 20:10:49] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2023-03-22 20:10:49] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2023-03-22 20:10:49] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 2 ms to minimize.
[2023-03-22 20:10:50] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2023-03-22 20:10:50] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 1 ms to minimize.
[2023-03-22 20:10:51] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2023-03-22 20:10:51] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 0 ms to minimize.
[2023-03-22 20:10:51] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 4 ms to minimize.
[2023-03-22 20:10:52] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 1 ms to minimize.
[2023-03-22 20:10:52] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2023-03-22 20:10:53] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 1 ms to minimize.
[2023-03-22 20:10:53] [INFO ] Deduced a trap composed of 14 places in 375 ms of which 1 ms to minimize.
[2023-03-22 20:10:53] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 1 ms to minimize.
[2023-03-22 20:10:54] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 1 ms to minimize.
[2023-03-22 20:10:54] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 1 ms to minimize.
[2023-03-22 20:10:54] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 3 ms to minimize.
[2023-03-22 20:10:55] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 5 ms to minimize.
[2023-03-22 20:10:55] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2023-03-22 20:10:56] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2023-03-22 20:10:56] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 1 ms to minimize.
[2023-03-22 20:10:56] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 1 ms to minimize.
[2023-03-22 20:10:57] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 0 ms to minimize.
[2023-03-22 20:10:57] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 0 ms to minimize.
[2023-03-22 20:10:57] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 13 ms to minimize.
[2023-03-22 20:10:58] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 2 ms to minimize.
[2023-03-22 20:10:58] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 1 ms to minimize.
[2023-03-22 20:10:58] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 14 ms to minimize.
[2023-03-22 20:10:58] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2023-03-22 20:10:59] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 0 ms to minimize.
[2023-03-22 20:10:59] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 0 ms to minimize.
[2023-03-22 20:10:59] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 17014 ms
[2023-03-22 20:11:00] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-22 20:11:00] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 0 ms to minimize.
[2023-03-22 20:11:00] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2023-03-22 20:11:00] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 0 ms to minimize.
[2023-03-22 20:11:01] [INFO ] Deduced a trap composed of 23 places in 486 ms of which 7 ms to minimize.
[2023-03-22 20:11:01] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 1 ms to minimize.
[2023-03-22 20:11:02] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 1 ms to minimize.
[2023-03-22 20:11:02] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 1 ms to minimize.
[2023-03-22 20:11:02] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 1 ms to minimize.
[2023-03-22 20:11:03] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2023-03-22 20:11:03] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 1 ms to minimize.
[2023-03-22 20:11:04] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 1 ms to minimize.
[2023-03-22 20:11:04] [INFO ] Deduced a trap composed of 22 places in 400 ms of which 4 ms to minimize.
[2023-03-22 20:11:04] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 1 ms to minimize.
[2023-03-22 20:11:05] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 1 ms to minimize.
[2023-03-22 20:11:05] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 1 ms to minimize.
[2023-03-22 20:11:05] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 1 ms to minimize.
[2023-03-22 20:11:06] [INFO ] Deduced a trap composed of 16 places in 667 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-22 20:11:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 20:11:06] [INFO ] After 25682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 59 ms.
Support contains 53 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1363 transition count 1133
Reduce places removed 130 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 135 rules applied. Total rules applied 265 place count 1233 transition count 1128
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 270 place count 1228 transition count 1128
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 270 place count 1228 transition count 1031
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 464 place count 1131 transition count 1031
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 595 place count 1000 transition count 900
Iterating global reduction 3 with 131 rules applied. Total rules applied 726 place count 1000 transition count 900
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 726 place count 1000 transition count 851
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 824 place count 951 transition count 851
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 275
Deduced a syphon composed of 275 places in 2 ms
Reduce places removed 275 places and 0 transitions.
Iterating global reduction 3 with 550 rules applied. Total rules applied 1374 place count 676 transition count 576
Partial Free-agglomeration rule applied 165 times.
Drop transitions removed 165 transitions
Iterating global reduction 3 with 165 rules applied. Total rules applied 1539 place count 676 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1540 place count 675 transition count 575
Applied a total of 1540 rules in 349 ms. Remains 675 /1363 variables (removed 688) and now considering 575/1263 (removed 688) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 675/1363 places, 575/1263 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 269757 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{0=1}
Probabilistic random walk after 269757 steps, saw 80727 distinct states, run finished after 3006 ms. (steps per millisecond=89 ) properties seen :1
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 575 rows 675 cols
[2023-03-22 20:11:10] [INFO ] Computed 221 place invariants in 11 ms
[2023-03-22 20:11:10] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:11:10] [INFO ] [Nat]Absence check using 211 positive place invariants in 80 ms returned sat
[2023-03-22 20:11:10] [INFO ] [Nat]Absence check using 211 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-22 20:11:10] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:11:11] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 19 ms to minimize.
[2023-03-22 20:11:11] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-22 20:11:11] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2023-03-22 20:11:11] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-22 20:11:11] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 4 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-22 20:11:12] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-22 20:11:13] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:11:14] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4179 ms
[2023-03-22 20:11:14] [INFO ] After 4455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-22 20:11:15] [INFO ] After 4733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 15 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 575/575 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 675 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 674 transition count 574
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 674 transition count 569
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 669 transition count 569
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 72 place count 639 transition count 539
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 639 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 638 transition count 538
Applied a total of 85 rules in 129 ms. Remains 638 /675 variables (removed 37) and now considering 538/575 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 638/675 places, 538/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 322237 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322237 steps, saw 215779 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 538 rows 638 cols
[2023-03-22 20:11:18] [INFO ] Computed 221 place invariants in 31 ms
[2023-03-22 20:11:18] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:11:18] [INFO ] [Nat]Absence check using 204 positive place invariants in 53 ms returned sat
[2023-03-22 20:11:18] [INFO ] [Nat]Absence check using 204 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-22 20:11:18] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-03-22 20:11:19] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-22 20:11:20] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2023-03-22 20:11:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3029 ms
[2023-03-22 20:11:22] [INFO ] After 3309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 20:11:22] [INFO ] After 3513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 15 out of 638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 28 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 638/638 places, 538/538 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 26 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2023-03-22 20:11:22] [INFO ] Invariant cache hit.
[2023-03-22 20:11:22] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-22 20:11:22] [INFO ] Invariant cache hit.
[2023-03-22 20:11:23] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-22 20:11:23] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 20:11:23] [INFO ] Invariant cache hit.
[2023-03-22 20:11:23] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1642 ms. Remains : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 15 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 20:11:23] [INFO ] Invariant cache hit.
[2023-03-22 20:11:23] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:11:23] [INFO ] [Nat]Absence check using 204 positive place invariants in 27 ms returned sat
[2023-03-22 20:11:23] [INFO ] [Nat]Absence check using 204 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-22 20:11:24] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:11:24] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-22 20:11:24] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:11:24] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-22 20:11:25] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 12 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-22 20:11:26] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-22 20:11:27] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 0 ms to minimize.
[2023-03-22 20:11:27] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:11:27] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2023-03-22 20:11:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3135 ms
[2023-03-22 20:11:27] [INFO ] After 3527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-22 20:11:27] [INFO ] After 3769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:11:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 20:11:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 638 places, 538 transitions and 2357 arcs took 8 ms.
[2023-03-22 20:11:28] [INFO ] Flatten gal took : 85 ms
Total runtime 48634 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: ShieldPPPs_PT_020B
(NrP: 638 NrTr: 538 NrArc: 2357)

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

net check time: 0m 0.000sec

init dd package: 0m 3.009sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6031816 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16099752 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:
++ 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'
++ sed s/.jar//
+ 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.001sec

9149939

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="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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 r394-oct2-167903717900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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