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.r459-smll-167912651300510.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 smartxred
Input is StigmergyCommit-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:54 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.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 11:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 11:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 11:00 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 51M 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-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679384790678

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 07:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:46:36] [INFO ] Load time of PNML (sax parser for PT used): 2817 ms
[2023-03-21 07:46:36] [INFO ] Transformed 364 places.
[2023-03-21 07:46:36] [INFO ] Transformed 50444 transitions.
[2023-03-21 07:46:36] [INFO ] Found NUPN structural information;
[2023-03-21 07:46:36] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 3407 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1980 ms. (steps per millisecond=5 ) properties (out of 16) seen :3
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-21 07:46:39] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2023-03-21 07:46:39] [INFO ] Computed 11 place invariants in 82 ms
[2023-03-21 07:46:40] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-21 07:46:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-03-21 07:46:42] [INFO ] After 1747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-21 07:46:43] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2023-03-21 07:46:45] [INFO ] After 2275ms SMT Verify possible using 2185 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-21 07:46:47] [INFO ] Deduced a trap composed of 17 places in 1532 ms of which 12 ms to minimize.
[2023-03-21 07:46:48] [INFO ] Deduced a trap composed of 17 places in 1162 ms of which 2 ms to minimize.
[2023-03-21 07:46:49] [INFO ] Deduced a trap composed of 16 places in 1226 ms of which 1 ms to minimize.
[2023-03-21 07:46:50] [INFO ] Deduced a trap composed of 17 places in 995 ms of which 3 ms to minimize.
[2023-03-21 07:46:52] [INFO ] Deduced a trap composed of 18 places in 1228 ms of which 2 ms to minimize.
[2023-03-21 07:46:53] [INFO ] Deduced a trap composed of 17 places in 1052 ms of which 1 ms to minimize.
[2023-03-21 07:46:54] [INFO ] Deduced a trap composed of 16 places in 1170 ms of which 1 ms to minimize.
[2023-03-21 07:46:55] [INFO ] Deduced a trap composed of 18 places in 883 ms of which 4 ms to minimize.
[2023-03-21 07:46:56] [INFO ] Deduced a trap composed of 16 places in 721 ms of which 0 ms to minimize.
[2023-03-21 07:46:57] [INFO ] Deduced a trap composed of 16 places in 1188 ms of which 1 ms to minimize.
[2023-03-21 07:46:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 12071 ms
[2023-03-21 07:46:58] [INFO ] Deduced a trap composed of 17 places in 741 ms of which 2 ms to minimize.
[2023-03-21 07:46:59] [INFO ] Deduced a trap composed of 16 places in 610 ms of which 1 ms to minimize.
[2023-03-21 07:46:59] [INFO ] Deduced a trap composed of 17 places in 505 ms of which 1 ms to minimize.
[2023-03-21 07:47:00] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2023-03-21 07:47:01] [INFO ] Deduced a trap composed of 17 places in 878 ms of which 1 ms to minimize.
[2023-03-21 07:47:02] [INFO ] Deduced a trap composed of 17 places in 739 ms of which 1 ms to minimize.
[2023-03-21 07:47:02] [INFO ] Deduced a trap composed of 16 places in 711 ms of which 1 ms to minimize.
[2023-03-21 07:47:03] [INFO ] Deduced a trap composed of 16 places in 559 ms of which 2 ms to minimize.
[2023-03-21 07:47:04] [INFO ] Deduced a trap composed of 16 places in 408 ms of which 0 ms to minimize.
[2023-03-21 07:47:04] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 1 ms to minimize.
[2023-03-21 07:47:05] [INFO ] Deduced a trap composed of 16 places in 718 ms of which 1 ms to minimize.
[2023-03-21 07:47:05] [INFO ] Deduced a trap composed of 16 places in 570 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-21 07:47:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:47:05] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 78 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 359 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.37 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 359 transition count 2449
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 60 rules applied. Total rules applied 127 place count 324 transition count 2424
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 137 place count 319 transition count 2419
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 145 place count 314 transition count 2416
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 145 place count 314 transition count 2370
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 237 place count 268 transition count 2370
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 274 place count 231 transition count 2333
Iterating global reduction 4 with 37 rules applied. Total rules applied 311 place count 231 transition count 2333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 313 place count 231 transition count 2331
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 332 place count 212 transition count 2312
Iterating global reduction 5 with 19 rules applied. Total rules applied 351 place count 212 transition count 2312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 358 place count 212 transition count 2305
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 378 place count 202 transition count 2295
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 384 place count 196 transition count 2289
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 196 transition count 2289
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 395 place count 191 transition count 2284
Iterating global reduction 6 with 5 rules applied. Total rules applied 400 place count 191 transition count 2284
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 402 place count 189 transition count 2282
Iterating global reduction 6 with 2 rules applied. Total rules applied 404 place count 189 transition count 2282
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 419 place count 189 transition count 2267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 421 place count 188 transition count 2266
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 187 transition count 2265
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 187 transition count 2265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 424 place count 187 transition count 2264
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 442 place count 187 transition count 2246
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 460 place count 169 transition count 2246
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 462 place count 169 transition count 2244
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 471 place count 169 transition count 2244
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 478 place count 169 transition count 2237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 479 place count 168 transition count 2236
Reduce places removed 1 places and 0 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 8 with 9 rules applied. Total rules applied 488 place count 167 transition count 2228
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 9 with 15 rules applied. Total rules applied 503 place count 159 transition count 2221
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 510 place count 152 transition count 2221
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 510 place count 152 transition count 2213
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 526 place count 144 transition count 2213
Performed 12 Post agglomeration using F-continuation condition with reduction of 1085 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 550 place count 132 transition count 1116
Drop transitions removed 3 transitions
Ensure Unique test removed 636 transitions
Reduce isomorphic transitions removed 639 transitions.
Iterating post reduction 11 with 639 rules applied. Total rules applied 1189 place count 132 transition count 477
Drop transitions removed 244 transitions
Redundant transition composition rules discarded 244 transitions
Iterating global reduction 12 with 244 rules applied. Total rules applied 1433 place count 132 transition count 233
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 1438 place count 132 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1443 place count 127 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1445 place count 125 transition count 226
Applied a total of 1445 rules in 6122 ms. Remains 125 /364 variables (removed 239) and now considering 226/2520 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6122 ms. Remains : 125/364 places, 226/2520 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :10
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 125 cols
[2023-03-21 07:47:12] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-21 07:47:12] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 07:47:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-21 07:47:12] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 07:47:12] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-21 07:47:12] [INFO ] After 51ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 2 places in 133 ms of which 0 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 1 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-21 07:47:13] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1482 ms
[2023-03-21 07:47:14] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2023-03-21 07:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-21 07:47:14] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-21 07:47:14] [INFO ] After 1842ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 41085 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 09a
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 364 places, 50444 transitions, 999956 arcs.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14230128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16053676 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

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-09a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-09a, 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 r459-smll-167912651300510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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