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-167912650600695.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-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 14K Feb 26 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:41 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 124M 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-10b-ReachabilityFireability-00
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-01
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-02
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-03
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-04
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-05
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-06
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-07
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-08
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-09
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-10
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-11
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-12
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-13
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-14
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679609855593

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 22:17:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 22:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:17:46] [INFO ] Load time of PNML (sax parser for PT used): 6524 ms
[2023-03-23 22:17:46] [INFO ] Transformed 1379 places.
[2023-03-23 22:17:46] [INFO ] Transformed 120600 transitions.
[2023-03-23 22:17:46] [INFO ] Found NUPN structural information;
[2023-03-23 22:17:46] [INFO ] Parsed PT model containing 1379 places and 120600 transitions and 2385526 arcs in 7459 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 58 resets, run finished after 2662 ms. (steps per millisecond=3 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 14432 steps, run timeout after 9003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 14432 steps, saw 8316 distinct states, run finished after 9009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 120600 rows 1379 cols
[2023-03-23 22:18:05] [INFO ] Computed 11 place invariants in 4482 ms
[2023-03-23 22:18:06] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2023-03-23 22:18:30] [INFO ] After 23620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:15
[2023-03-23 22:18:30] [INFO ] After 23811ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 22:18:30] [INFO ] After 25286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 22:18:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2023-03-23 22:18:55] [INFO ] After 23491ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2023-03-23 22:18:55] [INFO ] After 23496ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :10
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-23 22:18:55] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :10
FORMULA StigmergyElection-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Graph (trivial) has 1219 edges and 1379 vertex of which 210 / 1379 are part of one of the 30 SCC in 35 ms
Free SCC test removed 180 places
Drop transitions removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Graph (complete) has 3421 edges and 1199 vertex of which 1179 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.810 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 731 transitions
Trivial Post-agglo rules discarded 731 transitions
Performed 731 trivial Post agglomeration. Transition count delta: 731
Iterating post reduction 0 with 741 rules applied. Total rules applied 743 place count 1179 transition count 119619
Reduce places removed 731 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 763 rules applied. Total rules applied 1506 place count 448 transition count 119587
Reduce places removed 16 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 58 rules applied. Total rules applied 1564 place count 432 transition count 119545
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1606 place count 390 transition count 119545
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1606 place count 390 transition count 119490
Deduced a syphon composed of 55 places in 151 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1716 place count 335 transition count 119490
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 1813 place count 238 transition count 119393
Iterating global reduction 4 with 97 rules applied. Total rules applied 1910 place count 238 transition count 119393
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1924 place count 238 transition count 119379
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1924 place count 238 transition count 119375
Deduced a syphon composed of 4 places in 128 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1932 place count 234 transition count 119375
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1950 place count 216 transition count 119338
Iterating global reduction 5 with 18 rules applied. Total rules applied 1968 place count 216 transition count 119338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1969 place count 216 transition count 119337
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1976 place count 209 transition count 119330
Iterating global reduction 6 with 7 rules applied. Total rules applied 1983 place count 209 transition count 119330
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 74 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2023 place count 189 transition count 119310
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2033 place count 179 transition count 119300
Iterating global reduction 6 with 10 rules applied. Total rules applied 2043 place count 179 transition count 119300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 48 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2049 place count 176 transition count 119308
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 2068 place count 176 transition count 119289
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2087 place count 157 transition count 119289
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 2097 place count 147 transition count 119279
Iterating global reduction 7 with 10 rules applied. Total rules applied 2107 place count 147 transition count 119279
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 2117 place count 147 transition count 119279
Applied a total of 2117 rules in 25683 ms. Remains 147 /1379 variables (removed 1232) and now considering 119279/120600 (removed 1321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25701 ms. Remains : 147/1379 places, 119279/120600 transitions.
Incomplete random walk after 10000 steps, including 321 resets, run finished after 4122 ms. (steps per millisecond=2 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 27449 steps, run timeout after 24002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 27449 steps, saw 8603 distinct states, run finished after 24003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-23 22:19:54] [INFO ] Flow matrix only has 119277 transitions (discarded 2 similar events)
// Phase 1: matrix 119277 rows 147 cols
[2023-03-23 22:19:56] [INFO ] Computed 11 place invariants in 2224 ms
[2023-03-23 22:19:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-23 22:20:21] [INFO ] After 24893ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-23 22:20:37] [INFO ] State equation strengthened by 910 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 22:20:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:20:37] [INFO ] After 40444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 74 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 119279/119279 transitions.
Applied a total of 0 rules in 2679 ms. Remains 147 /147 variables (removed 0) and now considering 119279/119279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2680 ms. Remains : 147/147 places, 119279/119279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 119279/119279 transitions.
Applied a total of 0 rules in 2377 ms. Remains 147 /147 variables (removed 0) and now considering 119279/119279 (removed 0) transitions.
[2023-03-23 22:20:42] [INFO ] Flow matrix only has 119277 transitions (discarded 2 similar events)
[2023-03-23 22:20:42] [INFO ] Invariant cache hit.
[2023-03-23 22:20:42] [INFO ] Implicit Places using invariants in 386 ms returned [146]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 668 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 146/147 places, 119277/119279 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 144 transition count 119275
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 144 transition count 119275
Performed 3 Post agglomeration using F-continuation condition.
Performed 6 Post agglomeration using F-continuation condition.
Performed 9 Post agglomeration using F-continuation condition.
Performed 10 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 10 places in 48 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 24 place count 134 transition count 119250
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 134 transition count 119250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 134 transition count 119246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 130 transition count 119242
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 130 transition count 119242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 129 transition count 119241
Applied a total of 41 rules in 129430 ms. Remains 129 /146 variables (removed 17) and now considering 119241/119277 (removed 36) transitions.
// Phase 1: matrix 119241 rows 129 cols
[2023-03-23 22:22:54] [INFO ] Computed 10 place invariants in 2518 ms
[2023-03-23 22:22:55] [INFO ] Implicit Places using invariants in 2782 ms returned []
Implicit Place search using SMT only with invariants took 2783 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/147 places, 119241/119279 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 135264 ms. Remains : 129/147 places, 119241/119279 transitions.
Incomplete random walk after 10000 steps, including 416 resets, run finished after 5585 ms. (steps per millisecond=1 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 50752 steps, run timeout after 33003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 50752 steps, saw 10646 distinct states, run finished after 33004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-23 22:23:39] [INFO ] Invariant cache hit.
[2023-03-23 22:23:39] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-23 22:24:04] [INFO ] After 24901ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-23 22:24:04] [INFO ] After 25158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-23 22:24:04] [INFO ] After 25306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2023-03-23 22:24:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-23 22:24:30] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 74 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 119241/119241 transitions.
Applied a total of 0 rules in 2057 ms. Remains 129 /129 variables (removed 0) and now considering 119241/119241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2078 ms. Remains : 129/129 places, 119241/119241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 119241/119241 transitions.
Applied a total of 0 rules in 2171 ms. Remains 129 /129 variables (removed 0) and now considering 119241/119241 (removed 0) transitions.
[2023-03-23 22:24:34] [INFO ] Invariant cache hit.
[2023-03-23 22:24:34] [INFO ] Implicit Places using invariants in 256 ms returned []
Implicit Place search using SMT only with invariants took 279 ms to find 0 implicit places.
[2023-03-23 22:24:34] [INFO ] Invariant cache hit.
[2023-03-23 22:25:04] [INFO ] Performed 54253/119241 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 22:25:34] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 60110 ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62596 ms. Remains : 129/129 places, 119241/119241 transitions.
[2023-03-23 22:25:34] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-23 22:25:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 119241 transitions and 2382678 arcs took 1108 ms.
[2023-03-23 22:25:54] [INFO ] Flatten gal took : 16710 ms
Total runtime 495507 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyElection_PT_10b
(NrP: 129 NrTr: 119241 NrArc: 2382678)

parse formulas
formulas created successfully
place and transition orderings generation:0m46.248sec

net check time: 0m 0.362sec

init dd package: 0m 2.823sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9121120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15609516 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.792sec

43153 43153 44176 45230 47372 48523

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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