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.r458-smll-167912650600662.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 StigmergyElection-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 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 StigmergyElection-PT-08b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679584090793

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=StigmergyElection-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 15:08:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 15:08:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:08:16] [INFO ] Load time of PNML (sax parser for PT used): 1037 ms
[2023-03-23 15:08:16] [INFO ] Transformed 1107 places.
[2023-03-23 15:08:16] [INFO ] Transformed 14564 transitions.
[2023-03-23 15:08:16] [INFO ] Found NUPN structural information;
[2023-03-23 15:08:16] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 1312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 1027 ms. (steps per millisecond=9 ) properties (out of 13) seen :6
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 14564 rows 1107 cols
[2023-03-23 15:08:19] [INFO ] Computed 9 place invariants in 475 ms
[2023-03-23 15:08:21] [INFO ] After 1594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 15:08:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2023-03-23 15:08:32] [INFO ] After 10333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 15:08:42] [INFO ] Deduced a trap composed of 195 places in 9825 ms of which 19 ms to minimize.
[2023-03-23 15:08:52] [INFO ] Deduced a trap composed of 189 places in 9242 ms of which 2 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-23 15:08:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 15:08:52] [INFO ] After 31278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 276 ms.
Support contains 40 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Graph (trivial) has 1058 edges and 1107 vertex of which 139 / 1107 are part of one of the 21 SCC in 12 ms
Free SCC test removed 118 places
Drop transitions removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Graph (complete) has 2423 edges and 989 vertex of which 976 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.161 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 651 transitions
Trivial Post-agglo rules discarded 651 transitions
Performed 651 trivial Post agglomeration. Transition count delta: 651
Iterating post reduction 0 with 657 rules applied. Total rules applied 659 place count 976 transition count 13751
Reduce places removed 651 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 683 rules applied. Total rules applied 1342 place count 325 transition count 13719
Reduce places removed 16 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 34 rules applied. Total rules applied 1376 place count 309 transition count 13701
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1394 place count 291 transition count 13701
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1394 place count 291 transition count 13678
Deduced a syphon composed of 23 places in 29 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1440 place count 268 transition count 13678
Discarding 56 places :
Symmetric choice reduction at 4 with 56 rule applications. Total rules 1496 place count 212 transition count 13622
Iterating global reduction 4 with 56 rules applied. Total rules applied 1552 place count 212 transition count 13622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1556 place count 212 transition count 13618
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1558 place count 210 transition count 13618
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1558 place count 210 transition count 13615
Deduced a syphon composed of 3 places in 25 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1564 place count 207 transition count 13615
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1580 place count 191 transition count 1435
Iterating global reduction 6 with 16 rules applied. Total rules applied 1596 place count 191 transition count 1435
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1604 place count 191 transition count 1427
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 1656 place count 165 transition count 1401
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1657 place count 165 transition count 1400
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1659 place count 163 transition count 1398
Iterating global reduction 8 with 2 rules applied. Total rules applied 1661 place count 163 transition count 1398
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1679 place count 154 transition count 1405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1682 place count 154 transition count 1402
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 1696 place count 154 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1698 place count 153 transition count 1394
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1706 place count 153 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1708 place count 152 transition count 1392
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1716 place count 152 transition count 1384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1718 place count 151 transition count 1390
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1726 place count 151 transition count 1382
Free-agglomeration rule applied 45 times.
Iterating global reduction 9 with 45 rules applied. Total rules applied 1771 place count 151 transition count 1337
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 9 with 45 rules applied. Total rules applied 1816 place count 106 transition count 1337
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1823 place count 99 transition count 1330
Iterating global reduction 10 with 7 rules applied. Total rules applied 1830 place count 99 transition count 1330
Drop transitions removed 323 transitions
Redundant transition composition rules discarded 323 transitions
Iterating global reduction 10 with 323 rules applied. Total rules applied 2153 place count 99 transition count 1007
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2154 place count 99 transition count 1007
Applied a total of 2154 rules in 5233 ms. Remains 99 /1107 variables (removed 1008) and now considering 1007/14564 (removed 13557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5235 ms. Remains : 99/1107 places, 1007/14564 transitions.
Incomplete random walk after 10000 steps, including 379 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 7) seen :1
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1007 rows 99 cols
[2023-03-23 15:08:58] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-23 15:08:58] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 15:08:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-23 15:08:59] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 15:08:59] [INFO ] State equation strengthened by 870 read => feed constraints.
[2023-03-23 15:09:00] [INFO ] After 1426ms SMT Verify possible using 870 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 15:09:01] [INFO ] Deduced a trap composed of 15 places in 465 ms of which 1 ms to minimize.
[2023-03-23 15:09:02] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2023-03-23 15:09:02] [INFO ] Deduced a trap composed of 16 places in 392 ms of which 1 ms to minimize.
[2023-03-23 15:09:03] [INFO ] Deduced a trap composed of 19 places in 796 ms of which 1 ms to minimize.
[2023-03-23 15:09:03] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2023-03-23 15:09:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2535 ms
[2023-03-23 15:09:04] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 1 ms to minimize.
[2023-03-23 15:09:04] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 1 ms to minimize.
[2023-03-23 15:09:04] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 1 ms to minimize.
[2023-03-23 15:09:05] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 0 ms to minimize.
[2023-03-23 15:09:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1254 ms
[2023-03-23 15:09:05] [INFO ] After 5809ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-23 15:09:05] [INFO ] After 7109ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 7 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 1007/1007 transitions.
Graph (trivial) has 67 edges and 99 vertex of which 8 / 99 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 457 edges and 95 vertex of which 93 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 93 transition count 973
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 70 transition count 967
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 68 transition count 966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 67 transition count 966
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 60 place count 67 transition count 962
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 63 transition count 962
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 74 place count 57 transition count 956
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 57 transition count 956
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 55 transition count 954
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 55 transition count 954
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 98 place count 48 transition count 947
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 103 place count 48 transition count 942
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 107 place count 44 transition count 938
Iterating global reduction 5 with 4 rules applied. Total rules applied 111 place count 44 transition count 938
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 115 place count 44 transition count 934
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 117 place count 43 transition count 940
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 140 place count 43 transition count 917
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 149 place count 43 transition count 908
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 57 rules applied. Total rules applied 206 place count 34 transition count 860
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 7 with 60 rules applied. Total rules applied 266 place count 34 transition count 800
Applied a total of 266 rules in 816 ms. Remains 34 /99 variables (removed 65) and now considering 800/1007 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 34/99 places, 800/1007 transitions.
Finished random walk after 274 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=22 )
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 51390 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: StigmergyElection_PT_08b
(NrP: 1107 NrTr: 14564 NrArc: 216524)

parse formulas
formulas created successfully
place and transition orderings generation:0m28.514sec

net check time: 0m 0.038sec

init dd package: 0m 3.389sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8395716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092780 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 3.672sec

381777 424181 428566 430712 423525 491255 523043 507755 512244 457128 482465 509561 509764 576177 500793

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="StigmergyElection-PT-08b"
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 StigmergyElection-PT-08b, 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 r458-smll-167912650600662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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