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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 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 17M 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-08a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679373153747

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-08a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 04:32:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 04:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 04:32:38] [INFO ] Load time of PNML (sax parser for PT used): 1195 ms
[2023-03-21 04:32:39] [INFO ] Transformed 328 places.
[2023-03-21 04:32:39] [INFO ] Transformed 18744 transitions.
[2023-03-21 04:32:39] [INFO ] Found NUPN structural information;
[2023-03-21 04:32:39] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1494 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1099 ms. (steps per millisecond=9 ) properties (out of 16) seen :6
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 04:32:41] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 04:32:41] [INFO ] Computed 10 place invariants in 41 ms
[2023-03-21 04:32:42] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-21 04:32:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 04:32:45] [INFO ] After 2461ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-21 04:32:45] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-21 04:32:48] [INFO ] After 3332ms SMT Verify possible using 1147 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-21 04:32:49] [INFO ] Deduced a trap composed of 17 places in 915 ms of which 9 ms to minimize.
[2023-03-21 04:32:50] [INFO ] Deduced a trap composed of 19 places in 604 ms of which 2 ms to minimize.
[2023-03-21 04:32:51] [INFO ] Deduced a trap composed of 16 places in 797 ms of which 3 ms to minimize.
[2023-03-21 04:32:52] [INFO ] Deduced a trap composed of 17 places in 797 ms of which 3 ms to minimize.
[2023-03-21 04:32:52] [INFO ] Deduced a trap composed of 19 places in 670 ms of which 2 ms to minimize.
[2023-03-21 04:32:53] [INFO ] Deduced a trap composed of 16 places in 504 ms of which 1 ms to minimize.
[2023-03-21 04:32:54] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 1 ms to minimize.
[2023-03-21 04:32:54] [INFO ] Deduced a trap composed of 17 places in 646 ms of which 2 ms to minimize.
[2023-03-21 04:32:55] [INFO ] Deduced a trap composed of 17 places in 639 ms of which 1 ms to minimize.
[2023-03-21 04:32:56] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 1 ms to minimize.
[2023-03-21 04:32:56] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 1 ms to minimize.
[2023-03-21 04:32:57] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 1 ms to minimize.
[2023-03-21 04:32:57] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 0 ms to minimize.
[2023-03-21 04:32:57] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2023-03-21 04:32:58] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 1 ms to minimize.
[2023-03-21 04:32:58] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 1 ms to minimize.
[2023-03-21 04:32:59] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2023-03-21 04:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 10340 ms
[2023-03-21 04:33:00] [INFO ] Deduced a trap composed of 17 places in 587 ms of which 1 ms to minimize.
[2023-03-21 04:33:00] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-21 04:33:01] [INFO ] Deduced a trap composed of 18 places in 434 ms of which 5 ms to minimize.
[2023-03-21 04:33:02] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 1 ms to minimize.
[2023-03-21 04:33:02] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 2 ms to minimize.
[2023-03-21 04:33:03] [INFO ] Deduced a trap composed of 16 places in 348 ms of which 1 ms to minimize.
[2023-03-21 04:33:03] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 0 ms to minimize.
[2023-03-21 04:33:04] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 1 ms to minimize.
[2023-03-21 04:33:04] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-21 04:33:04] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2023-03-21 04:33:05] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 1 ms to minimize.
[2023-03-21 04:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 5779 ms
[2023-03-21 04:33:06] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2023-03-21 04:33:06] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-21 04:33:07] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 2 ms to minimize.
[2023-03-21 04:33:08] [INFO ] Deduced a trap composed of 2 places in 948 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 04:33:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 04:33:08] [INFO ] After 25978ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:8
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 99 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 320 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.39 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 320 transition count 1402
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 67 place count 305 transition count 1390
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 76 place count 302 transition count 1384
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 85 place count 296 transition count 1381
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 85 place count 296 transition count 1348
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 151 place count 263 transition count 1348
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 189 place count 225 transition count 1310
Iterating global reduction 4 with 38 rules applied. Total rules applied 227 place count 225 transition count 1310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 225 transition count 1308
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 244 place count 210 transition count 1291
Iterating global reduction 5 with 15 rules applied. Total rules applied 259 place count 210 transition count 1291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 263 place count 210 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 209 transition count 1286
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 209 transition count 1286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 267 place count 209 transition count 1284
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 277 place count 204 transition count 1279
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 280 place count 201 transition count 1276
Iterating global reduction 7 with 3 rules applied. Total rules applied 283 place count 201 transition count 1276
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 300 place count 201 transition count 1259
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 308 place count 197 transition count 1255
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 310 place count 195 transition count 1253
Iterating global reduction 7 with 2 rules applied. Total rules applied 312 place count 195 transition count 1253
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 323 place count 195 transition count 1242
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 334 place count 184 transition count 1242
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 337 place count 184 transition count 1242
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 340 place count 184 transition count 1239
Applied a total of 340 rules in 1985 ms. Remains 184 /328 variables (removed 144) and now considering 1239/1449 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1986 ms. Remains : 184/328 places, 1239/1449 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 409210 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 409210 steps, saw 61957 distinct states, run finished after 3002 ms. (steps per millisecond=136 ) properties seen :2
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1239 rows 184 cols
[2023-03-21 04:33:14] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-21 04:33:14] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 04:33:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-21 04:33:16] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 04:33:16] [INFO ] State equation strengthened by 1121 read => feed constraints.
[2023-03-21 04:33:17] [INFO ] After 1471ms SMT Verify possible using 1121 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 04:33:18] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 1 ms to minimize.
[2023-03-21 04:33:18] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 1 ms to minimize.
[2023-03-21 04:33:19] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 6 ms to minimize.
[2023-03-21 04:33:19] [INFO ] Deduced a trap composed of 8 places in 418 ms of which 1 ms to minimize.
[2023-03-21 04:33:20] [INFO ] Deduced a trap composed of 9 places in 425 ms of which 0 ms to minimize.
[2023-03-21 04:33:20] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 1 ms to minimize.
[2023-03-21 04:33:20] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-21 04:33:21] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 5 ms to minimize.
[2023-03-21 04:33:21] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 1 ms to minimize.
[2023-03-21 04:33:22] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 0 ms to minimize.
[2023-03-21 04:33:22] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-21 04:33:23] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 0 ms to minimize.
[2023-03-21 04:33:23] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-21 04:33:23] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2023-03-21 04:33:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 5804 ms
[2023-03-21 04:33:24] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 1 ms to minimize.
[2023-03-21 04:33:24] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-21 04:33:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 746 ms
[2023-03-21 04:33:25] [INFO ] Deduced a trap composed of 9 places in 512 ms of which 1 ms to minimize.
[2023-03-21 04:33:26] [INFO ] Deduced a trap composed of 10 places in 615 ms of which 1 ms to minimize.
[2023-03-21 04:33:26] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 1 ms to minimize.
[2023-03-21 04:33:27] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 2 ms to minimize.
[2023-03-21 04:33:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2263 ms
[2023-03-21 04:33:27] [INFO ] After 11358ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2023-03-21 04:33:27] [INFO ] After 12984ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 49870 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 08a
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: 328 places, 18744 transitions, 330279 arcs.
Final Score: 16768.795
Took : 1794 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-00 (reachable &!potential( (! ( ( ( ( ( 1 ) <= (tk(P24)) ) & ( (tk(P49)) <= (tk(P312)) ) ) & ( (tk(P199)) <= (tk(P301)) ) ) & ( (tk(P111)) <= (tk(P6)) ) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-01 (reachable & potential((! ( ( (tk(P28)) <= (tk(P282)) ) & ( (tk(P137)) <= ( 0 ) ) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-02 (reachable & potential(( ( (! ( ( (tk(P182)) <= (tk(P259)) ) | ( (tk(P8)) <= (tk(P196)) ) )) & ( (tk(P38)) <= ( 1 ) ) ) & ( ( (! ( (! ( ( (! ( (tk(P244)) <= (tk(P89)) )) | ( (tk(P282)) <= (tk(P7)) ) ) & ( ( ( (tk(P19)) <= ( 0 ) ) | ( (tk(P157)) <= ( 0 ) ) ) & ( ( (tk(P144)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P138)) ) ) ) )) | (! ( ( ( ( (tk(P21)) <= (tk(P50)) ) & ( (tk(P240)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P283)) ) ) & ( (tk(P326)) <= ( 1 ) ) )) )) | (! ( (! ( ( ( ( ( 1 ) <= (tk(P226)) ) | ( (tk(P279)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P117)) )) ) & (! ( ( 1 ) <= (tk(P121)) )) )) & ( ( 1 ) <= (tk(P50)) ) )) ) | ( ( 1 ) <= (tk(P149)) ) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-03 (reachable &!potential( ( ( ( (! ( (tk(P327)) <= ( 1 ) )) | (! ( (! ( ( ( 1 ) <= (tk(P86)) ) & ( ( (tk(P200)) <= (tk(P206)) ) & ( (tk(P315)) <= (tk(P75)) ) ) )) & ( (tk(P104)) <= ( 1 ) ) )) ) | ( ( ( 1 ) <= (tk(P59)) ) | ( (! ( (tk(P25)) <= (tk(P239)) )) & ( ( (tk(P80)) <= ( 0 ) ) | ( ( ( (! ( ( 1 ) <= (tk(P200)) )) & (! ( ( 1 ) <= (tk(P289)) )) ) & ( (! ( ( 1 ) <= (tk(P207)) )) & (! ( (tk(P163)) <= (tk(P315)) )) ) ) | ( ( (tk(P194)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) ) ) ) ) ) | ( (tk(P86)) <= (tk(P276)) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-04 (reachable &!potential( (! ( ( 1 ) <= (tk(P218)) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P124)) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-06 (reachable &!potential( (! ( ( (! ( ( 1 ) <= (tk(P6)) )) & (! ( (! ( (tk(P134)) <= ( 1 ) )) | ( (tk(P182)) <= ( 1 ) ) )) ) | ( ( ( ( (! ( ( (tk(P153)) <= ( 0 ) ) & ( (tk(P220)) <= ( 0 ) ) )) | ( ( (tk(P194)) <= (tk(P196)) ) & ( ( 1 ) <= (tk(P39)) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P20)) ) | ( (tk(P263)) <= (tk(P170)) ) ) | ( ( (tk(P246)) <= (tk(P106)) ) | ( ( 1 ) <= (tk(P161)) ) ) ) | (! ( ( 1 ) <= (tk(P288)) )) ) | ( ( ( (tk(P15)) <= (tk(P75)) ) & ( ( (tk(P7)) <= ( 1 ) ) | ( (tk(P63)) <= (tk(P294)) ) ) ) & ( ( ( 1 ) <= (tk(P142)) ) & ( (tk(P18)) <= ( 1 ) ) ) ) ) ) | (! ( ( ( (! ( (tk(P114)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P107)) ) & ( (tk(P194)) <= ( 1 ) ) ) ) | ( (! ( ( 1 ) <= (tk(P200)) )) | ( ( (tk(P283)) <= (tk(P325)) ) & ( ( 1 ) <= (tk(P308)) ) ) ) ) | (! ( ( ( (tk(P56)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P35)) ) ) | ( (tk(P28)) <= ( 1 ) ) )) )) ) & ( (! ( (! ( ( (tk(P205)) <= ( 1 ) ) | ( (tk(P115)) <= (tk(P302)) ) )) | (! ( (! ( ( 1 ) <= (tk(P25)) )) | (! ( (tk(P71)) <= ( 0 ) )) )) )) | ( (! ( (tk(P263)) <= (tk(P311)) )) | ( ( ( ( ( (tk(P213)) <= ( 0 ) ) & ( (tk(P32)) <= (tk(P205)) ) ) | ( ( 1 ) <= (tk(P63)) ) ) & (! ( (tk(P282)) <= ( 1 ) )) ) | (! ( ( (tk(P101)) <= (tk(P88)) ) & ( ( (tk(P47)) <= (tk(P258)) ) | ( (tk(P12)) <= (tk(P160)) ) ) )) ) ) ) ) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-07 (reachable & potential(( (! ( ( (! ( ( ( (tk(P169)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P316)) ) & ( (tk(P139)) <= ( 1 ) ) ) & ( ( (tk(P212)) <= ( 0 ) ) | ( (tk(P170)) <= (tk(P218)) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P207)) ) | ( (tk(P61)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P4)) ) & ( (tk(P43)) <= (tk(P230)) ) ) ) & ( ( ( ( 1 ) <= (tk(P272)) ) | ( ( 1 ) <= (tk(P41)) ) ) & ( ( ( 1 ) <= (tk(P268)) ) | ( ( 1 ) <= (tk(P288)) ) ) ) ) )) | ( ( 1 ) <= (tk(P73)) ) ) & ( ( (tk(P156)) <= ( 0 ) ) & (! ( ( ( ( (tk(P267)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P29)) ) ) & (! ( (tk(P295)) <= ( 0 ) )) ) | ( ( ( (tk(P15)) <= (tk(P112)) ) | ( (tk(P316)) <= (tk(P74)) ) ) | (! ( (tk(P99)) <= (tk(P72)) )) ) )) ) )) & ( ( ( ( (tk(P84)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P84)) ) ) & (! ( ( 1 ) <= (tk(P38)) )) ) & ( ( (tk(P99)) <= ( 0 ) ) & ( ( (! ( ( (! ( (tk(P174)) <= ( 0 ) )) | (! ( (tk(P173)) <= (tk(P147)) )) ) & (! ( (tk(P133)) <= ( 0 ) )) )) & ( (tk(P64)) <= ( 0 ) ) ) | ( (tk(P102)) <= (tk(P46)) ) ) ) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-08 (reachable &!potential( (! ( ( 1 ) <= (tk(P95)) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-09 (reachable &!potential( ( (! ( ( (tk(P111)) <= (tk(P80)) ) | ( (tk(P184)) <= (tk(P258)) ) )) | ( (tk(P80)) <= ( 0 ) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-10 (reachable & potential((! ( (tk(P204)) <= (tk(P128)) ))))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-11 (reachable &!potential( ( ( ( ( ( ( (! ( (! ( ( 1 ) <= (tk(P200)) )) | ( (tk(P102)) <= (tk(P80)) ) )) | ( ( ( ( ( 1 ) <= (tk(P26)) ) | ( (tk(P265)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P91)) ) | ( ( 1 ) <= (tk(P98)) ) ) ) | (! ( ( ( 1 ) <= (tk(P318)) ) | ( (tk(P203)) <= ( 0 ) ) )) ) ) & ( (tk(P33)) <= (tk(P129)) ) ) | ( ( 1 ) <= (tk(P303)) ) ) | ( (tk(P299)) <= ( 1 ) ) ) & ( ( ( ( (! ( ( (tk(P122)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P45)) ) )) & ( (tk(P113)) <= ( 0 ) ) ) | (! ( (tk(P160)) <= ( 1 ) )) ) | (! ( (! ( ( ( 1 ) <= (tk(P28)) ) | ( ( (tk(P37)) <= ( 0 ) ) | ( (tk(P129)) <= ( 0 ) ) ) )) & ( (tk(P292)) <= (tk(P271)) ) )) ) & ( ( (! ( ( ( (tk(P98)) <= ( 0 ) ) & ( (tk(P82)) <= (tk(P3)) ) ) | ( ( (tk(P179)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P296)) ) ) )) | ( ( (tk(P301)) <= (tk(P103)) ) & ( (tk(P210)) <= ( 0 ) ) ) ) | ( (tk(P141)) <= ( 0 ) ) ) ) ) | ( ( ( (! ( (tk(P61)) <= (tk(P290)) )) | (! ( ( (! ( (tk(P181)) <= (tk(P317)) )) | (! ( ( 1 ) <= (tk(P120)) )) ) & ( (tk(P231)) <= (tk(P308)) ) )) ) | ( (tk(P247)) <= (tk(P324)) ) ) & ( (tk(P168)) <= ( 1 ) ) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( (! ( (tk(P258)) <= (tk(P158)) )) & ( (tk(P240)) <= ( 1 ) ) )) | (! ( ( ( (! ( ( ( 1 ) <= (tk(P304)) ) | ( (tk(P262)) <= (tk(P234)) ) )) | (! ( (tk(P324)) <= (tk(P271)) )) ) | ( ( ( 1 ) <= (tk(P163)) ) | ( ( (! ( (tk(P36)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P104)) ) & ( ( 1 ) <= (tk(P170)) ) ) ) | ( ( ( (tk(P224)) <= ( 1 ) ) | ( (tk(P221)) <= (tk(P96)) ) ) & (! ( (tk(P139)) <= (tk(P30)) )) ) ) ) ) & ( ( (tk(P326)) <= ( 0 ) ) & (! ( ( ( (tk(P106)) <= (tk(P215)) ) & ( ( 1 ) <= (tk(P144)) ) ) | ( ( (tk(P240)) <= ( 0 ) ) & ( (tk(P68)) <= (tk(P229)) ) ) )) ) )) ) | ( (tk(P49)) <= (tk(P131)) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-13 (reachable & potential(( ( (! ( ( (tk(P245)) <= (tk(P313)) ) & ( ( (! ( ( 1 ) <= (tk(P270)) )) | ( (tk(P290)) <= (tk(P142)) ) ) | ( ( (tk(P87)) <= (tk(P160)) ) & ( ( (tk(P144)) <= (tk(P42)) ) & ( ( 1 ) <= (tk(P156)) ) ) ) ) )) | ( (! ( ( ( (! ( ( ( 1 ) <= (tk(P3)) ) & ( (tk(P325)) <= ( 0 ) ) )) & ( ( (tk(P182)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P29)) ) ) ) & ( ( ( 1 ) <= (tk(P285)) ) & ( ( (tk(P85)) <= (tk(P74)) ) & ( (tk(P157)) <= (tk(P58)) ) ) ) ) & ( (tk(P292)) <= ( 1 ) ) )) & ( ( (tk(P124)) <= ( 1 ) ) & (! ( ( ( (! ( ( 1 ) <= (tk(P116)) )) | ( ( (tk(P123)) <= (tk(P196)) ) & ( (tk(P303)) <= (tk(P36)) ) ) ) | ( ( 1 ) <= (tk(P244)) ) ) & ( ( ( (tk(P318)) <= (tk(P213)) ) | (! ( (tk(P119)) <= (tk(P24)) )) ) | ( ( ( ( 1 ) <= (tk(P212)) ) | ( ( 1 ) <= (tk(P279)) ) ) | (! ( (tk(P18)) <= (tk(P188)) )) ) ) )) ) ) ) & ( ( ( 1 ) <= (tk(P206)) ) & (! ( (tk(P143)) <= (tk(P290)) )) ) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( (! ( ( (! ( ( (tk(P218)) <= (tk(P138)) ) | ( (tk(P247)) <= ( 0 ) ) )) | (! ( (tk(P294)) <= ( 0 ) )) ) & ( (tk(P149)) <= (tk(P246)) ) )) | ( ( ( ( (! ( (tk(P165)) <= ( 1 ) )) | ( ( (tk(P53)) <= (tk(P188)) ) & ( (tk(P269)) <= (tk(P210)) ) ) ) & ( (tk(P58)) <= (tk(P279)) ) ) | (! ( ( (tk(P157)) <= (tk(P136)) ) | ( (tk(P106)) <= (tk(P250)) ) )) ) | ( ( 1 ) <= (tk(P130)) ) ) ) | ( ( (tk(P317)) <= ( 1 ) ) | (! ( (! ( ( (tk(P77)) <= (tk(P188)) ) | ( ( (tk(P113)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P289)) ) ) )) & ( (tk(P108)) <= (tk(P153)) ) )) ) ) & ( (tk(P287)) <= ( 0 ) ) ) | (! ( (! ( (tk(P26)) <= (tk(P60)) )) & ( ( ( (tk(P240)) <= (tk(P85)) ) & ( ( ( ( (tk(P138)) <= (tk(P23)) ) & ( ( (tk(P8)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P44)) ) ) ) | (! ( ( (tk(P17)) <= (tk(P62)) ) & ( (tk(P241)) <= (tk(P23)) ) )) ) & ( ( (! ( (tk(P126)) <= (tk(P328)) )) | (! ( ( 1 ) <= (tk(P98)) )) ) & ( ( ( (tk(P18)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P136)) ) ) & ( ( (tk(P105)) <= ( 1 ) ) & ( (tk(P104)) <= ( 0 ) ) ) ) ) ) ) & ( ( ( (! ( ( (tk(P227)) <= (tk(P8)) ) | ( ( 1 ) <= (tk(P263)) ) )) & ( ( ( ( 1 ) <= (tk(P22)) ) & ( ( 1 ) <= (tk(P162)) ) ) & ( ( (tk(P212)) <= (tk(P108)) ) | ( (tk(P98)) <= ( 1 ) ) ) ) ) | ( ( 1 ) <= (tk(P322)) ) ) | ( ( (tk(P227)) <= ( 1 ) ) & (! ( ( ( 1 ) <= (tk(P249)) ) & ( ( 1 ) <= (tk(P319)) ) )) ) ) ) )) )))
PROPERTY: StigmergyCommit-PT-08a-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P75)) <= (tk(P152)) )))
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679375092314

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

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