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-167903718000479.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-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679517521812

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-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:38:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:38:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:38:44] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-22 20:38:44] [INFO ] Transformed 2043 places.
[2023-03-22 20:38:44] [INFO ] Transformed 1893 transitions.
[2023-03-22 20:38:44] [INFO ] Found NUPN structural information;
[2023-03-22 20:38:44] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-22 20:38:46] [INFO ] Computed 331 place invariants in 52 ms
[2023-03-22 20:38:47] [INFO ] [Real]Absence check using 331 positive place invariants in 256 ms returned sat
[2023-03-22 20:38:47] [INFO ] After 1610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 20:38:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 308 ms returned sat
[2023-03-22 20:38:54] [INFO ] After 5188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 20:38:55] [INFO ] Deduced a trap composed of 24 places in 1344 ms of which 27 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 23 places in 1852 ms of which 2 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 18 places in 885 ms of which 2 ms to minimize.
[2023-03-22 20:39:00] [INFO ] Deduced a trap composed of 23 places in 1201 ms of which 6 ms to minimize.
[2023-03-22 20:39:01] [INFO ] Deduced a trap composed of 21 places in 1071 ms of which 8 ms to minimize.
[2023-03-22 20:39:02] [INFO ] Deduced a trap composed of 30 places in 652 ms of which 2 ms to minimize.
[2023-03-22 20:39:03] [INFO ] Deduced a trap composed of 24 places in 679 ms of which 2 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 31 places in 978 ms of which 1 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 14 places in 607 ms of which 2 ms to minimize.
[2023-03-22 20:39:05] [INFO ] Deduced a trap composed of 38 places in 749 ms of which 1 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 27 places in 842 ms of which 2 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 23 places in 630 ms of which 1 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 24 places in 840 ms of which 2 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 28 places in 801 ms of which 20 ms to minimize.
[2023-03-22 20:39:10] [INFO ] Deduced a trap composed of 32 places in 741 ms of which 2 ms to minimize.
[2023-03-22 20:39:11] [INFO ] Deduced a trap composed of 19 places in 640 ms of which 1 ms to minimize.
[2023-03-22 20:39:12] [INFO ] Deduced a trap composed of 20 places in 1216 ms of which 2 ms to minimize.
[2023-03-22 20:39:13] [INFO ] Deduced a trap composed of 14 places in 649 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:39:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 20:39:13] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 926 ms.
Support contains 182 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 2043 transition count 1728
Reduce places removed 165 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 177 rules applied. Total rules applied 342 place count 1878 transition count 1716
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 1866 transition count 1716
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 354 place count 1866 transition count 1569
Deduced a syphon composed of 147 places in 9 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 648 place count 1719 transition count 1569
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 816 place count 1551 transition count 1401
Iterating global reduction 3 with 168 rules applied. Total rules applied 984 place count 1551 transition count 1401
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 984 place count 1551 transition count 1344
Deduced a syphon composed of 57 places in 17 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1098 place count 1494 transition count 1344
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 385
Deduced a syphon composed of 385 places in 10 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 3 with 770 rules applied. Total rules applied 1868 place count 1109 transition count 959
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 3 with 201 rules applied. Total rules applied 2069 place count 1109 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2070 place count 1108 transition count 958
Applied a total of 2070 rules in 889 ms. Remains 1108 /2043 variables (removed 935) and now considering 958/1893 (removed 935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 1108/2043 places, 958/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 8) seen :6
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 958 rows 1108 cols
[2023-03-22 20:39:15] [INFO ] Computed 331 place invariants in 23 ms
[2023-03-22 20:39:15] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:39:16] [INFO ] [Nat]Absence check using 318 positive place invariants in 273 ms returned sat
[2023-03-22 20:39:16] [INFO ] [Nat]Absence check using 318 positive and 13 generalized place invariants in 18 ms returned sat
[2023-03-22 20:39:17] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:39:17] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-22 20:39:18] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 2 ms to minimize.
[2023-03-22 20:39:18] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 0 ms to minimize.
[2023-03-22 20:39:18] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-22 20:39:19] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:39:19] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-22 20:39:19] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 0 ms to minimize.
[2023-03-22 20:39:21] [INFO ] Deduced a trap composed of 4 places in 1252 ms of which 1 ms to minimize.
[2023-03-22 20:39:21] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 0 ms to minimize.
[2023-03-22 20:39:21] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-03-22 20:39:22] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-22 20:39:22] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-22 20:39:22] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2023-03-22 20:39:22] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 11 ms to minimize.
[2023-03-22 20:39:23] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:39:23] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 6 ms to minimize.
[2023-03-22 20:39:23] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-22 20:39:24] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 0 ms to minimize.
[2023-03-22 20:39:24] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:39:24] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-22 20:39:24] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:39:25] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 4 ms to minimize.
[2023-03-22 20:39:25] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2023-03-22 20:39:25] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-22 20:39:26] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 3 ms to minimize.
[2023-03-22 20:39:26] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 23 ms to minimize.
[2023-03-22 20:39:26] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2023-03-22 20:39:26] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-22 20:39:27] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 0 ms to minimize.
[2023-03-22 20:39:27] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 8 ms to minimize.
[2023-03-22 20:39:27] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2023-03-22 20:39:27] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 1 ms to minimize.
[2023-03-22 20:39:28] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 14 ms to minimize.
[2023-03-22 20:39:28] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:39:28] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:39:28] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2023-03-22 20:39:29] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-22 20:39:29] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2023-03-22 20:39:29] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11743 ms
[2023-03-22 20:39:30] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-22 20:39:30] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 0 ms to minimize.
[2023-03-22 20:39:31] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 0 ms to minimize.
[2023-03-22 20:39:31] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 0 ms to minimize.
[2023-03-22 20:39:31] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2023-03-22 20:39:32] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-22 20:39:32] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-22 20:39:32] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-22 20:39:32] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:39:33] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 1 ms to minimize.
[2023-03-22 20:39:33] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-22 20:39:33] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 14 ms to minimize.
[2023-03-22 20:39:34] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 22 ms to minimize.
[2023-03-22 20:39:34] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 14 ms to minimize.
[2023-03-22 20:39:34] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 1 ms to minimize.
[2023-03-22 20:39:35] [INFO ] Deduced a trap composed of 15 places in 975 ms of which 1 ms to minimize.
[2023-03-22 20:39:36] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:39:36] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 0 ms to minimize.
[2023-03-22 20:39:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6693 ms
[2023-03-22 20:39:36] [INFO ] After 20566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-22 20:39:37] [INFO ] After 21957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 103 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 958/958 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1108 transition count 950
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1100 transition count 950
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 1100 transition count 944
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 1094 transition count 944
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1093 transition count 943
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1093 transition count 943
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 30 place count 1093 transition count 942
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 32 place count 1092 transition count 942
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 142 place count 1037 transition count 887
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 170 place count 1037 transition count 887
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 1036 transition count 886
Applied a total of 171 rules in 189 ms. Remains 1036 /1108 variables (removed 72) and now considering 886/958 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1036/1108 places, 886/958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 120402 steps, run timeout after 3013 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 120402 steps, saw 111349 distinct states, run finished after 3016 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 1036 cols
[2023-03-22 20:39:41] [INFO ] Computed 331 place invariants in 53 ms
[2023-03-22 20:39:41] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:39:41] [INFO ] [Nat]Absence check using 311 positive place invariants in 287 ms returned sat
[2023-03-22 20:39:41] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-22 20:39:43] [INFO ] After 1852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:39:44] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 1 ms to minimize.
[2023-03-22 20:39:44] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:39:45] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-22 20:39:45] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-22 20:39:45] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-22 20:39:45] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-22 20:39:45] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 1 ms to minimize.
[2023-03-22 20:39:46] [INFO ] Deduced a trap composed of 9 places in 569 ms of which 0 ms to minimize.
[2023-03-22 20:39:46] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:39:46] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 20:39:47] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-22 20:39:48] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-22 20:39:48] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-22 20:39:48] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2023-03-22 20:39:48] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:39:48] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-22 20:39:49] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-22 20:39:49] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 1 ms to minimize.
[2023-03-22 20:39:49] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-22 20:39:49] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-22 20:39:49] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5965 ms
[2023-03-22 20:39:51] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2023-03-22 20:39:52] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 1 ms to minimize.
[2023-03-22 20:39:52] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-22 20:39:53] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-22 20:39:53] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-22 20:39:53] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-22 20:39:53] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-22 20:39:54] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:39:54] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-22 20:39:54] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-22 20:39:55] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-22 20:39:55] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-22 20:39:55] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2023-03-22 20:39:55] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-22 20:39:56] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2023-03-22 20:39:56] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 0 ms to minimize.
[2023-03-22 20:39:56] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2023-03-22 20:39:57] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 0 ms to minimize.
[2023-03-22 20:39:57] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-22 20:39:58] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2023-03-22 20:39:58] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 0 ms to minimize.
[2023-03-22 20:39:59] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 2 ms to minimize.
[2023-03-22 20:39:59] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 14 ms to minimize.
[2023-03-22 20:40:00] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2023-03-22 20:40:00] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-22 20:40:00] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2023-03-22 20:40:00] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 0 ms to minimize.
[2023-03-22 20:40:01] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2023-03-22 20:40:01] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-22 20:40:01] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10464 ms
[2023-03-22 20:40:01] [INFO ] After 19686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2177 ms.
[2023-03-22 20:40:03] [INFO ] After 22482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 103 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 33 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1036/1036 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 27 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2023-03-22 20:40:03] [INFO ] Invariant cache hit.
[2023-03-22 20:40:04] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-22 20:40:04] [INFO ] Invariant cache hit.
[2023-03-22 20:40:06] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2302 ms to find 0 implicit places.
[2023-03-22 20:40:06] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-22 20:40:06] [INFO ] Invariant cache hit.
[2023-03-22 20:40:06] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3036 ms. Remains : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 28 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 20:40:07] [INFO ] Invariant cache hit.
[2023-03-22 20:40:07] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:40:07] [INFO ] [Nat]Absence check using 311 positive place invariants in 90 ms returned sat
[2023-03-22 20:40:07] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 19 ms returned sat
[2023-03-22 20:40:09] [INFO ] After 1966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:40:09] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 2 ms to minimize.
[2023-03-22 20:40:10] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-22 20:40:10] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:40:11] [INFO ] Deduced a trap composed of 5 places in 970 ms of which 1 ms to minimize.
[2023-03-22 20:40:11] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-22 20:40:11] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-22 20:40:11] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:40:12] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-22 20:40:12] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 0 ms to minimize.
[2023-03-22 20:40:12] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-22 20:40:12] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2023-03-22 20:40:13] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 13 ms to minimize.
[2023-03-22 20:40:13] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2023-03-22 20:40:13] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-22 20:40:13] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 0 ms to minimize.
[2023-03-22 20:40:14] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:40:14] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-22 20:40:14] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-22 20:40:15] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:40:15] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2023-03-22 20:40:15] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-22 20:40:15] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 0 ms to minimize.
[2023-03-22 20:40:16] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 0 ms to minimize.
[2023-03-22 20:40:16] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-22 20:40:16] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2023-03-22 20:40:16] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:40:17] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-22 20:40:17] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:40:17] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-22 20:40:17] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7867 ms
[2023-03-22 20:40:18] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 1 ms to minimize.
[2023-03-22 20:40:19] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-22 20:40:19] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-22 20:40:19] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-22 20:40:19] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-22 20:40:20] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 0 ms to minimize.
[2023-03-22 20:40:20] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 1 ms to minimize.
[2023-03-22 20:40:20] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 0 ms to minimize.
[2023-03-22 20:40:21] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-22 20:40:21] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 0 ms to minimize.
[2023-03-22 20:40:22] [INFO ] Deduced a trap composed of 7 places in 659 ms of which 0 ms to minimize.
[2023-03-22 20:40:23] [INFO ] Deduced a trap composed of 6 places in 609 ms of which 0 ms to minimize.
[2023-03-22 20:40:23] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 0 ms to minimize.
[2023-03-22 20:40:24] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2023-03-22 20:40:24] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-22 20:40:24] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-22 20:40:25] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-22 20:40:25] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2023-03-22 20:40:25] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-22 20:40:25] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7506 ms
[2023-03-22 20:40:25] [INFO ] After 18442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1130 ms.
[2023-03-22 20:40:27] [INFO ] After 19871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 20:40:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 31 ms.
[2023-03-22 20:40:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1036 places, 886 transitions and 3766 arcs took 6 ms.
[2023-03-22 20:40:27] [INFO ] Flatten gal took : 158 ms
Total runtime 103215 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_030B
(NrP: 1036 NrTr: 886 NrArc: 3766)

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

net check time: 0m 0.000sec

init dd package: 0m 3.016sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6225116 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098536 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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

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-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 ShieldPPPs-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 r394-oct2-167903718000479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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