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.r170-tall-167838856700054.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 Echo-PT-d02r09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K 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 Echo-PT-d02r09-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678464802952

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=Echo-PT-d02r09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 16:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:13:24] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-10 16:13:24] [INFO ] Transformed 735 places.
[2023-03-10 16:13:24] [INFO ] Transformed 570 transitions.
[2023-03-10 16:13:24] [INFO ] Found NUPN structural information;
[2023-03-10 16:13:24] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 14) seen :11
FORMULA Echo-PT-d02r09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 570 rows 735 cols
[2023-03-10 16:13:25] [INFO ] Computed 369 place invariants in 50 ms
[2023-03-10 16:13:25] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 16:13:25] [INFO ] [Nat]Absence check using 85 positive place invariants in 26 ms returned sat
[2023-03-10 16:13:26] [INFO ] [Nat]Absence check using 85 positive and 284 generalized place invariants in 60 ms returned sat
[2023-03-10 16:13:36] [INFO ] After 10037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 16:13:36] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 5 ms to minimize.
[2023-03-10 16:13:36] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-10 16:13:36] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-10 16:13:37] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-10 16:13:37] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-10 16:13:37] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-10 16:13:37] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2023-03-10 16:13:37] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-10 16:13:38] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2023-03-10 16:13:38] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-10 16:13:38] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-10 16:13:38] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-10 16:13:39] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-03-10 16:13:39] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2023-03-10 16:13:39] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2023-03-10 16:13:39] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-03-10 16:13:39] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-10 16:13:40] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2023-03-10 16:13:40] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-10 16:13:40] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2023-03-10 16:13:40] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2023-03-10 16:13:41] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-10 16:13:41] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-10 16:13:41] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-10 16:13:41] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2023-03-10 16:13:41] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-10 16:13:42] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2023-03-10 16:13:42] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2023-03-10 16:13:42] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-10 16:13:42] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-10 16:13:43] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-10 16:13:43] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-10 16:13:43] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2023-03-10 16:13:43] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2023-03-10 16:13:44] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-10 16:13:44] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-10 16:13:44] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2023-03-10 16:13:44] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-10 16:13:45] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-10 16:13:45] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-10 16:13:45] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-10 16:13:45] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2023-03-10 16:13:46] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2023-03-10 16:13:46] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-10 16:13:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2023-03-10 16:13:46] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-10 16:13:47] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2023-03-10 16:13:47] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2023-03-10 16:13:47] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-10 16:13:47] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-10 16:13:48] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-10 16:13:48] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-10 16:13:49] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2023-03-10 16:13:49] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2023-03-10 16:13:50] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2023-03-10 16:13:50] [INFO ] Deduced a trap composed of 18 places in 143 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-10 16:13:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 16:13:50] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 13 ms.
Support contains 93 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 570/570 transitions.
Graph (complete) has 2466 edges and 735 vertex of which 658 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.4 ms
Discarding 77 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 658 transition count 570
Applied a total of 3 rules in 119 ms. Remains 658 /735 variables (removed 77) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 658/735 places, 570/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 658 cols
[2023-03-10 16:13:51] [INFO ] Computed 292 place invariants in 160 ms
[2023-03-10 16:13:51] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:13:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-10 16:13:52] [INFO ] [Nat]Absence check using 11 positive and 281 generalized place invariants in 404 ms returned sat
[2023-03-10 16:13:57] [INFO ] After 4915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:13:57] [INFO ] After 5532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 596 ms.
[2023-03-10 16:13:58] [INFO ] After 6741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 54 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1919 edges and 658 vertex of which 648 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 648 transition count 566
Applied a total of 4 rules in 63 ms. Remains 648 /658 variables (removed 10) and now considering 566/570 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 648/658 places, 566/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 648 cols
[2023-03-10 16:13:58] [INFO ] Computed 283 place invariants in 123 ms
[2023-03-10 16:13:58] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:13:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-10 16:13:59] [INFO ] [Nat]Absence check using 6 positive and 277 generalized place invariants in 399 ms returned sat
[2023-03-10 16:14:09] [INFO ] After 9930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:14:09] [INFO ] After 10237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-10 16:14:09] [INFO ] After 11133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 31 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 566/566 transitions.
Graph (complete) has 1878 edges and 648 vertex of which 647 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 647 /648 variables (removed 1) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 647/648 places, 566/566 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 689150 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 689150 steps, saw 121164 distinct states, run finished after 3002 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 647 cols
[2023-03-10 16:14:13] [INFO ] Computed 282 place invariants in 115 ms
[2023-03-10 16:14:13] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:14:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-10 16:14:13] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 547 ms returned sat
[2023-03-10 16:14:26] [INFO ] After 12616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:14:26] [INFO ] After 12855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-10 16:14:27] [INFO ] After 14005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 31 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 647/647 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 17 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-03-10 16:14:27] [INFO ] Invariant cache hit.
[2023-03-10 16:14:29] [INFO ] Implicit Places using invariants in 1740 ms returned []
[2023-03-10 16:14:29] [INFO ] Invariant cache hit.
[2023-03-10 16:14:35] [INFO ] Implicit Places using invariants and state equation in 5898 ms returned []
Implicit Place search using SMT with State Equation took 7648 ms to find 0 implicit places.
[2023-03-10 16:14:35] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-10 16:14:35] [INFO ] Invariant cache hit.
[2023-03-10 16:14:36] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8740 ms. Remains : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 16:14:36] [INFO ] Invariant cache hit.
[2023-03-10 16:14:36] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:14:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 16:14:36] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 452 ms returned sat
[2023-03-10 16:14:48] [INFO ] After 11553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:14:48] [INFO ] After 11798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-10 16:14:49] [INFO ] After 12845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:14:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-10 16:14:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 647 places, 566 transitions and 2902 arcs took 4 ms.
[2023-03-10 16:14:49] [INFO ] Flatten gal took : 93 ms
Total runtime 84909 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: Echo_PT_d02r09
(NrP: 647 NrTr: 566 NrArc: 2902)

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

net check time: 0m 0.000sec

init dd package: 0m 2.762sec


before gc: list nodes free: 1882828

after gc: idd nodes used:1172381, unused:62827619; list nodes free:267548456
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6457484 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099924 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.005sec

231775 329424 343110 526572 522930 523515 977619 1029764 1027055 1020957 1006367 1263418 1234258 1230494 1246017 1198374 1198508 1151040 1201108 1289145 1200312 1232625 3576567 3743268 3740825 4101366

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="Echo-PT-d02r09"
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 Echo-PT-d02r09, 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 r170-tall-167838856700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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