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-167814482900599.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 DLCflexbar-PT-7b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482900599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.5K Feb 25 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:59 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.9K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 25 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:52 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 14M 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 DLCflexbar-PT-7b-ReachabilityFireability-00
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-01
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-02
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-03
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-04
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-05
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-06
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-07
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-08
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-09
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-10
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-11
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-12
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-13
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-14
FORMULA_NAME DLCflexbar-PT-7b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678440665210

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-7b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 09:31:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 09:31:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:31:07] [INFO ] Load time of PNML (sax parser for PT used): 1014 ms
[2023-03-10 09:31:08] [INFO ] Transformed 35101 places.
[2023-03-10 09:31:08] [INFO ] Transformed 55507 transitions.
[2023-03-10 09:31:08] [INFO ] Found NUPN structural information;
[2023-03-10 09:31:10] [INFO ] Parsed PT model containing 35101 places and 55507 transitions and 156636 arcs in 3688 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-14 FALSE 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 55507 rows 35101 cols
[2023-03-10 09:31:17] [INFO ] Computed 2171 place invariants in 365 ms
[2023-03-10 09:31:42] [INFO ] [Real]Absence check using 2171 positive place invariants in 10312 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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 09:31:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 09:31:42] [INFO ] After 25161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 207 out of 35101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35101/35101 places, 55507/55507 transitions.
Graph (trivial) has 31231 edges and 35101 vertex of which 2054 / 35101 are part of one of the 146 SCC in 57 ms
Free SCC test removed 1908 places
Drop transitions removed 2164 transitions
Reduce isomorphic transitions removed 2164 transitions.
Drop transitions removed 15365 transitions
Trivial Post-agglo rules discarded 15365 transitions
Performed 15365 trivial Post agglomeration. Transition count delta: 15365
Iterating post reduction 0 with 15365 rules applied. Total rules applied 15366 place count 33193 transition count 37978
Reduce places removed 15365 places and 0 transitions.
Ensure Unique test removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 1 with 16038 rules applied. Total rules applied 31404 place count 17828 transition count 37305
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 2 with 539 rules applied. Total rules applied 31943 place count 17495 transition count 37099
Reduce places removed 103 places and 0 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Iterating post reduction 3 with 161 rules applied. Total rules applied 32104 place count 17392 transition count 37041
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 32162 place count 17334 transition count 37041
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 189 Pre rules applied. Total rules applied 32162 place count 17334 transition count 36852
Deduced a syphon composed of 189 places in 1938 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 32540 place count 17145 transition count 36852
Discarding 4813 places :
Symmetric choice reduction at 5 with 4813 rule applications. Total rules 37353 place count 12332 transition count 32039
Iterating global reduction 5 with 4813 rules applied. Total rules applied 42166 place count 12332 transition count 32039
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 21 rules applied. Total rules applied 42187 place count 12332 transition count 32018
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 11 rules applied. Total rules applied 42198 place count 12326 transition count 32013
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 42201 place count 12324 transition count 32012
Performed 2124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2124 Pre rules applied. Total rules applied 42201 place count 12324 transition count 29888
Deduced a syphon composed of 2124 places in 1791 ms
Reduce places removed 2124 places and 0 transitions.
Iterating global reduction 8 with 4248 rules applied. Total rules applied 46449 place count 10200 transition count 29888
Discarding 232 places :
Symmetric choice reduction at 8 with 232 rule applications. Total rules 46681 place count 9968 transition count 24881
Iterating global reduction 8 with 232 rules applied. Total rules applied 46913 place count 9968 transition count 24881
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 8 with 206 rules applied. Total rules applied 47119 place count 9968 transition count 24675
Performed 2488 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 2488 places in 15 ms
Reduce places removed 2488 places and 0 transitions.
Iterating global reduction 9 with 4976 rules applied. Total rules applied 52095 place count 7480 transition count 22182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 52100 place count 7480 transition count 22177
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 52102 place count 7478 transition count 21941
Iterating global reduction 10 with 2 rules applied. Total rules applied 52104 place count 7478 transition count 21941
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -798
Deduced a syphon composed of 101 places in 12 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 52306 place count 7377 transition count 22739
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 10 with 48 rules applied. Total rules applied 52354 place count 7377 transition count 22691
Discarding 45 places :
Symmetric choice reduction at 11 with 45 rule applications. Total rules 52399 place count 7332 transition count 21881
Iterating global reduction 11 with 45 rules applied. Total rules applied 52444 place count 7332 transition count 21881
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 11 with 43 rules applied. Total rules applied 52487 place count 7332 transition count 21838
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -784
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 52689 place count 7231 transition count 22622
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 12 with 25 rules applied. Total rules applied 52714 place count 7231 transition count 22597
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 52738 place count 7207 transition count 22165
Iterating global reduction 13 with 24 rules applied. Total rules applied 52762 place count 7207 transition count 22165
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 13 with 23 rules applied. Total rules applied 52785 place count 7207 transition count 22142
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -792
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 14 with 202 rules applied. Total rules applied 52987 place count 7106 transition count 22934
Drop transitions removed 2 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 53015 place count 7106 transition count 22906
Discarding 26 places :
Symmetric choice reduction at 15 with 26 rule applications. Total rules 53041 place count 7080 transition count 22438
Iterating global reduction 15 with 26 rules applied. Total rules applied 53067 place count 7080 transition count 22438
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 15 with 26 rules applied. Total rules applied 53093 place count 7080 transition count 22412
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -856
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 16 with 202 rules applied. Total rules applied 53295 place count 6979 transition count 23268
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 16 with 102 rules applied. Total rules applied 53397 place count 6979 transition count 23166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 53403 place count 6976 transition count 23202
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 53405 place count 6976 transition count 23200
Free-agglomeration rule applied 4220 times with reduction of 2038 identical transitions.
Iterating global reduction 18 with 4220 rules applied. Total rules applied 57625 place count 6976 transition count 16942
Reduce places removed 4220 places and 0 transitions.
Drop transitions removed 4618 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 4716 transitions.
Graph (complete) has 12654 edges and 2756 vertex of which 2648 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.8 ms
Discarding 108 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Iterating post reduction 18 with 8937 rules applied. Total rules applied 66562 place count 2648 transition count 12188
Drop transitions removed 614 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 622 transitions.
Iterating post reduction 19 with 622 rules applied. Total rules applied 67184 place count 2648 transition count 11566
Discarding 592 places :
Symmetric choice reduction at 20 with 592 rule applications. Total rules 67776 place count 2056 transition count 9119
Iterating global reduction 20 with 592 rules applied. Total rules applied 68368 place count 2056 transition count 9119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 68370 place count 2056 transition count 9117
Drop transitions removed 338 transitions
Redundant transition composition rules discarded 338 transitions
Iterating global reduction 21 with 338 rules applied. Total rules applied 68708 place count 2056 transition count 8779
Discarding 3 places :
Symmetric choice reduction at 21 with 3 rule applications. Total rules 68711 place count 2053 transition count 8776
Iterating global reduction 21 with 3 rules applied. Total rules applied 68714 place count 2053 transition count 8776
Discarding 3 places :
Symmetric choice reduction at 21 with 3 rule applications. Total rules 68717 place count 2050 transition count 8520
Iterating global reduction 21 with 3 rules applied. Total rules applied 68720 place count 2050 transition count 8520
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 68723 place count 2050 transition count 8517
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 22 with 18 rules applied. Total rules applied 68741 place count 2041 transition count 8508
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 68742 place count 2040 transition count 8422
Iterating global reduction 22 with 1 rules applied. Total rules applied 68743 place count 2040 transition count 8422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 68744 place count 2040 transition count 8421
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 23 with 14 rules applied. Total rules applied 68758 place count 2040 transition count 8407
Free-agglomeration rule applied 16 times.
Iterating global reduction 23 with 16 rules applied. Total rules applied 68774 place count 2040 transition count 8391
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 640 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 645 transitions.
Graph (complete) has 8184 edges and 2024 vertex of which 2018 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 23 with 662 rules applied. Total rules applied 69436 place count 2018 transition count 7742
Drop transitions removed 17 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 24 with 18 rules applied. Total rules applied 69454 place count 2018 transition count 7724
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 69476 place count 1996 transition count 7655
Iterating global reduction 25 with 22 rules applied. Total rules applied 69498 place count 1996 transition count 7655
Drop transitions removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 25 with 89 rules applied. Total rules applied 69587 place count 1996 transition count 7566
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 69591 place count 1992 transition count 7566
Discarding 32 places :
Symmetric choice reduction at 26 with 32 rule applications. Total rules 69623 place count 1960 transition count 7502
Iterating global reduction 26 with 32 rules applied. Total rules applied 69655 place count 1960 transition count 7502
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 69663 place count 1956 transition count 7531
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 26 with 36 rules applied. Total rules applied 69699 place count 1956 transition count 7495
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 69700 place count 1956 transition count 7582
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 27 with 81 rules applied. Total rules applied 69781 place count 1955 transition count 7502
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 28 with 6 rules applied. Total rules applied 69787 place count 1955 transition count 7496
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 28 with 14 rules applied. Total rules applied 69801 place count 1955 transition count 7496
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 28 with 4 rules applied. Total rules applied 69805 place count 1955 transition count 7492
Applied a total of 69805 rules in 28404 ms. Remains 1955 /35101 variables (removed 33146) and now considering 7492/55507 (removed 48015) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28406 ms. Remains : 1955/35101 places, 7492/55507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 14) seen :13
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 09:32:11] [INFO ] Flow matrix only has 1622 transitions (discarded 5870 similar events)
// Phase 1: matrix 1622 rows 1955 cols
[2023-03-10 09:32:11] [INFO ] Computed 1449 place invariants in 28 ms
[2023-03-10 09:32:12] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:32:12] [INFO ] [Nat]Absence check using 1449 positive place invariants in 291 ms returned sat
[2023-03-10 09:32:12] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA DLCflexbar-PT-7b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 66106 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCflexbar_PT_7b
(NrP: 35101 NrTr: 55507 NrArc: 156636)

parse formulas
formulas created successfully
place and transition orderings generation:7m16.511sec

net check time: 0m 0.024sec

init dd package: 0m 2.686sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498

before gc: list nodes free: 1901699

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837703

before gc: list nodes free: 1890914

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812538

before gc: list nodes free: 1881824

after gc: idd nodes used:22624, unused:63977376; list nodes free:257791328

before gc: list nodes free: 1873814

after gc: idd nodes used:25294, unused:63974706; list nodes free:257772638

before gc: list nodes free: 1866572

after gc: idd nodes used:27708, unused:63972292; list nodes free:257755740

before gc: list nodes free: 1859915

after gc: idd nodes used:29927, unused:63970073; list nodes free:257740207

before gc: list nodes free: 1853717

after gc: idd nodes used:31993, unused:63968007; list nodes free:257725745

before gc: list nodes free: 1847897

after gc: idd nodes used:33933, unused:63966067; list nodes free:257712165

BK_STOP 1678441513852

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m24.432sec

/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 470 Segmentation fault ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="DLCflexbar-PT-7b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DLCflexbar-PT-7b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482900599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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