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-167912650400542.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-11a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650400542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Feb 26 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:13 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 464M 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-11a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679531590734

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-11a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:33:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:33:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:33:35] [INFO ] Load time of PNML (sax parser for PT used): 22045 ms
[2023-03-23 00:33:36] [INFO ] Transformed 436 places.
[2023-03-23 00:33:38] [INFO ] Transformed 373236 transitions.
[2023-03-23 00:33:38] [INFO ] Found NUPN structural information;
[2023-03-23 00:33:38] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 24227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13269 ms. (steps per millisecond=0 ) properties (out of 10) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 00:33:55] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2023-03-23 00:33:55] [INFO ] Computed 13 place invariants in 215 ms
[2023-03-23 00:33:56] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 00:33:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-23 00:34:01] [INFO ] After 4556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 00:34:03] [INFO ] State equation strengthened by 8357 read => feed constraints.
[2023-03-23 00:34:07] [INFO ] After 4598ms SMT Verify possible using 8357 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 00:34:12] [INFO ] Deduced a trap composed of 17 places in 4988 ms of which 12 ms to minimize.
[2023-03-23 00:34:17] [INFO ] Deduced a trap composed of 17 places in 4321 ms of which 2 ms to minimize.
[2023-03-23 00:34:21] [INFO ] Deduced a trap composed of 18 places in 3555 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 00:34:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:34:21] [INFO ] After 25261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 88 ms.
Support contains 88 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 427 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.84 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 427 transition count 8688
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 107 place count 401 transition count 8669
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 15 rules applied. Total rules applied 122 place count 397 transition count 8658
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 136 place count 386 transition count 8655
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 136 place count 386 transition count 8594
Deduced a syphon composed of 61 places in 5 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 258 place count 325 transition count 8594
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 310 place count 273 transition count 8542
Iterating global reduction 4 with 52 rules applied. Total rules applied 362 place count 273 transition count 8542
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 367 place count 273 transition count 8537
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 395 place count 245 transition count 8506
Iterating global reduction 5 with 28 rules applied. Total rules applied 423 place count 245 transition count 8506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 430 place count 245 transition count 8499
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 433 place count 242 transition count 8496
Iterating global reduction 6 with 3 rules applied. Total rules applied 436 place count 242 transition count 8496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 440 place count 242 transition count 8492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 441 place count 241 transition count 8491
Iterating global reduction 7 with 1 rules applied. Total rules applied 442 place count 241 transition count 8491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 443 place count 241 transition count 8490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 461 place count 232 transition count 8481
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 462 place count 232 transition count 8480
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 468 place count 226 transition count 8474
Iterating global reduction 9 with 6 rules applied. Total rules applied 474 place count 226 transition count 8474
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 477 place count 223 transition count 8471
Iterating global reduction 9 with 3 rules applied. Total rules applied 480 place count 223 transition count 8471
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 482 place count 221 transition count 8469
Iterating global reduction 9 with 2 rules applied. Total rules applied 484 place count 221 transition count 8469
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 502 place count 221 transition count 8451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 508 place count 218 transition count 8448
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 511 place count 215 transition count 8445
Iterating global reduction 9 with 3 rules applied. Total rules applied 514 place count 215 transition count 8445
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 517 place count 215 transition count 8442
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 536 place count 215 transition count 8423
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 555 place count 196 transition count 8423
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 556 place count 196 transition count 8422
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 566 place count 196 transition count 8422
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 573 place count 196 transition count 8415
Applied a total of 573 rules in 82014 ms. Remains 196 /436 variables (removed 240) and now considering 8415/8758 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82022 ms. Remains : 196/436 places, 8415/8758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20046 ms. (steps per millisecond=0 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 2648526 steps, run timeout after 60001 ms. (steps per millisecond=44 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 2648526 steps, saw 363117 distinct states, run finished after 60003 ms. (steps per millisecond=44 ) properties seen :5
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 8415 rows 196 cols
[2023-03-23 00:37:04] [INFO ] Computed 11 place invariants in 51 ms
[2023-03-23 00:37:04] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:37:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:37:06] [INFO ] After 2621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:37:08] [INFO ] State equation strengthened by 8304 read => feed constraints.
[2023-03-23 00:37:10] [INFO ] After 2220ms SMT Verify possible using 8304 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 00:37:14] [INFO ] Deduced a trap composed of 7 places in 3938 ms of which 2 ms to minimize.
[2023-03-23 00:37:18] [INFO ] Deduced a trap composed of 6 places in 3253 ms of which 2 ms to minimize.
[2023-03-23 00:37:22] [INFO ] Deduced a trap composed of 8 places in 3347 ms of which 1 ms to minimize.
[2023-03-23 00:37:26] [INFO ] Deduced a trap composed of 9 places in 4398 ms of which 1 ms to minimize.
[2023-03-23 00:37:30] [INFO ] Deduced a trap composed of 13 places in 3761 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 00:37:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:37:30] [INFO ] After 26510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 15 ms.
Support contains 35 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 8415/8415 transitions.
Graph (complete) has 764 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.20 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 193 transition count 8402
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 185 transition count 8402
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 185 transition count 8391
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 174 transition count 8391
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 157 transition count 8374
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 157 transition count 8374
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 101 place count 157 transition count 8351
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 153 transition count 8347
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 153 transition count 8347
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 142 place count 153 transition count 8314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 152 transition count 8313
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 152 transition count 8313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 152 transition count 8312
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 171 place count 139 transition count 8298
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 174 place count 139 transition count 8295
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 185 place count 128 transition count 8284
Iterating global reduction 6 with 11 rules applied. Total rules applied 196 place count 128 transition count 8284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 201 place count 128 transition count 8279
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 203 place count 126 transition count 8277
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 126 transition count 8277
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 206 place count 125 transition count 8276
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 125 transition count 8276
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 213 place count 125 transition count 8270
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 214 place count 125 transition count 8269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 124 transition count 8269
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 220 place count 124 transition count 8269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 221 place count 124 transition count 8268
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 225 place count 124 transition count 8264
Applied a total of 225 rules in 56104 ms. Remains 124 /196 variables (removed 72) and now considering 8264/8415 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56108 ms. Remains : 124/196 places, 8264/8415 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23721 ms. (steps per millisecond=0 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3354249 steps, run timeout after 69001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 3354249 steps, saw 420702 distinct states, run finished after 69007 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8264 rows 124 cols
[2023-03-23 00:39:59] [INFO ] Computed 13 place invariants in 38 ms
[2023-03-23 00:39:59] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 00:39:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-23 00:40:02] [INFO ] After 2548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 00:40:03] [INFO ] State equation strengthened by 8213 read => feed constraints.
[2023-03-23 00:40:05] [INFO ] After 1736ms SMT Verify possible using 8213 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 00:40:09] [INFO ] Deduced a trap composed of 8 places in 3682 ms of which 1 ms to minimize.
[2023-03-23 00:40:13] [INFO ] Deduced a trap composed of 6 places in 3219 ms of which 1 ms to minimize.
[2023-03-23 00:40:16] [INFO ] Deduced a trap composed of 7 places in 2779 ms of which 0 ms to minimize.
[2023-03-23 00:40:18] [INFO ] Deduced a trap composed of 9 places in 2432 ms of which 1 ms to minimize.
[2023-03-23 00:40:21] [INFO ] Deduced a trap composed of 6 places in 2426 ms of which 1 ms to minimize.
[2023-03-23 00:40:24] [INFO ] Deduced a trap composed of 10 places in 2407 ms of which 1 ms to minimize.
[2023-03-23 00:40:26] [INFO ] Deduced a trap composed of 6 places in 2085 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 00:40:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:40:26] [INFO ] After 26565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 16 ms.
Support contains 35 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 8264/8264 transitions.
Applied a total of 0 rules in 10925 ms. Remains 124 /124 variables (removed 0) and now considering 8264/8264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10927 ms. Remains : 124/124 places, 8264/8264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 8264/8264 transitions.
Applied a total of 0 rules in 10872 ms. Remains 124 /124 variables (removed 0) and now considering 8264/8264 (removed 0) transitions.
[2023-03-23 00:40:48] [INFO ] Invariant cache hit.
[2023-03-23 00:40:51] [INFO ] Implicit Places using invariants in 2878 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2897 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/124 places, 8264/8264 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 8253
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 112 transition count 8249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 108 transition count 8249
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 108 transition count 8242
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 101 transition count 8242
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 99 transition count 8240
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 99 transition count 8240
Performed 25 Post agglomeration using F-continuation condition with reduction of 7623 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 98 place count 74 transition count 592
Drop transitions removed 13 transitions
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 434 transitions.
Iterating post reduction 3 with 434 rules applied. Total rules applied 532 place count 74 transition count 158
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 573 place count 74 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 575 place count 73 transition count 116
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 578 place count 73 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 581 place count 70 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 582 place count 70 transition count 112
Applied a total of 582 rules in 737 ms. Remains 70 /123 variables (removed 53) and now considering 112/8264 (removed 8152) transitions.
// Phase 1: matrix 112 rows 70 cols
[2023-03-23 00:40:51] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 00:40:51] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-23 00:40:51] [INFO ] Invariant cache hit.
[2023-03-23 00:40:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 00:40:52] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/124 places, 112/8264 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14743 ms. Remains : 70/124 places, 112/8264 transitions.
[2023-03-23 00:40:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-23 00:40:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 112 transitions and 1247 arcs took 2 ms.
[2023-03-23 00:40:52] [INFO ] Flatten gal took : 62 ms
Total runtime 458517 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: StigmergyCommit_PT_11a
(NrP: 70 NrTr: 112 NrArc: 1247)

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

net check time: 0m 0.000sec

init dd package: 0m 2.967sec


RS generation: 0m 0.073sec


-> reachability set: #nodes 3404 (3.4e+03) #states 911



starting MCC model checker
--------------------------

checking: EF [[[[[1<=p42 & p42<=1] & [p4<=0 & 0<=p4]] & [[p19<=0 & 0<=p19] & [[p53<=1 & 1<=p53] & [p3<=0 & 0<=p3]]]] & [[[[p22<=0 & 0<=p22] | [p49<=1 & 1<=p49]] & [[p50<=1 & 1<=p50] | [[[p47<=0 & 0<=p47] & [p58<=1 & 1<=p58]] | [[p36<=0 & 0<=p36] & [p59<=1 & 1<=p59]]]]] & [[[p13<=0 & 0<=p13] | [p68<=1 & 1<=p68]] & [[[[[p27<=0 & 0<=p27] | [p15<=1 & 1<=p15]] | [[p33<=0 & 0<=p33] | [p57<=1 & 1<=p57]]] | [[p37<=0 & 0<=p37] | [[p10<=1 & 1<=p10] | [p34<=0 & 0<=p34]]]] & [[[p41<=1 & 1<=p41] & [[[p17<=0 & 0<=p17] | [[p44<=0 & 0<=p44] & [p45<=1 & 1<=p45]]] & [[[p63<=0 & 0<=p63] | [p25<=1 & 1<=p25]] | [[p24<=1 & 1<=p24] | [p65<=1 & 1<=p65]]]]] | [[p54<=0 & 0<=p54] & [[[p7<=1 & 1<=p7] | [[p58<=0 & 0<=p58] | [p21<=1 & 1<=p21]]] | [[p30<=1 & 1<=p30] | [[p6<=0 & 0<=p6] | [p1<=1 & 1<=p1]]]]]]]]]]]
normalized: E [true U [[[[[p68<=1 & 1<=p68] | [p13<=0 & 0<=p13]] & [[[[[p34<=0 & 0<=p34] | [p10<=1 & 1<=p10]] | [p37<=0 & 0<=p37]] | [[[p15<=1 & 1<=p15] | [p27<=0 & 0<=p27]] | [[p57<=1 & 1<=p57] | [p33<=0 & 0<=p33]]]] & [[[[[[p24<=1 & 1<=p24] | [p65<=1 & 1<=p65]] | [[p63<=0 & 0<=p63] | [p25<=1 & 1<=p25]]] & [[[p45<=1 & 1<=p45] & [p44<=0 & 0<=p44]] | [p17<=0 & 0<=p17]]] & [p41<=1 & 1<=p41]] | [[[[p30<=1 & 1<=p30] | [[p1<=1 & 1<=p1] | [p6<=0 & 0<=p6]]] | [[[p21<=1 & 1<=p21] | [p58<=0 & 0<=p58]] | [p7<=1 & 1<=p7]]] & [p54<=0 & 0<=p54]]]]] & [[[[[p59<=1 & 1<=p59] & [p36<=0 & 0<=p36]] | [[p58<=1 & 1<=p58] & [p47<=0 & 0<=p47]]] | [p50<=1 & 1<=p50]] & [[p49<=1 & 1<=p49] | [p22<=0 & 0<=p22]]]] & [[[[p3<=0 & 0<=p3] & [p53<=1 & 1<=p53]] & [p19<=0 & 0<=p19]] & [[p4<=0 & 0<=p4] & [1<=p42 & p42<=1]]]]]

abstracting: (p42<=1)
states: 911
abstracting: (1<=p42)
states: 1
abstracting: (0<=p4)
states: 911
abstracting: (p4<=0)
states: 910
abstracting: (0<=p19)
states: 911
abstracting: (p19<=0)
states: 910
abstracting: (1<=p53)
states: 108
abstracting: (p53<=1)
states: 911
abstracting: (0<=p3)
states: 911
abstracting: (p3<=0)
states: 910
abstracting: (0<=p22)
states: 911
abstracting: (p22<=0)
states: 695
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 911
abstracting: (1<=p50)
states: 1
abstracting: (p50<=1)
states: 911
abstracting: (0<=p47)
states: 911
abstracting: (p47<=0)
states: 905
abstracting: (1<=p58)
states: 1
abstracting: (p58<=1)
states: 911
abstracting: (0<=p36)
states: 911
abstracting: (p36<=0)
states: 910
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 911
abstracting: (0<=p54)
states: 911
abstracting: (p54<=0)
states: 695
abstracting: (1<=p7)
states: 1
abstracting: (p7<=1)
states: 911
abstracting: (0<=p58)
states: 911
abstracting: (p58<=0)
states: 910
abstracting: (1<=p21)
states: 302
abstracting: (p21<=1)
states: 911
abstracting: (0<=p6)
states: 911
abstracting: (p6<=0)
states: 910
abstracting: (1<=p1)
states: 324
abstracting: (p1<=1)
states: 911
abstracting: (1<=p30)
states: 1
abstracting: (p30<=1)
states: 911
abstracting: (1<=p41)
states: 216
abstracting: (p41<=1)
states: 911
abstracting: (0<=p17)
states: 911
abstracting: (p17<=0)
states: 910
abstracting: (0<=p44)
states: 911
abstracting: (p44<=0)
states: 549
abstracting: (1<=p45)
states: 216
abstracting: (p45<=1)
states: 911
abstracting: (1<=p25)
states: 1
abstracting: (p25<=1)
states: 911
abstracting: (0<=p63)
states: 911
abstracting: (p63<=0)
states: 839
abstracting: (1<=p65)
states: 1
abstracting: (p65<=1)
states: 911
abstracting: (1<=p24)
states: 1
abstracting: (p24<=1)
states: 911
abstracting: (0<=p33)
states: 911
abstracting: (p33<=0)
states: 910
abstracting: (1<=p57)
states: 1
abstracting: (p57<=1)
states: 911
abstracting: (0<=p27)
states: 911
abstracting: (p27<=0)
states: 910
abstracting: (1<=p15)
states: 6
abstracting: (p15<=1)
states: 911
abstracting: (0<=p37)
states: 911
abstracting: (p37<=0)
states: 910
abstracting: (1<=p10)
states: 72
abstracting: (p10<=1)
states: 911
abstracting: (0<=p34)
states: 911
abstracting: (p34<=0)
states: 910
abstracting: (0<=p13)
states: 911
abstracting: (p13<=0)
states: 749
abstracting: (1<=p68)
states: 72
abstracting: (p68<=1)
states: 911
-> the formula is FALSE

FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

totally nodes used: 15202 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33191 217353 250544
used/not used/entry size/cache size: 217883 66890981 16 1024MB
basic ops cache: hits/miss/sum: 13383 129526 142909
used/not used/entry size/cache size: 154017 16623199 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1306 10033 11339
used/not used/entry size/cache size: 10033 8378575 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67093692
1 15142
2 30
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.707sec


BK_STOP 1679532058219

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

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


initing FirstDep: 0m 0.000sec


iterations count:2337 (20), effective:116 (1)

initing FirstDep: 0m 0.000sec

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-11a"
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-11a, 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-167912650400542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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