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.r106-tall-167814483300822.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DLCshifumi-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483300822
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 5.7K Feb 26 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 08:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 08:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 08:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:22 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 DLCshifumi-PT-3b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678483876956

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=DLCshifumi-PT-3b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 21:31:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:31:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:31:18] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-10 21:31:18] [INFO ] Transformed 7058 places.
[2023-03-10 21:31:18] [INFO ] Transformed 9611 transitions.
[2023-03-10 21:31:18] [INFO ] Found NUPN structural information;
[2023-03-10 21:31:18] [INFO ] Parsed PT model containing 7058 places and 9611 transitions and 24573 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 12) seen :6
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9611 rows 7058 cols
[2023-03-10 21:31:19] [INFO ] Computed 282 place invariants in 79 ms
[2023-03-10 21:31:21] [INFO ] After 1685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 21:31:23] [INFO ] [Nat]Absence check using 282 positive place invariants in 304 ms returned sat
[2023-03-10 21:31:31] [INFO ] After 7951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 21:31:35] [INFO ] Deduced a trap composed of 114 places in 3413 ms of which 13 ms to minimize.
[2023-03-10 21:31:39] [INFO ] Deduced a trap composed of 74 places in 3222 ms of which 5 ms to minimize.
[2023-03-10 21:31:42] [INFO ] Deduced a trap composed of 131 places in 3162 ms of which 4 ms to minimize.
[2023-03-10 21:31:45] [INFO ] Deduced a trap composed of 120 places in 3035 ms of which 5 ms to minimize.
[2023-03-10 21:31:49] [INFO ] Deduced a trap composed of 148 places in 2887 ms of which 7 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-10 21:31:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 21:31:49] [INFO ] After 27433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 385 ms.
Support contains 63 out of 7058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7058/7058 places, 9611/9611 transitions.
Graph (trivial) has 6676 edges and 7058 vertex of which 724 / 7058 are part of one of the 47 SCC in 23 ms
Free SCC test removed 677 places
Drop transitions removed 764 transitions
Reduce isomorphic transitions removed 764 transitions.
Drop transitions removed 3465 transitions
Trivial Post-agglo rules discarded 3465 transitions
Performed 3465 trivial Post agglomeration. Transition count delta: 3465
Iterating post reduction 0 with 3465 rules applied. Total rules applied 3466 place count 6381 transition count 5382
Reduce places removed 3465 places and 0 transitions.
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 1 with 3703 rules applied. Total rules applied 7169 place count 2916 transition count 5144
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 186 rules applied. Total rules applied 7355 place count 2799 transition count 5075
Reduce places removed 34 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 3 with 68 rules applied. Total rules applied 7423 place count 2765 transition count 5041
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 37 rules applied. Total rules applied 7460 place count 2731 transition count 5038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7461 place count 2730 transition count 5038
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 65 Pre rules applied. Total rules applied 7461 place count 2730 transition count 4973
Deduced a syphon composed of 65 places in 92 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 7591 place count 2665 transition count 4973
Discarding 709 places :
Symmetric choice reduction at 6 with 709 rule applications. Total rules 8300 place count 1956 transition count 4264
Iterating global reduction 6 with 709 rules applied. Total rules applied 9009 place count 1956 transition count 4264
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 254 Pre rules applied. Total rules applied 9009 place count 1956 transition count 4010
Deduced a syphon composed of 254 places in 24 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 6 with 508 rules applied. Total rules applied 9517 place count 1702 transition count 4010
Discarding 85 places :
Symmetric choice reduction at 6 with 85 rule applications. Total rules 9602 place count 1617 transition count 2995
Iterating global reduction 6 with 85 rules applied. Total rules applied 9687 place count 1617 transition count 2995
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 9758 place count 1617 transition count 2924
Performed 398 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 7 with 796 rules applied. Total rules applied 10554 place count 1219 transition count 2523
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 10558 place count 1219 transition count 2519
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 10559 place count 1218 transition count 2478
Iterating global reduction 8 with 1 rules applied. Total rules applied 10560 place count 1218 transition count 2478
Performed 101 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 10762 place count 1117 transition count 2683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 10766 place count 1117 transition count 2679
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 10794 place count 1089 transition count 2511
Iterating global reduction 9 with 28 rules applied. Total rules applied 10822 place count 1089 transition count 2511
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 9 with 73 rules applied. Total rules applied 10895 place count 1089 transition count 2438
Performed 60 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 10 with 120 rules applied. Total rules applied 11015 place count 1029 transition count 2776
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 10 with 62 rules applied. Total rules applied 11077 place count 1029 transition count 2714
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 11084 place count 1022 transition count 2669
Iterating global reduction 11 with 7 rules applied. Total rules applied 11091 place count 1022 transition count 2669
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 11115 place count 1022 transition count 2645
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 12 with 82 rules applied. Total rules applied 11197 place count 1022 transition count 2563
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 11202 place count 1017 transition count 2558
Iterating global reduction 12 with 5 rules applied. Total rules applied 11207 place count 1017 transition count 2558
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 11212 place count 1012 transition count 2321
Iterating global reduction 12 with 5 rules applied. Total rules applied 11217 place count 1012 transition count 2321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 11222 place count 1012 transition count 2316
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 11228 place count 1009 transition count 2313
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 11231 place count 1006 transition count 2172
Iterating global reduction 13 with 3 rules applied. Total rules applied 11234 place count 1006 transition count 2172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 11237 place count 1006 transition count 2169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 11241 place count 1004 transition count 2174
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 11243 place count 1004 transition count 2172
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 11248 place count 1004 transition count 2167
Free-agglomeration rule applied 518 times with reduction of 275 identical transitions.
Iterating global reduction 15 with 518 rules applied. Total rules applied 11766 place count 1004 transition count 1374
Reduce places removed 518 places and 0 transitions.
Drop transitions removed 578 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 589 transitions.
Graph (complete) has 1164 edges and 486 vertex of which 383 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.1 ms
Discarding 103 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Iterating post reduction 15 with 1108 rules applied. Total rules applied 12874 place count 383 transition count 695
Drop transitions removed 33 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 16 with 80 rules applied. Total rules applied 12954 place count 383 transition count 615
Discarding 63 places :
Symmetric choice reduction at 17 with 63 rule applications. Total rules 13017 place count 320 transition count 519
Iterating global reduction 17 with 63 rules applied. Total rules applied 13080 place count 320 transition count 519
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 13100 place count 320 transition count 499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 13102 place count 318 transition count 499
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 13104 place count 316 transition count 497
Iterating global reduction 18 with 2 rules applied. Total rules applied 13106 place count 316 transition count 497
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 13108 place count 316 transition count 495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 13110 place count 314 transition count 495
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 13112 place count 314 transition count 493
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 13114 place count 314 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 13116 place count 312 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 13117 place count 312 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 13118 place count 311 transition count 490
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 13121 place count 309 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 13122 place count 308 transition count 489
Performed 18 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 22 with 36 rules applied. Total rules applied 13158 place count 290 transition count 444
Drop transitions removed 28 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 22 with 64 rules applied. Total rules applied 13222 place count 290 transition count 380
Discarding 16 places :
Symmetric choice reduction at 23 with 16 rule applications. Total rules 13238 place count 274 transition count 354
Iterating global reduction 23 with 16 rules applied. Total rules applied 13254 place count 274 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 13255 place count 274 transition count 353
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 6 rules applied. Total rules applied 13261 place count 270 transition count 351
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 13266 place count 270 transition count 346
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 25 with 32 rules applied. Total rules applied 13298 place count 270 transition count 314
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 570 edges and 267 vertex of which 259 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Iterating post reduction 25 with 4 rules applied. Total rules applied 13302 place count 259 transition count 306
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 26 with 7 rules applied. Total rules applied 13309 place count 259 transition count 299
Discarding 19 places :
Symmetric choice reduction at 27 with 19 rule applications. Total rules 13328 place count 240 transition count 265
Iterating global reduction 27 with 19 rules applied. Total rules applied 13347 place count 240 transition count 265
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 13349 place count 240 transition count 263
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 13351 place count 238 transition count 263
Applied a total of 13351 rules in 1743 ms. Remains 238 /7058 variables (removed 6820) and now considering 263/9611 (removed 9348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1743 ms. Remains : 238/7058 places, 263/9611 transitions.
Finished random walk after 2199 steps, including 0 resets, run visited all 3 properties in 29 ms. (steps per millisecond=75 )
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32993 ms.
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: DLCshifumi_PT_3b
(NrP: 7058 NrTr: 9611 NrArc: 24573)

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

net check time: 0m 0.007sec

init dd package: 0m 2.658sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7284700 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101748 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.640sec

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="DLCshifumi-PT-3b"
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 DLCshifumi-PT-3b, 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 r106-tall-167814483300822"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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