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.r234-tall-167856420400534.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 LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 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 LeafsetExtension-PT-S64C3-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679528644086

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=LeafsetExtension-PT-S64C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:44:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:44:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:44:06] [INFO ] Load time of PNML (sax parser for PT used): 561 ms
[2023-03-22 23:44:06] [INFO ] Transformed 21462 places.
[2023-03-22 23:44:06] [INFO ] Transformed 21129 transitions.
[2023-03-22 23:44:06] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 715 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 388 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 23:44:10] [INFO ] Computed 333 place invariants in 2611 ms
[2023-03-22 23:44:16] [INFO ] After 5397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 23:44:21] [INFO ] [Nat]Absence check using 67 positive place invariants in 64 ms returned sat
[2023-03-22 23:44:22] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 970 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 23:44:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 23:44:41] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 226 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 12053 are kept as prefixes of interest. Removing 9409 places using SCC suffix rule.43 ms
Discarding 9409 places :
Also discarding 3267 output transitions
Drop transitions removed 3267 transitions
Drop transitions removed 1936 transitions
Reduce isomorphic transitions removed 1936 transitions.
Drop transitions removed 3371 transitions
Trivial Post-agglo rules discarded 3371 transitions
Performed 3371 trivial Post agglomeration. Transition count delta: 3371
Iterating post reduction 0 with 5307 rules applied. Total rules applied 5308 place count 12053 transition count 12555
Reduce places removed 3372 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 3414 rules applied. Total rules applied 8722 place count 8681 transition count 12513
Reduce places removed 42 places and 0 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 2 with 145 rules applied. Total rules applied 8867 place count 8639 transition count 12410
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 3 with 103 rules applied. Total rules applied 8970 place count 8536 transition count 12410
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 8970 place count 8536 transition count 12292
Deduced a syphon composed of 118 places in 5 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 9206 place count 8418 transition count 12292
Discarding 2128 places :
Symmetric choice reduction at 4 with 2128 rule applications. Total rules 11334 place count 6290 transition count 10164
Iterating global reduction 4 with 2128 rules applied. Total rules applied 13462 place count 6290 transition count 10164
Discarding 1954 places :
Symmetric choice reduction at 4 with 1954 rule applications. Total rules 15416 place count 4336 transition count 8210
Iterating global reduction 4 with 1954 rules applied. Total rules applied 17370 place count 4336 transition count 8210
Free-agglomeration rule (complex) applied 67 times.
Iterating global reduction 4 with 67 rules applied. Total rules applied 17437 place count 4336 transition count 8143
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 17504 place count 4269 transition count 8143
Partial Free-agglomeration rule applied 1033 times.
Drop transitions removed 1033 transitions
Iterating global reduction 5 with 1033 rules applied. Total rules applied 18537 place count 4269 transition count 8143
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 5 with 12 rules applied. Total rules applied 18549 place count 4257 transition count 8143
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 18559 place count 4257 transition count 8133
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 18569 place count 4247 transition count 8133
Applied a total of 18569 rules in 5977 ms. Remains 4247 /21462 variables (removed 17215) and now considering 8133/21129 (removed 12996) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5979 ms. Remains : 4247/21462 places, 8133/21129 transitions.
Incomplete random walk after 10000 steps, including 772 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 5) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 23:44:47] [INFO ] Flow matrix only has 7566 transitions (discarded 567 similar events)
// Phase 1: matrix 7566 rows 4247 cols
[2023-03-22 23:44:47] [INFO ] Computed 102 place invariants in 128 ms
[2023-03-22 23:44:48] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 23:44:48] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 40 ms returned sat
[2023-03-22 23:44:53] [INFO ] After 4004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 23:44:54] [INFO ] After 5542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1153 ms.
[2023-03-22 23:44:55] [INFO ] After 7373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 131 out of 4247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4247/4247 places, 8133/8133 transitions.
Graph (complete) has 19094 edges and 4247 vertex of which 3741 are kept as prefixes of interest. Removing 506 places using SCC suffix rule.3 ms
Discarding 506 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 457 transitions
Reduce isomorphic transitions removed 457 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 472 rules applied. Total rules applied 473 place count 3741 transition count 7639
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 488 place count 3726 transition count 7639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 488 place count 3726 transition count 7638
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 490 place count 3725 transition count 7638
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 509 place count 3706 transition count 7619
Iterating global reduction 2 with 19 rules applied. Total rules applied 528 place count 3706 transition count 7619
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 529 place count 3705 transition count 7618
Iterating global reduction 2 with 1 rules applied. Total rules applied 530 place count 3705 transition count 7618
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 532 place count 3705 transition count 7616
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 534 place count 3703 transition count 7616
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 3 with 206 rules applied. Total rules applied 740 place count 3703 transition count 7616
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 3 with 9 rules applied. Total rules applied 749 place count 3694 transition count 7616
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 765 place count 3678 transition count 7600
Iterating global reduction 4 with 16 rules applied. Total rules applied 781 place count 3678 transition count 7600
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 787 place count 3678 transition count 7594
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 793 place count 3672 transition count 7594
Applied a total of 793 rules in 3128 ms. Remains 3672 /4247 variables (removed 575) and now considering 7594/8133 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3128 ms. Remains : 3672/4247 places, 7594/8133 transitions.
Incomplete random walk after 10000 steps, including 797 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 20541 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20541 steps, saw 10931 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 23:45:02] [INFO ] Flow matrix only has 6580 transitions (discarded 1014 similar events)
// Phase 1: matrix 6580 rows 3672 cols
[2023-03-22 23:45:02] [INFO ] Computed 100 place invariants in 69 ms
[2023-03-22 23:45:02] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 23:45:03] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 37 ms returned sat
[2023-03-22 23:45:06] [INFO ] After 3479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 23:45:08] [INFO ] After 5033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1153 ms.
[2023-03-22 23:45:09] [INFO ] After 6801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 131 out of 3672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3672/3672 places, 7594/7594 transitions.
Applied a total of 0 rules in 420 ms. Remains 3672 /3672 variables (removed 0) and now considering 7594/7594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 3672/3672 places, 7594/7594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3672/3672 places, 7594/7594 transitions.
Applied a total of 0 rules in 418 ms. Remains 3672 /3672 variables (removed 0) and now considering 7594/7594 (removed 0) transitions.
[2023-03-22 23:45:10] [INFO ] Flow matrix only has 6580 transitions (discarded 1014 similar events)
[2023-03-22 23:45:10] [INFO ] Invariant cache hit.
[2023-03-22 23:45:13] [INFO ] Implicit Places using invariants in 3266 ms returned [80, 117, 227, 340, 377, 485, 524, 562, 672, 742, 782, 892, 929, 999, 1036, 1112, 1221, 1332, 1371, 1445, 1635, 1747, 1782, 1818, 1852, 1925, 2001, 2075, 2147, 2150, 2184, 2223, 2261, 2296, 2299, 2334, 2337, 2371, 2378, 2412, 2493, 2496, 2531, 2570, 2606, 2640, 2712, 2755, 2827, 2830, 2864, 2904, 2909, 2943, 2979, 3013, 3049, 3083, 3158, 3198, 3233, 3305, 3379, 3383, 3417, 3454, 3489, 3492, 3528, 3567, 3603]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 3273 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3601/3672 places, 7594/7594 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 3601 transition count 7581
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 3588 transition count 7581
Discarding 1957 places :
Symmetric choice reduction at 0 with 1957 rule applications. Total rules 1983 place count 1631 transition count 5624
Iterating global reduction 0 with 1957 rules applied. Total rules applied 3940 place count 1631 transition count 5624
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 3977 place count 1594 transition count 5587
Iterating global reduction 0 with 37 rules applied. Total rules applied 4014 place count 1594 transition count 5587
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 4055 place count 1553 transition count 5546
Iterating global reduction 0 with 41 rules applied. Total rules applied 4096 place count 1553 transition count 5546
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 4194 place count 1504 transition count 5497
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 4226 place count 1504 transition count 5465
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 4258 place count 1472 transition count 5465
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4259 place count 1472 transition count 5465
Applied a total of 4259 rules in 1411 ms. Remains 1472 /3601 variables (removed 2129) and now considering 5465/7594 (removed 2129) transitions.
[2023-03-22 23:45:15] [INFO ] Flow matrix only has 3285 transitions (discarded 2180 similar events)
// Phase 1: matrix 3285 rows 1472 cols
[2023-03-22 23:45:15] [INFO ] Computed 29 place invariants in 21 ms
[2023-03-22 23:45:16] [INFO ] Implicit Places using invariants in 994 ms returned []
[2023-03-22 23:45:16] [INFO ] Flow matrix only has 3285 transitions (discarded 2180 similar events)
[2023-03-22 23:45:16] [INFO ] Invariant cache hit.
[2023-03-22 23:45:27] [INFO ] Implicit Places using invariants and state equation in 10821 ms returned [44, 47, 51, 54, 94, 100, 111, 147, 150, 157, 193, 200, 205, 212, 248, 284, 286, 291, 334, 337, 340, 376, 379, 388, 391, 398, 435, 475, 478, 482, 487, 531, 538, 548, 587, 590, 631, 634, 673, 747, 832, 918, 978, 1236, 1277, 1356, 1396, 1441]
Discarding 48 places :
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Implicit Place search using SMT with State Equation took 11825 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1424/3672 places, 5318/7594 transitions.
Graph (complete) has 5254 edges and 1424 vertex of which 1277 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.3 ms
Discarding 147 places :
Also discarding 0 output transitions
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 1 place count 1277 transition count 5303
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 1262 transition count 5303
Discarding 777 places :
Symmetric choice reduction at 0 with 777 rule applications. Total rules 808 place count 485 transition count 4526
Iterating global reduction 0 with 777 rules applied. Total rules applied 1585 place count 485 transition count 4526
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 1621 place count 467 transition count 4508
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 1653 place count 467 transition count 4476
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 1685 place count 435 transition count 4476
Applied a total of 1685 rules in 196 ms. Remains 435 /1424 variables (removed 989) and now considering 4476/5318 (removed 842) transitions.
[2023-03-22 23:45:27] [INFO ] Flow matrix only has 2149 transitions (discarded 2327 similar events)
// Phase 1: matrix 2149 rows 435 cols
[2023-03-22 23:45:27] [INFO ] Computed 29 place invariants in 17 ms
[2023-03-22 23:45:27] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-22 23:45:27] [INFO ] Flow matrix only has 2149 transitions (discarded 2327 similar events)
[2023-03-22 23:45:27] [INFO ] Invariant cache hit.
[2023-03-22 23:45:28] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 435/3672 places, 4476/7594 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 18410 ms. Remains : 435/3672 places, 4476/7594 transitions.
Incomplete random walk after 10000 steps, including 1222 resets, run finished after 1398 ms. (steps per millisecond=7 ) properties (out of 3) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 23:45:30] [INFO ] Flow matrix only has 2149 transitions (discarded 2327 similar events)
[2023-03-22 23:45:30] [INFO ] Invariant cache hit.
[2023-03-22 23:45:30] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:45:30] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 23:45:30] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:45:30] [INFO ] After 827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-22 23:45:31] [INFO ] After 1138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 124 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 4476/4476 transitions.
Graph (complete) has 3537 edges and 435 vertex of which 425 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 423 transition count 4464
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 423 transition count 4464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 422 transition count 4463
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 422 transition count 4463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 419 transition count 4460
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 419 transition count 4460
Applied a total of 16 rules in 193 ms. Remains 419 /435 variables (removed 16) and now considering 4460/4476 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 419/435 places, 4460/4476 transitions.
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 1300 ms. (steps per millisecond=7 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 139802 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139802 steps, saw 52736 distinct states, run finished after 3006 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 23:45:35] [INFO ] Flow matrix only has 2067 transitions (discarded 2393 similar events)
// Phase 1: matrix 2067 rows 419 cols
[2023-03-22 23:45:35] [INFO ] Computed 29 place invariants in 20 ms
[2023-03-22 23:45:35] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:45:35] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-22 23:45:36] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:45:36] [INFO ] After 814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-22 23:45:37] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 124 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 4460/4460 transitions.
Applied a total of 0 rules in 70 ms. Remains 419 /419 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 419/419 places, 4460/4460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 4460/4460 transitions.
Applied a total of 0 rules in 70 ms. Remains 419 /419 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
[2023-03-22 23:45:37] [INFO ] Flow matrix only has 2067 transitions (discarded 2393 similar events)
[2023-03-22 23:45:37] [INFO ] Invariant cache hit.
[2023-03-22 23:45:37] [INFO ] Implicit Places using invariants in 373 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 376 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 418/419 places, 4460/4460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 417 transition count 4459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 417 transition count 4459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 416 transition count 4458
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 416 transition count 4458
Applied a total of 4 rules in 100 ms. Remains 416 /418 variables (removed 2) and now considering 4458/4460 (removed 2) transitions.
[2023-03-22 23:45:37] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
// Phase 1: matrix 2035 rows 416 cols
[2023-03-22 23:45:37] [INFO ] Computed 28 place invariants in 18 ms
[2023-03-22 23:45:38] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-22 23:45:38] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
[2023-03-22 23:45:38] [INFO ] Invariant cache hit.
[2023-03-22 23:45:38] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 416/419 places, 4458/4460 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1875 ms. Remains : 416/419 places, 4458/4460 transitions.
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 1327 ms. (steps per millisecond=7 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 144866 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144866 steps, saw 54197 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 23:45:43] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
[2023-03-22 23:45:43] [INFO ] Invariant cache hit.
[2023-03-22 23:45:43] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:45:43] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 5 ms returned sat
[2023-03-22 23:45:44] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:45:44] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-22 23:45:44] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 124 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 70 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 416/416 places, 4458/4458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 70 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
[2023-03-22 23:45:44] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
[2023-03-22 23:45:44] [INFO ] Invariant cache hit.
[2023-03-22 23:45:45] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-22 23:45:45] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
[2023-03-22 23:45:45] [INFO ] Invariant cache hit.
[2023-03-22 23:45:45] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-22 23:45:46] [INFO ] Redundant transitions in 415 ms returned []
[2023-03-22 23:45:46] [INFO ] Flow matrix only has 2035 transitions (discarded 2423 similar events)
[2023-03-22 23:45:46] [INFO ] Invariant cache hit.
[2023-03-22 23:45:47] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3005 ms. Remains : 416/416 places, 4458/4458 transitions.
Drop transitions removed 1260 transitions
Ensure Unique test removed 1196 transitions
Reduce isomorphic transitions removed 2456 transitions.
Iterating post reduction 0 with 2456 rules applied. Total rules applied 2456 place count 416 transition count 2002
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 2456 place count 416 transition count 1976
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 52 rules applied. Total rules applied 2508 place count 390 transition count 1976
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2510 place count 388 transition count 1924
Iterating global reduction 1 with 2 rules applied. Total rules applied 2512 place count 388 transition count 1924
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 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2516 place count 386 transition count 1922
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 2525 place count 386 transition count 1913
Free-agglomeration rule (complex) applied 96 times.
Iterating global reduction 1 with 96 rules applied. Total rules applied 2621 place count 386 transition count 1817
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 2717 place count 290 transition count 1817
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 2727 place count 290 transition count 1807
Partial Free-agglomeration rule applied 443 times.
Drop transitions removed 443 transitions
Iterating global reduction 2 with 443 rules applied. Total rules applied 3170 place count 290 transition count 1807
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 3183 place count 290 transition count 1794
Applied a total of 3183 rules in 81 ms. Remains 290 /416 variables (removed 126) and now considering 1794/4458 (removed 2664) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1794 rows 290 cols
[2023-03-22 23:45:47] [INFO ] Computed 28 place invariants in 10 ms
[2023-03-22 23:45:47] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 23:45:47] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-22 23:45:48] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 23:45:48] [INFO ] After 932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-22 23:45:49] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 23:45:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 23:45:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 416 places, 4458 transitions and 21058 arcs took 22 ms.
[2023-03-22 23:45:49] [INFO ] Flatten gal took : 347 ms
Total runtime 104129 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 416 NrTr: 4458 NrArc: 21058)

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

net check time: 0m 0.003sec

init dd package: 0m 2.676sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9512476 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16081244 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.015sec

97343 181076 244742 252022 316330 316699 373488 428197 434004 440788 490849 494409 504821 505274 492736 575209 549604 535594 587271 552471 546414 547706 699235 709934 760263 820990 779643 777654 825371 786356 778877 929756 974511 1025716 1215084 1262029 1346491 1485353 1425218 1422463 1559275 1682739 1757175 1872360 1978792 1912548 1888421 2159438 2245335

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="LeafsetExtension-PT-S64C3"
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 LeafsetExtension-PT-S64C3, 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 r234-tall-167856420400534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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