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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.2K Feb 26 11:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 StigmergyCommit-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679477641905

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=StigmergyCommit-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 09:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:34:06] [INFO ] Load time of PNML (sax parser for PT used): 1153 ms
[2023-03-22 09:34:06] [INFO ] Transformed 2443 places.
[2023-03-22 09:34:06] [INFO ] Transformed 15956 transitions.
[2023-03-22 09:34:06] [INFO ] Found NUPN structural information;
[2023-03-22 09:34:06] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 1467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 67 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 12) seen :2
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 15956 rows 2443 cols
[2023-03-22 09:34:09] [INFO ] Computed 9 place invariants in 743 ms
[2023-03-22 09:34:11] [INFO ] After 1810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 09:34:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2023-03-22 09:34:34] [INFO ] After 20777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 09:34:49] [INFO ] Deduced a trap composed of 397 places in 15016 ms of which 22 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-22 09:34:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:34:49] [INFO ] After 38210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 500 ms.
Support contains 74 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2284 edges and 2443 vertex of which 150 / 2443 are part of one of the 22 SCC in 31 ms
Free SCC test removed 128 places
Drop transitions removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (complete) has 3993 edges and 2315 vertex of which 2300 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.93 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1688 transitions
Trivial Post-agglo rules discarded 1688 transitions
Performed 1688 trivial Post agglomeration. Transition count delta: 1688
Iterating post reduction 0 with 1695 rules applied. Total rules applied 1697 place count 2300 transition count 14090
Reduce places removed 1688 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 1737 rules applied. Total rules applied 3434 place count 612 transition count 14041
Reduce places removed 21 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 77 rules applied. Total rules applied 3511 place count 591 transition count 13985
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 58 rules applied. Total rules applied 3569 place count 535 transition count 13983
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 3569 place count 535 transition count 13892
Deduced a syphon composed of 91 places in 11 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 3751 place count 444 transition count 13892
Discarding 77 places :
Symmetric choice reduction at 4 with 77 rule applications. Total rules 3828 place count 367 transition count 13815
Iterating global reduction 4 with 77 rules applied. Total rules applied 3905 place count 367 transition count 13815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3905 place count 367 transition count 13814
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3907 place count 366 transition count 13814
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 3941 place count 332 transition count 1616
Iterating global reduction 4 with 34 rules applied. Total rules applied 3975 place count 332 transition count 1616
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 3987 place count 332 transition count 1604
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 3994 place count 325 transition count 1597
Iterating global reduction 5 with 7 rules applied. Total rules applied 4001 place count 325 transition count 1597
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4007 place count 319 transition count 1591
Iterating global reduction 5 with 6 rules applied. Total rules applied 4013 place count 319 transition count 1591
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4019 place count 319 transition count 1585
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 4075 place count 291 transition count 1557
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 4082 place count 284 transition count 1550
Iterating global reduction 6 with 7 rules applied. Total rules applied 4089 place count 284 transition count 1550
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4093 place count 280 transition count 1546
Iterating global reduction 6 with 4 rules applied. Total rules applied 4097 place count 280 transition count 1546
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 4100 place count 277 transition count 1543
Iterating global reduction 6 with 3 rules applied. Total rules applied 4103 place count 277 transition count 1543
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 4111 place count 273 transition count 1551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4112 place count 273 transition count 1550
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4113 place count 273 transition count 1549
Free-agglomeration rule applied 68 times.
Iterating global reduction 7 with 68 rules applied. Total rules applied 4181 place count 273 transition count 1481
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 7 with 68 rules applied. Total rules applied 4249 place count 205 transition count 1481
Renaming transitions due to excessive name length > 1024 char.
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 4256 place count 198 transition count 1474
Iterating global reduction 8 with 7 rules applied. Total rules applied 4263 place count 198 transition count 1474
Drop transitions removed 261 transitions
Redundant transition composition rules discarded 261 transitions
Iterating global reduction 8 with 261 rules applied. Total rules applied 4524 place count 198 transition count 1213
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 4530 place count 198 transition count 1213
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 4534 place count 198 transition count 1209
Applied a total of 4534 rules in 4841 ms. Remains 198 /2443 variables (removed 2245) and now considering 1209/15956 (removed 14747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4843 ms. Remains : 198/2443 places, 1209/15956 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1209 rows 198 cols
[2023-03-22 09:34:56] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-22 09:34:56] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 09:34:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-22 09:34:57] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 09:34:57] [INFO ] State equation strengthened by 1005 read => feed constraints.
[2023-03-22 09:34:58] [INFO ] After 1138ms SMT Verify possible using 1005 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 09:34:59] [INFO ] Deduced a trap composed of 28 places in 725 ms of which 2 ms to minimize.
[2023-03-22 09:34:59] [INFO ] Deduced a trap composed of 27 places in 698 ms of which 2 ms to minimize.
[2023-03-22 09:35:00] [INFO ] Deduced a trap composed of 24 places in 695 ms of which 3 ms to minimize.
[2023-03-22 09:35:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2381 ms
[2023-03-22 09:35:01] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 2 ms to minimize.
[2023-03-22 09:35:02] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 1 ms to minimize.
[2023-03-22 09:35:02] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 0 ms to minimize.
[2023-03-22 09:35:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1614 ms
[2023-03-22 09:35:03] [INFO ] Deduced a trap composed of 17 places in 534 ms of which 2 ms to minimize.
[2023-03-22 09:35:03] [INFO ] Deduced a trap composed of 14 places in 445 ms of which 0 ms to minimize.
[2023-03-22 09:35:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1069 ms
[2023-03-22 09:35:04] [INFO ] Deduced a trap composed of 31 places in 555 ms of which 1 ms to minimize.
[2023-03-22 09:35:05] [INFO ] Deduced a trap composed of 21 places in 511 ms of which 0 ms to minimize.
[2023-03-22 09:35:06] [INFO ] Deduced a trap composed of 33 places in 530 ms of which 0 ms to minimize.
[2023-03-22 09:35:06] [INFO ] Deduced a trap composed of 35 places in 578 ms of which 0 ms to minimize.
[2023-03-22 09:35:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2582 ms
[2023-03-22 09:35:07] [INFO ] Deduced a trap composed of 47 places in 475 ms of which 0 ms to minimize.
[2023-03-22 09:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 622 ms
[2023-03-22 09:35:08] [INFO ] After 10787ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 879 ms.
[2023-03-22 09:35:08] [INFO ] After 12580ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 41 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 1209/1209 transitions.
Graph (complete) has 627 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 197 transition count 1182
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 172 transition count 1177
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 62 place count 168 transition count 1176
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 168 transition count 1173
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 165 transition count 1173
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 74 place count 159 transition count 1167
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 159 transition count 1167
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 98 place count 150 transition count 1158
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 3 with 192 rules applied. Total rules applied 290 place count 150 transition count 966
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 297 place count 143 transition count 959
Iterating global reduction 4 with 7 rules applied. Total rules applied 304 place count 143 transition count 959
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 308 place count 139 transition count 955
Iterating global reduction 4 with 4 rules applied. Total rules applied 312 place count 139 transition count 955
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 313 place count 138 transition count 954
Iterating global reduction 4 with 1 rules applied. Total rules applied 314 place count 138 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 317 place count 138 transition count 951
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 321 place count 136 transition count 965
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 325 place count 136 transition count 961
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 331 place count 136 transition count 955
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 338 place count 130 transition count 954
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 352 place count 130 transition count 940
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 355 place count 130 transition count 940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 130 transition count 939
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 130 transition count 937
Applied a total of 358 rules in 854 ms. Remains 130 /198 variables (removed 68) and now considering 937/1209 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 130/198 places, 937/1209 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 8) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 937 rows 130 cols
[2023-03-22 09:35:10] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-22 09:35:10] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 09:35:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-22 09:35:11] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 09:35:11] [INFO ] State equation strengthened by 811 read => feed constraints.
[2023-03-22 09:35:12] [INFO ] After 531ms SMT Verify possible using 811 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 09:35:12] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-22 09:35:12] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 1 ms to minimize.
[2023-03-22 09:35:13] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 1 ms to minimize.
[2023-03-22 09:35:13] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 2 ms to minimize.
[2023-03-22 09:35:14] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 1 ms to minimize.
[2023-03-22 09:35:14] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 1 ms to minimize.
[2023-03-22 09:35:14] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 1 ms to minimize.
[2023-03-22 09:35:15] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2023-03-22 09:35:15] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 1 ms to minimize.
[2023-03-22 09:35:16] [INFO ] Deduced a trap composed of 23 places in 325 ms of which 1 ms to minimize.
[2023-03-22 09:35:16] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 1 ms to minimize.
[2023-03-22 09:35:16] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2023-03-22 09:35:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4526 ms
[2023-03-22 09:35:17] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 0 ms to minimize.
[2023-03-22 09:35:17] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 1 ms to minimize.
[2023-03-22 09:35:17] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2023-03-22 09:35:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1088 ms
[2023-03-22 09:35:18] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-22 09:35:18] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-22 09:35:18] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2023-03-22 09:35:18] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2023-03-22 09:35:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 821 ms
[2023-03-22 09:35:19] [INFO ] Deduced a trap composed of 16 places in 449 ms of which 5 ms to minimize.
[2023-03-22 09:35:20] [INFO ] Deduced a trap composed of 12 places in 518 ms of which 1 ms to minimize.
[2023-03-22 09:35:20] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 1 ms to minimize.
[2023-03-22 09:35:21] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2023-03-22 09:35:21] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 1 ms to minimize.
[2023-03-22 09:35:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2764 ms
[2023-03-22 09:35:22] [INFO ] After 10421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-22 09:35:22] [INFO ] After 12128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 16 ms.
All properties solved without resorting to model-checking.
Total runtime 77794 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: StigmergyCommit_PT_07b
(NrP: 2443 NrTr: 15956 NrArc: 219500)

parse formulas
formulas created successfully
place and transition orderings generation:1m 6.335sec

net check time: 0m 0.050sec

init dd package: 0m 3.216sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9665108 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086176 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 3.882sec

1147719

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="StigmergyCommit-PT-07b"
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 StigmergyCommit-PT-07b, 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-167912650300486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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