About the Execution of Marcie+red for ShieldRVs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9923.044 | 3600000.00 | 3647249.00 | 385.70 | TFF?FFT?TFTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600174.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600174
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 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.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 1.3M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679345898795
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 20:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:58:20] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-20 20:58:20] [INFO ] Transformed 4003 places.
[2023-03-20 20:58:20] [INFO ] Transformed 4503 transitions.
[2023-03-20 20:58:20] [INFO ] Found NUPN structural information;
[2023-03-20 20:58:20] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 11) seen :8
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-20 20:58:21] [INFO ] Computed 401 place invariants in 89 ms
[2023-03-20 20:58:22] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:58:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 267 ms returned sat
[2023-03-20 20:58:33] [INFO ] After 10301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:58:35] [INFO ] Deduced a trap composed of 23 places in 1567 ms of which 9 ms to minimize.
[2023-03-20 20:58:37] [INFO ] Deduced a trap composed of 21 places in 1520 ms of which 3 ms to minimize.
[2023-03-20 20:58:39] [INFO ] Deduced a trap composed of 32 places in 1901 ms of which 3 ms to minimize.
[2023-03-20 20:58:41] [INFO ] Deduced a trap composed of 23 places in 1599 ms of which 4 ms to minimize.
[2023-03-20 20:58:43] [INFO ] Deduced a trap composed of 33 places in 1530 ms of which 2 ms to minimize.
[2023-03-20 20:58:44] [INFO ] Deduced a trap composed of 49 places in 1631 ms of which 2 ms to minimize.
[2023-03-20 20:58:46] [INFO ] Deduced a trap composed of 24 places in 1405 ms of which 2 ms to minimize.
[2023-03-20 20:58:48] [INFO ] Deduced a trap composed of 21 places in 1472 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:58:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:58:48] [INFO ] After 25439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 783 ms.
Support contains 26 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 4003 transition count 4109
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 3609 transition count 4109
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 788 place count 3609 transition count 3612
Deduced a syphon composed of 497 places in 11 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1782 place count 3112 transition count 3612
Discarding 694 places :
Symmetric choice reduction at 2 with 694 rule applications. Total rules 2476 place count 2418 transition count 2918
Iterating global reduction 2 with 694 rules applied. Total rules applied 3170 place count 2418 transition count 2918
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 290 Pre rules applied. Total rules applied 3170 place count 2418 transition count 2628
Deduced a syphon composed of 290 places in 18 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 2 with 580 rules applied. Total rules applied 3750 place count 2128 transition count 2628
Performed 692 Post agglomeration using F-continuation condition.Transition count delta: 692
Deduced a syphon composed of 692 places in 9 ms
Reduce places removed 692 places and 0 transitions.
Iterating global reduction 2 with 1384 rules applied. Total rules applied 5134 place count 1436 transition count 1936
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 5335 place count 1436 transition count 1936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5336 place count 1435 transition count 1935
Applied a total of 5336 rules in 1364 ms. Remains 1435 /4003 variables (removed 2568) and now considering 1935/4503 (removed 2568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 1435/4003 places, 1935/4503 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1935 rows 1435 cols
[2023-03-20 20:58:50] [INFO ] Computed 401 place invariants in 17 ms
[2023-03-20 20:58:50] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:58:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 97 ms returned sat
[2023-03-20 20:58:52] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:58:52] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 1 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 0 ms to minimize.
[2023-03-20 20:58:53] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 0 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 1 ms to minimize.
[2023-03-20 20:58:54] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 0 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 1 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 0 ms to minimize.
[2023-03-20 20:58:55] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 1 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-20 20:58:56] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:58:57] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 0 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 1 ms to minimize.
[2023-03-20 20:58:58] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2023-03-20 20:58:59] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-20 20:58:59] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 0 ms to minimize.
[2023-03-20 20:58:59] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 0 ms to minimize.
[2023-03-20 20:58:59] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:59:00] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 7 ms to minimize.
[2023-03-20 20:59:00] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-20 20:59:00] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-20 20:59:01] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:59:01] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:59:01] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:59:01] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2023-03-20 20:59:02] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:59:02] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 3 ms to minimize.
[2023-03-20 20:59:02] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 3 ms to minimize.
[2023-03-20 20:59:03] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:59:03] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:59:03] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-20 20:59:03] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2023-03-20 20:59:04] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:59:04] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-20 20:59:04] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:59:05] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:59:05] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:59:05] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:59:05] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:59:06] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2023-03-20 20:59:07] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 0 ms to minimize.
[2023-03-20 20:59:08] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 15830 ms
[2023-03-20 20:59:08] [INFO ] After 17104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 384 ms.
[2023-03-20 20:59:08] [INFO ] After 17834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 135 ms.
Support contains 25 out of 1435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 1935/1935 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1434 transition count 1934
Applied a total of 2 rules in 161 ms. Remains 1434 /1435 variables (removed 1) and now considering 1934/1935 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1434/1435 places, 1934/1935 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 109583 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109583 steps, saw 57007 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1934 rows 1434 cols
[2023-03-20 20:59:12] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 20:59:12] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:59:12] [INFO ] [Nat]Absence check using 401 positive place invariants in 97 ms returned sat
[2023-03-20 20:59:15] [INFO ] After 2432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:59:15] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2023-03-20 20:59:16] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 2 ms to minimize.
[2023-03-20 20:59:16] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 5 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 1 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 1 ms to minimize.
[2023-03-20 20:59:17] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 1 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 0 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2023-03-20 20:59:18] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-20 20:59:19] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 0 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-20 20:59:20] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-20 20:59:21] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 0 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2023-03-20 20:59:22] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 0 ms to minimize.
[2023-03-20 20:59:23] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2023-03-20 20:59:24] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-20 20:59:25] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-20 20:59:25] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 1 ms to minimize.
[2023-03-20 20:59:26] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-20 20:59:27] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:59:27] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:59:27] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:59:28] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 1 ms to minimize.
[2023-03-20 20:59:29] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2023-03-20 20:59:30] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:59:31] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 16809 ms
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:59:32] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:59:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1156 ms
[2023-03-20 20:59:33] [INFO ] After 20779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-20 20:59:34] [INFO ] After 21562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 125 ms.
Support contains 25 out of 1434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 80 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 76 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2023-03-20 20:59:34] [INFO ] Invariant cache hit.
[2023-03-20 20:59:35] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-20 20:59:35] [INFO ] Invariant cache hit.
[2023-03-20 20:59:36] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2584 ms to find 0 implicit places.
[2023-03-20 20:59:37] [INFO ] Redundant transitions in 382 ms returned []
[2023-03-20 20:59:37] [INFO ] Invariant cache hit.
[2023-03-20 20:59:38] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3964 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 52 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 20:59:38] [INFO ] Invariant cache hit.
[2023-03-20 20:59:38] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:59:38] [INFO ] [Nat]Absence check using 401 positive place invariants in 56 ms returned sat
[2023-03-20 20:59:39] [INFO ] After 875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-20 20:59:40] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-20 20:59:41] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 0 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 1 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-20 20:59:42] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 0 ms to minimize.
[2023-03-20 20:59:43] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 0 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2023-03-20 20:59:44] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 0 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-20 20:59:45] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 1 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 2 ms to minimize.
[2023-03-20 20:59:46] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-20 20:59:47] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 0 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-20 20:59:48] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Trap strengthening (SAT) tested/added 81/80 trap constraints in 21971 ms
[2023-03-20 21:00:02] [INFO ] After 23271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-20 21:00:02] [INFO ] After 23763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:00:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-20 21:00:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1434 places, 1934 transitions and 9538 arcs took 15 ms.
[2023-03-20 21:00:02] [INFO ] Flatten gal took : 288 ms
Total runtime 102347 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldRVs_PT_100B
(NrP: 1434 NrTr: 1934 NrArc: 9538)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.246sec
net check time: 0m 0.001sec
init dd package: 0m 3.113sec
before gc: list nodes free: 172368
after gc: idd nodes used:499241, unused:63500759; list nodes free:280838249
before gc: list nodes free: 1364714
after gc: idd nodes used:732593, unused:63267407; list nodes free:281897784
before gc: list nodes free: 639041
after gc: idd nodes used:899705, unused:63100295; list nodes free:281138937
before gc: list nodes free: 1014819
after gc: idd nodes used:992969, unused:63007031; list nodes free:280732137
before gc: list nodes free: 495160
after gc: idd nodes used:1006673, unused:62993327; list nodes free:280663558
before gc: list nodes free: 635848
after gc: idd nodes used:1066889, unused:62933111; list nodes free:280401052
before gc: list nodes free: 1669136
after gc: idd nodes used:954353, unused:63045647; list nodes free:280908096
before gc: list nodes free: 1258507
after gc: idd nodes used:990521, unused:63009479; list nodes free:280737875
before gc: list nodes free: 1963399
after gc: idd nodes used:1093289, unused:62906711; list nodes free:282361957
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6220960 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097764 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.016sec
915192 1029120 1083768
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978600174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100B.tgz
mv ShieldRVs-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;