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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 10:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 627K 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-04b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679351415681

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-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 22:30:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:30:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:30:19] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2023-03-20 22:30:19] [INFO ] Transformed 1534 places.
[2023-03-20 22:30:19] [INFO ] Transformed 2136 transitions.
[2023-03-20 22:30:19] [INFO ] Found NUPN structural information;
[2023-03-20 22:30:19] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 582 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 104 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 12) seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2136 rows 1534 cols
[2023-03-20 22:30:21] [INFO ] Computed 6 place invariants in 66 ms
[2023-03-20 22:30:23] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2023-03-20 22:30:23] [INFO ] After 1341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 22:30:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2023-03-20 22:30:27] [INFO ] After 2682ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-20 22:30:28] [INFO ] Deduced a trap composed of 399 places in 1157 ms of which 14 ms to minimize.
[2023-03-20 22:30:29] [INFO ] Deduced a trap composed of 396 places in 1066 ms of which 2 ms to minimize.
[2023-03-20 22:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2615 ms
[2023-03-20 22:30:31] [INFO ] Deduced a trap composed of 399 places in 916 ms of which 2 ms to minimize.
[2023-03-20 22:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1180 ms
[2023-03-20 22:30:32] [INFO ] Deduced a trap composed of 399 places in 711 ms of which 4 ms to minimize.
[2023-03-20 22:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 950 ms
[2023-03-20 22:30:34] [INFO ] Deduced a trap composed of 397 places in 1340 ms of which 3 ms to minimize.
[2023-03-20 22:30:35] [INFO ] Deduced a trap composed of 400 places in 1048 ms of which 2 ms to minimize.
[2023-03-20 22:30:36] [INFO ] Deduced a trap composed of 397 places in 1099 ms of which 2 ms to minimize.
[2023-03-20 22:30:37] [INFO ] Deduced a trap composed of 401 places in 947 ms of which 5 ms to minimize.
[2023-03-20 22:30:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5190 ms
[2023-03-20 22:30:39] [INFO ] Deduced a trap composed of 489 places in 1061 ms of which 1 ms to minimize.
[2023-03-20 22:30:40] [INFO ] Deduced a trap composed of 397 places in 1257 ms of which 2 ms to minimize.
[2023-03-20 22:30:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2629 ms
[2023-03-20 22:30:42] [INFO ] Deduced a trap composed of 399 places in 1114 ms of which 1 ms to minimize.
[2023-03-20 22:30:43] [INFO ] Deduced a trap composed of 396 places in 923 ms of which 1 ms to minimize.
[2023-03-20 22:30:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2248 ms
[2023-03-20 22:30:43] [INFO ] After 18879ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1130 ms.
[2023-03-20 22:30:44] [INFO ] After 21107ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 73 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1395 edges and 1534 vertex of which 99 / 1534 are part of one of the 15 SCC in 14 ms
Free SCC test removed 84 places
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Graph (complete) has 2169 edges and 1450 vertex of which 1440 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.19 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 999 transitions
Trivial Post-agglo rules discarded 999 transitions
Performed 999 trivial Post agglomeration. Transition count delta: 999
Iterating post reduction 0 with 1004 rules applied. Total rules applied 1006 place count 1440 transition count 1020
Reduce places removed 999 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 1018 rules applied. Total rules applied 2024 place count 441 transition count 1001
Reduce places removed 6 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 65 rules applied. Total rules applied 2089 place count 435 transition count 942
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 2148 place count 376 transition count 942
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 2148 place count 376 transition count 888
Deduced a syphon composed of 54 places in 4 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2256 place count 322 transition count 888
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 2301 place count 277 transition count 843
Iterating global reduction 4 with 45 rules applied. Total rules applied 2346 place count 277 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2347 place count 277 transition count 842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2347 place count 277 transition count 841
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2349 place count 276 transition count 841
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2366 place count 259 transition count 442
Iterating global reduction 5 with 17 rules applied. Total rules applied 2383 place count 259 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2385 place count 259 transition count 440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2386 place count 258 transition count 439
Iterating global reduction 6 with 1 rules applied. Total rules applied 2387 place count 258 transition count 439
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2388 place count 257 transition count 438
Iterating global reduction 6 with 1 rules applied. Total rules applied 2389 place count 257 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2390 place count 257 transition count 437
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2426 place count 239 transition count 419
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2427 place count 239 transition count 418
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2432 place count 234 transition count 413
Iterating global reduction 8 with 5 rules applied. Total rules applied 2437 place count 234 transition count 413
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2440 place count 231 transition count 410
Iterating global reduction 8 with 3 rules applied. Total rules applied 2443 place count 231 transition count 410
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2445 place count 229 transition count 408
Iterating global reduction 8 with 2 rules applied. Total rules applied 2447 place count 229 transition count 408
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2465 place count 220 transition count 424
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2467 place count 220 transition count 422
Free-agglomeration rule applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 2508 place count 220 transition count 381
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 2549 place count 179 transition count 381
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 9 with 55 rules applied. Total rules applied 2604 place count 179 transition count 326
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2606 place count 179 transition count 326
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2608 place count 179 transition count 326
Applied a total of 2608 rules in 635 ms. Remains 179 /1534 variables (removed 1355) and now considering 326/2136 (removed 1810) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 179/1534 places, 326/2136 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 326 rows 179 cols
[2023-03-20 22:30:46] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 22:30:46] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-20 22:30:46] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 22:30:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-20 22:30:46] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 22:30:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 22:30:46] [INFO ] After 106ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 22:30:46] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2023-03-20 22:30:46] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2023-03-20 22:30:47] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 0 ms to minimize.
[2023-03-20 22:30:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 593 ms
[2023-03-20 22:30:47] [INFO ] After 1269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-20 22:30:47] [INFO ] After 1713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
Support contains 20 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 326/326 transitions.
Graph (trivial) has 98 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 178 transition count 283
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 137 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 136 transition count 280
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 87 place count 136 transition count 273
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 129 transition count 273
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 112 place count 118 transition count 262
Iterating global reduction 3 with 11 rules applied. Total rules applied 123 place count 118 transition count 262
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 114 transition count 258
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 114 transition count 258
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 112 transition count 256
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 112 transition count 256
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 110 transition count 254
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 110 transition count 254
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 155 place count 102 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 102 transition count 242
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 167 place count 94 transition count 234
Iterating global reduction 4 with 8 rules applied. Total rules applied 175 place count 94 transition count 234
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 180 place count 89 transition count 229
Iterating global reduction 4 with 5 rules applied. Total rules applied 185 place count 89 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 194 place count 89 transition count 220
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 198 place count 85 transition count 216
Iterating global reduction 5 with 4 rules applied. Total rules applied 202 place count 85 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 213 place count 85 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 84 transition count 211
Free-agglomeration rule applied 16 times with reduction of 16 identical transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 231 place count 84 transition count 179
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 249 place count 68 transition count 177
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 264 place count 68 transition count 162
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 268 place count 68 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 269 place count 68 transition count 161
Applied a total of 269 rules in 113 ms. Remains 68 /179 variables (removed 111) and now considering 161/326 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 68/179 places, 161/326 transitions.
Incomplete random walk after 10000 steps, including 316 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 5) seen :3
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 161 rows 68 cols
[2023-03-20 22:30:48] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 22:30:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:30:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-20 22:30:48] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:30:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 22:30:48] [INFO ] After 29ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:30:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 3 ms to minimize.
[2023-03-20 22:30:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-20 22:30:48] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 22:30:48] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 29786 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 04b
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: 1534 places, 2136 transitions, 8601 arcs.
Final Score: 193743.147
Took : 37 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-00 (reachable & potential(( ( 1 ) <= (tk(P1451)) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-01 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P393)) )) | ( ( ( ( ( 1 ) <= (tk(P586)) ) & (! ( ( ( 1 ) <= (tk(P1168)) ) & ( ( ( ( ( 1 ) <= (tk(P930)) ) | ( (tk(P207)) <= ( 0 ) ) ) | ( ( (tk(P952)) <= (tk(P370)) ) & ( (tk(P190)) <= (tk(P36)) ) ) ) & ( ( ( (tk(P581)) <= ( 1 ) ) | ( (tk(P1398)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P806)) ) | ( ( 1 ) <= (tk(P278)) ) ) ) ) )) ) & (! ( (! ( ( ( ( (tk(P71)) <= (tk(P1395)) ) & ( (tk(P422)) <= (tk(P497)) ) ) | ( ( (tk(P404)) <= ( 0 ) ) | ( (tk(P1515)) <= (tk(P1358)) ) ) ) & ( ( ( (tk(P531)) <= (tk(P1241)) ) & ( (tk(P997)) <= (tk(P371)) ) ) & (! ( (tk(P1315)) <= (tk(P1384)) )) ) )) | (! ( (! ( (tk(P1119)) <= (tk(P1477)) )) & (! ( ( ( 1 ) <= (tk(P1154)) ) | ( ( 1 ) <= (tk(P663)) ) )) )) )) ) & ( (! ( (! ( (tk(P841)) <= (tk(P1140)) )) & ( ( (tk(P852)) <= ( 1 ) ) & ( ( ( ( (tk(P378)) <= ( 0 ) ) & ( (tk(P1333)) <= ( 0 ) ) ) & ( ( (tk(P324)) <= (tk(P792)) ) | ( ( 1 ) <= (tk(P677)) ) ) ) & ( ( ( (tk(P735)) <= ( 0 ) ) & ( (tk(P691)) <= ( 0 ) ) ) | ( (tk(P1014)) <= (tk(P299)) ) ) ) ) )) | ( (tk(P510)) <= (tk(P1491)) ) ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P841)) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P156)) ) & ( (tk(P1452)) <= ( 0 ) ) ) | ( ( (tk(P1530)) <= ( 1 ) ) | ( (tk(P562)) <= ( 0 ) ) ) ) & (! ( (tk(P1167)) <= (tk(P1373)) )) ) & ( ( (tk(P1502)) <= ( 1 ) ) | ( (! ( ( 1 ) <= (tk(P358)) )) & (! ( (tk(P68)) <= (tk(P1210)) )) ) ) ) | ( (tk(P1455)) <= (tk(P890)) ) ) | ( ( (! ( (! ( (tk(P1532)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P853)) ) & ( ( 1 ) <= (tk(P1327)) ) ) )) & ( ( ( 1 ) <= (tk(P82)) ) & (! ( (tk(P626)) <= ( 0 ) )) ) ) | ( ( 1 ) <= (tk(P505)) ) ) ) | ( ( (tk(P50)) <= ( 1 ) ) & (! ( ( ( ( ( ( 1 ) <= (tk(P148)) ) | ( ( 1 ) <= (tk(P277)) ) ) & ( ( ( 1 ) <= (tk(P418)) ) & ( ( 1 ) <= (tk(P1160)) ) ) ) & (! ( (tk(P393)) <= (tk(P1354)) )) ) & ( (tk(P935)) <= (tk(P39)) ) )) ) ) | ( ( ( 1 ) <= (tk(P1030)) ) & ( (tk(P1029)) <= ( 0 ) ) ) ) | ( (tk(P1029)) <= ( 1 ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-04 (reachable & potential(( (! ( ( (tk(P118)) <= ( 0 ) ) & (! ( ( (tk(P1295)) <= (tk(P241)) ) & (! ( ( ( 1 ) <= (tk(P1439)) ) | ( (tk(P509)) <= (tk(P1451)) ) )) )) )) & ( ( ( 1 ) <= (tk(P788)) ) & ( (tk(P1449)) <= (tk(P1525)) ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( ( (tk(P1187)) <= ( 1 ) ) & (! ( (! ( ( (tk(P1150)) <= (tk(P1398)) ) & ( (tk(P261)) <= ( 1 ) ) )) & ( ( ( ( ( 1 ) <= (tk(P163)) ) | ( ( 1 ) <= (tk(P226)) ) ) | ( ( 1 ) <= (tk(P1445)) ) ) | ( (! ( (tk(P506)) <= (tk(P524)) )) | ( ( (tk(P165)) <= (tk(P974)) ) | ( ( 1 ) <= (tk(P733)) ) ) ) ) )) ) & (! ( ( ( ( ( ( ( 1 ) <= (tk(P284)) ) & ( ( 1 ) <= (tk(P1212)) ) ) & (! ( (tk(P954)) <= ( 1 ) )) ) | ( ( ( 1 ) <= (tk(P1281)) ) | (! ( ( 1 ) <= (tk(P361)) )) ) ) & ( ( (! ( (tk(P719)) <= (tk(P286)) )) | ( (tk(P669)) <= ( 1 ) ) ) & ( ( ( (tk(P879)) <= (tk(P104)) ) & ( ( 1 ) <= (tk(P792)) ) ) & ( (tk(P512)) <= (tk(P1183)) ) ) ) ) | ( ( 1 ) <= (tk(P249)) ) )) ) | ( ( ( ( (tk(P941)) <= ( 0 ) ) & ( (! ( ( ( (tk(P1180)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P861)) ) ) | ( ( (tk(P1490)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1335)) ) ) )) | (! ( (! ( (tk(P370)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P67)) ) & ( (tk(P805)) <= ( 1 ) ) ) )) ) ) & ( ( ( ( (! ( (tk(P454)) <= (tk(P456)) )) | ( ( (tk(P1376)) <= ( 1 ) ) & ( (tk(P1505)) <= (tk(P942)) ) ) ) & ( (tk(P584)) <= (tk(P550)) ) ) | ( ( (tk(P1040)) <= ( 0 ) ) | (! ( ( (tk(P656)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P795)) ) )) ) ) & (! ( ( 1 ) <= (tk(P1285)) )) ) ) & ( ( ( (! ( ( (tk(P819)) <= (tk(P872)) ) | ( (tk(P527)) <= (tk(P176)) ) )) & ( ( (! ( ( 1 ) <= (tk(P1112)) )) & ( ( (tk(P1375)) <= ( 0 ) ) | ( (tk(P1471)) <= ( 1 ) ) ) ) & ( ( ( 1 ) <= (tk(P296)) ) | ( ( (tk(P437)) <= (tk(P450)) ) & ( (tk(P601)) <= ( 0 ) ) ) ) ) ) | ( (tk(P223)) <= ( 1 ) ) ) & (! ( ( ( ( ( ( 1 ) <= (tk(P744)) ) | ( (tk(P195)) <= (tk(P383)) ) ) | (! ( ( 1 ) <= (tk(P89)) )) ) | ( (! ( (tk(P165)) <= ( 0 ) )) & (! ( (tk(P1060)) <= (tk(P322)) )) ) ) | ( ( 1 ) <= (tk(P53)) ) )) ) ) ) & ( ( (tk(P1287)) <= (tk(P998)) ) & ( (tk(P1478)) <= ( 0 ) ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-06 (reachable &!potential( ( ( ( (tk(P614)) <= ( 0 ) ) | (! ( ( ( ( ( ( 1 ) <= (tk(P662)) ) | ( ( (tk(P1037)) <= ( 1 ) ) & (! ( (tk(P453)) <= (tk(P76)) )) ) ) & (! ( ( 1 ) <= (tk(P916)) )) ) & (! ( (! ( (tk(P1009)) <= (tk(P1143)) )) | ( ( (tk(P218)) <= (tk(P522)) ) & ( (tk(P296)) <= (tk(P594)) ) ) )) ) | (! ( (tk(P920)) <= ( 0 ) )) )) ) | ( (tk(P1206)) <= ( 1 ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P566)) <= (tk(P1270)) ) | (! ( (tk(P1143)) <= ( 1 ) )) ) | ( (! ( (! ( (! ( ( ( (tk(P709)) <= ( 0 ) ) & ( (tk(P986)) <= ( 1 ) ) ) | ( ( (tk(P110)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P1434)) ) ) )) | (! ( ( ( ( 1 ) <= (tk(P1102)) ) | ( (tk(P1115)) <= ( 1 ) ) ) & ( (tk(P208)) <= ( 1 ) ) )) )) & ( ( ( (tk(P209)) <= (tk(P460)) ) | ( (tk(P1391)) <= (tk(P95)) ) ) | ( ( 1 ) <= (tk(P1064)) ) ) )) & (! ( (tk(P908)) <= (tk(P232)) )) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P1137)) <= (tk(P1449)) ) & ( (tk(P1003)) <= ( 0 ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( ( ( (tk(P1262)) <= (tk(P1133)) ) & ( ( (! ( (tk(P1191)) <= (tk(P601)) )) | (! ( (tk(P493)) <= ( 0 ) )) ) & ( ( (! ( (tk(P1021)) <= (tk(P328)) )) & (! ( (tk(P1374)) <= ( 0 ) )) ) & ( ( ( (tk(P661)) <= (tk(P1212)) ) | ( (tk(P1000)) <= ( 1 ) ) ) & ( (tk(P769)) <= ( 0 ) ) ) ) ) ) & ( ( ( (! ( (tk(P1045)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P719)) ) ) | ( (! ( (tk(P753)) <= (tk(P1321)) )) | ( ( 1 ) <= (tk(P1264)) ) ) ) & (! ( ( 1 ) <= (tk(P744)) )) ) ) & (! ( (tk(P1533)) <= ( 1 ) )) ) & (! ( ( ( ( 1 ) <= (tk(P733)) ) & ( ( ( (tk(P339)) <= (tk(P932)) ) | ( ( (tk(P1446)) <= ( 0 ) ) & ( (tk(P1113)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P938)) ) ) ) | (! ( ( ( 1 ) <= (tk(P192)) ) | ( (! ( (tk(P1403)) <= (tk(P1008)) )) | ( (tk(P18)) <= ( 1 ) ) ) )) )) ))))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-10 (reachable &!potential( (! ( ( 1 ) <= (tk(P79)) ))))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-11 (reachable & potential(( ( (! ( ( ( 1 ) <= (tk(P190)) ) & (! ( (tk(P385)) <= (tk(P204)) )) )) & ( (! ( ( (tk(P568)) <= ( 1 ) ) & ( (tk(P377)) <= ( 1 ) ) )) & ( (! ( ( (! ( ( ( 1 ) <= (tk(P1253)) ) | ( ( 1 ) <= (tk(P1427)) ) )) | (! ( (tk(P3)) <= (tk(P1193)) )) ) | (! ( (tk(P877)) <= (tk(P813)) )) )) & ( ( 1 ) <= (tk(P1427)) ) ) ) ) & (! ( ( (tk(P783)) <= ( 1 ) ) & ( (tk(P1431)) <= (tk(P522)) ) )) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( ( ( (! ( (tk(P1256)) <= (tk(P397)) )) | (! ( (! ( ( 1 ) <= (tk(P1470)) )) & ( (tk(P1377)) <= ( 1 ) ) )) ) | ( ( (tk(P684)) <= ( 1 ) ) & (! ( ( ( (tk(P1120)) <= (tk(P825)) ) & ( (tk(P469)) <= (tk(P349)) ) ) & ( ( (tk(P202)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1072)) ) ) )) ) ) & ( ( 1 ) <= (tk(P160)) ) ) | ( (tk(P473)) <= ( 1 ) ) ) & ( (tk(P1422)) <= (tk(P1135)) ) ) | ( ( 1 ) <= (tk(P233)) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( (tk(P838)) <= (tk(P990)) ) & ( ( ( (tk(P1447)) <= ( 1 ) ) | ( (tk(P671)) <= (tk(P914)) ) ) & ( ( (tk(P1309)) <= ( 1 ) ) | (! ( (tk(P1134)) <= (tk(P643)) )) ) ) ) | ( ( ( ( ( ( (tk(P1244)) <= (tk(P803)) ) | ( ( ( ( 1 ) <= (tk(P604)) ) & ( (tk(P235)) <= (tk(P540)) ) ) | ( ( ( 1 ) <= (tk(P13)) ) | ( (tk(P178)) <= (tk(P1322)) ) ) ) ) | (! ( ( (tk(P1322)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1221)) ) )) ) | ( (! ( ( ( (tk(P1209)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1225)) ) ) | ( (tk(P336)) <= ( 1 ) ) )) & ( ( ( ( (tk(P615)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1070)) ) ) | ( ( ( 1 ) <= (tk(P1300)) ) | ( (tk(P685)) <= (tk(P375)) ) ) ) & ( ( ( (tk(P280)) <= (tk(P921)) ) | ( ( 1 ) <= (tk(P1480)) ) ) & ( ( ( 1 ) <= (tk(P777)) ) & ( (tk(P323)) <= (tk(P481)) ) ) ) ) ) ) & ( ( (tk(P393)) <= ( 1 ) ) | ( ( ( ( (tk(P1321)) <= (tk(P1367)) ) & ( (tk(P414)) <= ( 0 ) ) ) | ( (! ( ( 1 ) <= (tk(P1466)) )) | (! ( (tk(P1485)) <= ( 0 ) )) ) ) | ( ( ( ( 1 ) <= (tk(P405)) ) | ( ( 1 ) <= (tk(P1077)) ) ) & ( ( 1 ) <= (tk(P1149)) ) ) ) ) ) & (! ( ( ( (tk(P964)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P1032)) ) & ( ( ( (tk(P1321)) <= ( 1 ) ) | ( (tk(P165)) <= (tk(P733)) ) ) | (! ( (tk(P978)) <= (tk(P1229)) )) ) ) ) & (! ( ( ( ( 1 ) <= (tk(P227)) ) & ( (tk(P1472)) <= (tk(P1357)) ) ) | ( (tk(P593)) <= (tk(P1307)) ) )) )) ) ) | ( ( ( (! ( (! ( ( 1 ) <= (tk(P1415)) )) | ( (tk(P627)) <= (tk(P929)) ) )) & ( ( 1 ) <= (tk(P254)) ) ) & ( ( ( ( ( ( (tk(P114)) <= ( 0 ) ) & ( ( (tk(P580)) <= ( 1 ) ) | ( (tk(P558)) <= ( 1 ) ) ) ) & ( ( ( (tk(P147)) <= (tk(P1322)) ) & ( ( 1 ) <= (tk(P304)) ) ) | (! ( (tk(P565)) <= ( 1 ) )) ) ) & ( ( ( (tk(P440)) <= (tk(P1266)) ) & (! ( ( 1 ) <= (tk(P700)) )) ) & ( ( 1 ) <= (tk(P237)) ) ) ) | ( (! ( ( (tk(P725)) <= (tk(P827)) ) & ( (tk(P235)) <= ( 0 ) ) )) | ( (! ( ( (tk(P954)) <= (tk(P604)) ) | ( ( 1 ) <= (tk(P793)) ) )) | ( ( ( ( 1 ) <= (tk(P875)) ) & ( ( 1 ) <= (tk(P424)) ) ) & ( ( 1 ) <= (tk(P1425)) ) ) ) ) ) | (! ( ( (! ( ( ( 1 ) <= (tk(P313)) ) & ( (tk(P221)) <= ( 1 ) ) )) & ( ( ( 1 ) <= (tk(P740)) ) | ( ( (tk(P1170)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P646)) ) ) ) ) & ( ( (! ( (tk(P48)) <= (tk(P34)) )) | ( ( ( 1 ) <= (tk(P1442)) ) | ( (tk(P1422)) <= (tk(P755)) ) ) ) | (! ( ( (tk(P982)) <= ( 1 ) ) | ( (tk(P1128)) <= ( 1 ) ) )) ) )) ) ) | ( (tk(P819)) <= (tk(P348)) ) ) )))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-14 (reachable &!potential( (! ( ( ( (tk(P1084)) <= ( 0 ) ) & ( ( (tk(P749)) <= (tk(P937)) ) & ( ( ( 1 ) <= (tk(P1427)) ) | ( ( ( (! ( (tk(P1493)) <= ( 1 ) )) & ( ( (tk(P242)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1415)) ) ) ) & ( (! ( ( 1 ) <= (tk(P1296)) )) | ( ( ( 1 ) <= (tk(P1099)) ) | ( ( 1 ) <= (tk(P1208)) ) ) ) ) & ( ( 1 ) <= (tk(P1392)) ) ) ) ) ) & ( (! ( (tk(P1170)) <= (tk(P246)) )) & ( (tk(P824)) <= (tk(P1326)) ) ) ))))
PROPERTY: StigmergyCommit-PT-04b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P967)) <= (tk(P231)) ) | ( (tk(P313)) <= (tk(P1531)) ) ) & ( (tk(P809)) <= (tk(P116)) ) ) | ( (tk(P611)) <= ( 0 ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13114372 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104680 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
Caught signal 15, terminating.

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-04b"
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-04b, 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-167912651200438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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