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.r105-tall-167814481700790.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 ltsminxred
Input is DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481700790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.3K Feb 25 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:45 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.6K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 DLCround-PT-13b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678380729415

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 16:52:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 16:52:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:52:11] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-09 16:52:11] [INFO ] Transformed 5343 places.
[2023-03-09 16:52:11] [INFO ] Transformed 8727 transitions.
[2023-03-09 16:52:11] [INFO ] Found NUPN structural information;
[2023-03-09 16:52:11] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 13) seen :3
FORMULA DLCround-PT-13b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 8727 rows 5343 cols
[2023-03-09 16:52:12] [INFO ] Computed 312 place invariants in 72 ms
[2023-03-09 16:52:15] [INFO ] After 2212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 16:52:17] [INFO ] [Nat]Absence check using 312 positive place invariants in 365 ms returned sat
[2023-03-09 16:52:25] [INFO ] After 7277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 16:52:27] [INFO ] Deduced a trap composed of 333 places in 1673 ms of which 20 ms to minimize.
[2023-03-09 16:52:29] [INFO ] Deduced a trap composed of 171 places in 1503 ms of which 3 ms to minimize.
[2023-03-09 16:52:30] [INFO ] Deduced a trap composed of 271 places in 1308 ms of which 2 ms to minimize.
[2023-03-09 16:52:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5683 ms
[2023-03-09 16:52:34] [INFO ] Deduced a trap composed of 155 places in 2720 ms of which 4 ms to minimize.
[2023-03-09 16:52:38] [INFO ] Deduced a trap composed of 286 places in 2734 ms of which 4 ms to minimize.
[2023-03-09 16:52:41] [INFO ] Deduced a trap composed of 155 places in 2525 ms of which 3 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-09 16:52:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:52:41] [INFO ] After 25964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA DLCround-PT-13b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 449 ms.
Support contains 48 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4790 edges and 5343 vertex of which 790 / 5343 are part of one of the 61 SCC in 15 ms
Free SCC test removed 729 places
Drop transitions removed 817 transitions
Reduce isomorphic transitions removed 817 transitions.
Drop transitions removed 1869 transitions
Trivial Post-agglo rules discarded 1869 transitions
Performed 1869 trivial Post agglomeration. Transition count delta: 1869
Iterating post reduction 0 with 1869 rules applied. Total rules applied 1870 place count 4614 transition count 6041
Reduce places removed 1869 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1963 rules applied. Total rules applied 3833 place count 2745 transition count 5947
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 48 rules applied. Total rules applied 3881 place count 2705 transition count 5939
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 3906 place count 2701 transition count 5918
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 3927 place count 2680 transition count 5918
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 3927 place count 2680 transition count 5894
Deduced a syphon composed of 24 places in 43 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 3975 place count 2656 transition count 5894
Discarding 716 places :
Symmetric choice reduction at 5 with 716 rule applications. Total rules 4691 place count 1940 transition count 5178
Iterating global reduction 5 with 716 rules applied. Total rules applied 5407 place count 1940 transition count 5178
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 309 Pre rules applied. Total rules applied 5407 place count 1940 transition count 4869
Deduced a syphon composed of 309 places in 37 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 5 with 618 rules applied. Total rules applied 6025 place count 1631 transition count 4869
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 6119 place count 1537 transition count 3292
Iterating global reduction 5 with 94 rules applied. Total rules applied 6213 place count 1537 transition count 3292
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 6243 place count 1537 transition count 3262
Performed 403 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 403 places in 2 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 6 with 806 rules applied. Total rules applied 7049 place count 1134 transition count 2847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 7061 place count 1134 transition count 2835
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 7064 place count 1131 transition count 2784
Iterating global reduction 7 with 3 rules applied. Total rules applied 7067 place count 1131 transition count 2784
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -406
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 7165 place count 1082 transition count 3190
Drop transitions removed 49 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 7218 place count 1082 transition count 3137
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 7222 place count 1078 transition count 3018
Iterating global reduction 8 with 4 rules applied. Total rules applied 7226 place count 1078 transition count 3018
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 7230 place count 1078 transition count 3014
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 7236 place count 1075 transition count 3053
Drop transitions removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 9 with 86 rules applied. Total rules applied 7322 place count 1075 transition count 2967
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 7342 place count 1055 transition count 2947
Iterating global reduction 9 with 20 rules applied. Total rules applied 7362 place count 1055 transition count 2947
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 7382 place count 1035 transition count 2572
Iterating global reduction 9 with 20 rules applied. Total rules applied 7402 place count 1035 transition count 2572
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 7422 place count 1035 transition count 2552
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 7452 place count 1020 transition count 2537
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 7466 place count 1006 transition count 2267
Iterating global reduction 10 with 14 rules applied. Total rules applied 7480 place count 1006 transition count 2267
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 7493 place count 1006 transition count 2254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 7497 place count 1004 transition count 2268
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 7499 place count 1004 transition count 2266
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 12 with 15 rules applied. Total rules applied 7514 place count 1004 transition count 2251
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 7518 place count 1002 transition count 2265
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 7520 place count 1002 transition count 2263
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 13 with 14 rules applied. Total rules applied 7534 place count 1002 transition count 2249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 7538 place count 1000 transition count 2263
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 7540 place count 1000 transition count 2261
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 14 with 14 rules applied. Total rules applied 7554 place count 1000 transition count 2247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 7558 place count 998 transition count 2264
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 7560 place count 998 transition count 2262
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 7570 place count 998 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 7572 place count 997 transition count 2264
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 7573 place count 997 transition count 2263
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 7574 place count 997 transition count 2262
Free-agglomeration rule applied 530 times with reduction of 265 identical transitions.
Iterating global reduction 16 with 530 rules applied. Total rules applied 8104 place count 997 transition count 1467
Reduce places removed 530 places and 0 transitions.
Drop transitions removed 660 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 667 transitions.
Graph (complete) has 1152 edges and 467 vertex of which 377 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1198 rules applied. Total rules applied 9302 place count 377 transition count 800
Drop transitions removed 28 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 17 with 50 rules applied. Total rules applied 9352 place count 377 transition count 750
Discarding 111 places :
Symmetric choice reduction at 18 with 111 rule applications. Total rules 9463 place count 266 transition count 599
Iterating global reduction 18 with 111 rules applied. Total rules applied 9574 place count 266 transition count 599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 9578 place count 264 transition count 620
Drop transitions removed 16 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 9598 place count 264 transition count 600
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 19 with 59 rules applied. Total rules applied 9657 place count 264 transition count 541
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 719 edges and 262 vertex of which 260 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 3 rules applied. Total rules applied 9660 place count 260 transition count 541
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 9663 place count 260 transition count 538
Discarding 10 places :
Symmetric choice reduction at 21 with 10 rule applications. Total rules 9673 place count 250 transition count 524
Iterating global reduction 21 with 10 rules applied. Total rules applied 9683 place count 250 transition count 524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 9687 place count 248 transition count 550
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 21 with 20 rules applied. Total rules applied 9707 place count 248 transition count 530
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 9708 place count 247 transition count 510
Iterating global reduction 22 with 1 rules applied. Total rules applied 9709 place count 247 transition count 510
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 9710 place count 247 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 9711 place count 246 transition count 509
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 9712 place count 246 transition count 509
Applied a total of 9712 rules in 2517 ms. Remains 246 /5343 variables (removed 5097) and now considering 509/8727 (removed 8218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2533 ms. Remains : 246/5343 places, 509/8727 transitions.
Finished random walk after 1359 steps, including 0 resets, run visited all 3 properties in 23 ms. (steps per millisecond=59 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33091 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/480/inv_0_ --invariant=/tmp/480/inv_1_ --invariant=/tmp/480/inv_2_ --invariant=/tmp/480/inv_3_ --invariant=/tmp/480/inv_4_ --invariant=/tmp/480/inv_5_ --invariant=/tmp/480/inv_6_ --invariant=/tmp/480/inv_7_ --invariant=/tmp/480/inv_8_ --invariant=/tmp/480/inv_9_ --invariant=/tmp/480/inv_10_ --invariant=/tmp/480/inv_11_ --invariant=/tmp/480/inv_12_ --invariant=/tmp/480/inv_13_ --invariant=/tmp/480/inv_14_ --invariant=/tmp/480/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13710588 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099864 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
mcc2023

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="DLCround-PT-13b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCround-PT-13b, 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 r105-tall-167814481700790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-13b.tgz
mv DLCround-PT-13b 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 ;