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-167912651500598.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 StigmergyElection-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-167912651500598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 203K 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 StigmergyElection-PT-04b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679434599472

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=StigmergyElection-PT-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 21:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:36:42] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-21 21:36:42] [INFO ] Transformed 563 places.
[2023-03-21 21:36:42] [INFO ] Transformed 780 transitions.
[2023-03-21 21:36:42] [INFO ] Found NUPN structural information;
[2023-03-21 21:36:42] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 137 resets, run finished after 1163 ms. (steps per millisecond=8 ) properties (out of 13) seen :5
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 780 rows 563 cols
[2023-03-21 21:36:44] [INFO ] Computed 5 place invariants in 25 ms
[2023-03-21 21:36:45] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 21:36:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-21 21:36:46] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-21 21:36:47] [INFO ] Deduced a trap composed of 189 places in 349 ms of which 11 ms to minimize.
[2023-03-21 21:36:47] [INFO ] Deduced a trap composed of 190 places in 464 ms of which 3 ms to minimize.
[2023-03-21 21:36:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 959 ms
[2023-03-21 21:36:48] [INFO ] Deduced a trap composed of 191 places in 336 ms of which 3 ms to minimize.
[2023-03-21 21:36:48] [INFO ] Deduced a trap composed of 192 places in 329 ms of which 3 ms to minimize.
[2023-03-21 21:36:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2023-03-21 21:36:49] [INFO ] Deduced a trap composed of 189 places in 529 ms of which 3 ms to minimize.
[2023-03-21 21:36:49] [INFO ] Deduced a trap composed of 191 places in 395 ms of which 1 ms to minimize.
[2023-03-21 21:36:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1056 ms
[2023-03-21 21:36:50] [INFO ] Deduced a trap composed of 189 places in 406 ms of which 1 ms to minimize.
[2023-03-21 21:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2023-03-21 21:36:50] [INFO ] After 4591ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-21 21:36:50] [INFO ] After 5426ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 107 ms.
Support contains 67 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 452 edges and 563 vertex of which 31 / 563 are part of one of the 6 SCC in 8 ms
Free SCC test removed 25 places
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 913 edges and 538 vertex of which 532 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 532 transition count 479
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 270 rules applied. Total rules applied 538 place count 268 transition count 473
Reduce places removed 3 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 41 rules applied. Total rules applied 579 place count 265 transition count 435
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 42 rules applied. Total rules applied 621 place count 227 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 623 place count 225 transition count 431
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 623 place count 225 transition count 421
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 643 place count 215 transition count 421
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 669 place count 189 transition count 395
Iterating global reduction 5 with 26 rules applied. Total rules applied 695 place count 189 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 696 place count 189 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 696 place count 189 transition count 392
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 700 place count 187 transition count 392
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 707 place count 180 transition count 274
Iterating global reduction 6 with 7 rules applied. Total rules applied 714 place count 180 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 716 place count 180 transition count 272
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 754 place count 161 transition count 253
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 755 place count 161 transition count 252
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 763 place count 157 transition count 254
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 771 place count 157 transition count 246
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 795 place count 157 transition count 222
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 819 place count 133 transition count 222
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 821 place count 133 transition count 220
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 824 place count 133 transition count 220
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 825 place count 133 transition count 219
Applied a total of 825 rules in 231 ms. Remains 133 /563 variables (removed 430) and now considering 219/780 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 133/563 places, 219/780 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 6) seen :4
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 219 rows 133 cols
[2023-03-21 21:36:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 21:36:51] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:36:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-21 21:36:51] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:36:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 21:36:51] [INFO ] After 56ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:36:51] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-21 21:36:51] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 219/219 transitions.
Graph (trivial) has 47 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 131 transition count 197
Reduce places removed 18 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 113 transition count 193
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 109 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 109 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 108 transition count 192
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 105 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 105 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 104 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 104 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 103 transition count 186
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 103 transition count 183
Free-agglomeration rule applied 7 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 69 place count 103 transition count 168
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 80 place count 96 transition count 164
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 89 place count 96 transition count 155
Applied a total of 89 rules in 49 ms. Remains 96 /133 variables (removed 37) and now considering 155/219 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 96/133 places, 155/219 transitions.
Incomplete random walk after 10000 steps, including 419 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 96 cols
[2023-03-21 21:36:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 21:36:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:36:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 21:36:52] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:36:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 21:36:52] [INFO ] After 35ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:36:52] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-21 21:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-21 21:36:52] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-21 21:36:52] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 155/155 transitions.
Graph (trivial) has 65 edges and 96 vertex of which 14 / 96 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 211 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 86 transition count 117
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 64 transition count 114
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 63 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 60 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 57 place count 60 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 65 place count 56 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 54 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 54 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 53 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 53 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 47 transition count 98
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 87 place count 43 transition count 94
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 43 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 42 transition count 94
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 42 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 42 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 41 transition count 90
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 103 place count 41 transition count 85
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 110 place count 36 transition count 83
Applied a total of 110 rules in 29 ms. Remains 36 /96 variables (removed 60) and now considering 83/155 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 36/96 places, 83/155 transitions.
Finished random walk after 6413 steps, including 385 resets, run visited all 1 properties in 12 ms. (steps per millisecond=534 )
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10460 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyElection (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: 563 places, 780 transitions, 2680 arcs.
Final Score: 25540.607
Took : 39 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-00 (reachable &!potential( ( ( ( 1 ) <= (tk(P130)) ) | ( ( ( 1 ) <= (tk(P144)) ) | ( ( ( (tk(P339)) <= (tk(P305)) ) & ( (! ( ( 1 ) <= (tk(P397)) )) | ( (! ( ( ( ( 1 ) <= (tk(P346)) ) & ( ( 1 ) <= (tk(P186)) ) ) & ( (tk(P150)) <= (tk(P416)) ) )) | ( (tk(P542)) <= (tk(P477)) ) ) ) ) & ( ( ( (tk(P314)) <= (tk(P503)) ) | (! ( ( ( (tk(P313)) <= (tk(P4)) ) | ( (tk(P525)) <= ( 1 ) ) ) & ( (tk(P49)) <= ( 0 ) ) )) ) | ( ( ( ( (! ( (tk(P466)) <= (tk(P337)) )) | (! ( (tk(P416)) <= ( 0 ) )) ) | ( ( ( ( 1 ) <= (tk(P159)) ) | ( (tk(P394)) <= ( 1 ) ) ) & (! ( (tk(P214)) <= (tk(P138)) )) ) ) | (! ( ( ( (tk(P55)) <= ( 1 ) ) & ( (tk(P59)) <= (tk(P503)) ) ) | ( ( ( 1 ) <= (tk(P523)) ) & ( (tk(P111)) <= ( 0 ) ) ) )) ) & ( ( ( ( 1 ) <= (tk(P102)) ) & ( (tk(P457)) <= (tk(P10)) ) ) & ( ( (! ( (tk(P23)) <= (tk(P170)) )) | ( ( ( 1 ) <= (tk(P185)) ) & ( (tk(P203)) <= (tk(P447)) ) ) ) & ( ( ( (tk(P48)) <= ( 1 ) ) | ( (tk(P105)) <= (tk(P51)) ) ) | ( ( (tk(P99)) <= ( 0 ) ) & ( (tk(P344)) <= (tk(P149)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-01 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P483)) )) & ( ( (! ( ( ( ( ( (tk(P310)) <= ( 0 ) ) & (! ( ( 1 ) <= (tk(P496)) )) ) | ( ( (tk(P443)) <= ( 0 ) ) | (! ( (tk(P360)) <= (tk(P448)) )) ) ) | (! ( ( 1 ) <= (tk(P470)) )) ) & (! ( (! ( ( (tk(P316)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P248)) ) )) | ( ( ( (tk(P98)) <= (tk(P112)) ) & ( (tk(P209)) <= ( 0 ) ) ) & ( (tk(P158)) <= (tk(P132)) ) ) )) )) & ( ( (tk(P53)) <= (tk(P215)) ) | (! ( (tk(P383)) <= (tk(P340)) )) ) ) & (! ( (! ( (tk(P280)) <= ( 0 ) )) & ( ( ( ( ( ( (tk(P373)) <= (tk(P240)) ) & ( (tk(P139)) <= (tk(P111)) ) ) & ( ( (tk(P481)) <= (tk(P53)) ) | ( (tk(P100)) <= (tk(P38)) ) ) ) & ( (! ( ( 1 ) <= (tk(P4)) )) & ( ( ( 1 ) <= (tk(P482)) ) & ( (tk(P523)) <= ( 1 ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P517)) ) | ( ( 1 ) <= (tk(P171)) ) ) | ( ( (tk(P71)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P270)) ) & ( (tk(P229)) <= (tk(P400)) ) ) ) ) ) | ( ( 1 ) <= (tk(P392)) ) ) )) ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-02 (reachable &!potential( (! ( ( 1 ) <= (tk(P16)) ))))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P24)) <= ( 1 ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-04 (reachable & potential(( ( 1 ) <= (tk(P72)) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P404)) ) | ( (tk(P384)) <= ( 0 ) ) ) | (! ( (tk(P230)) <= ( 1 ) )) ) & ( (! ( ( 1 ) <= (tk(P47)) )) | ( ( ( 1 ) <= (tk(P114)) ) & ( (tk(P71)) <= (tk(P84)) ) ) ) )) | ( ( 1 ) <= (tk(P217)) ) ) & ( ( ( ( ( (tk(P359)) <= ( 1 ) ) | ( ( ( (tk(P554)) <= ( 0 ) ) | ( (tk(P185)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P192)) )) ) ) | (! ( ( (tk(P496)) <= ( 0 ) ) | ( (tk(P55)) <= ( 0 ) ) )) ) & ( (! ( ( ( (tk(P558)) <= (tk(P514)) ) & ( ( 1 ) <= (tk(P4)) ) ) & ( ( (tk(P56)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P60)) ) ) )) & ( ( (tk(P40)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P459)) ) & ( ( 1 ) <= (tk(P236)) ) ) | ( ( ( 1 ) <= (tk(P446)) ) & ( (tk(P173)) <= ( 1 ) ) ) ) ) ) ) | (! ( (! ( ( ( 1 ) <= (tk(P214)) ) & ( ( 1 ) <= (tk(P181)) ) )) | ( (! ( (tk(P520)) <= ( 0 ) )) | ( (tk(P438)) <= ( 1 ) ) ) )) ) ) & ( ( ( ( 1 ) <= (tk(P32)) ) & (! ( ( ( 1 ) <= (tk(P245)) ) | ( ( 1 ) <= (tk(P421)) ) )) ) | ( (tk(P319)) <= (tk(P203)) ) ) ) | ( (tk(P235)) <= ( 1 ) ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-06 (reachable &!potential( ( ( (tk(P277)) <= (tk(P252)) ) & ( ( ( 1 ) <= (tk(P223)) ) | ( ( ( ( ( 1 ) <= (tk(P364)) ) | ( ( ( ( ( (tk(P164)) <= (tk(P284)) ) & ( ( 1 ) <= (tk(P31)) ) ) & ( ( ( 1 ) <= (tk(P438)) ) | ( (tk(P518)) <= ( 1 ) ) ) ) | ( ( (tk(P100)) <= (tk(P153)) ) | (! ( ( 1 ) <= (tk(P48)) )) ) ) | ( (tk(P502)) <= (tk(P340)) ) ) ) | ( (tk(P181)) <= ( 0 ) ) ) | ( ( (! ( (! ( ( 1 ) <= (tk(P76)) )) | ( ( ( 1 ) <= (tk(P432)) ) & ( (tk(P225)) <= ( 0 ) ) ) )) | ( (! ( ( (tk(P261)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P36)) ) )) & ( (! ( ( 1 ) <= (tk(P485)) )) & ( ( 1 ) <= (tk(P304)) ) ) ) ) & ( ( (tk(P61)) <= ( 1 ) ) | ( ( ( (tk(P73)) <= ( 0 ) ) | (! ( (tk(P418)) <= ( 1 ) )) ) & ( ( ( (tk(P64)) <= ( 1 ) ) | (! ( (tk(P535)) <= (tk(P273)) )) ) & (! ( ( 1 ) <= (tk(P55)) )) ) ) ) ) ) ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P258)) <= ( 0 ) ) | (! ( (tk(P86)) <= ( 0 ) )) ) & (! ( (tk(P344)) <= (tk(P400)) )) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-08 (reachable &!potential( (! ( ( ( ( 1 ) <= (tk(P403)) ) | ( (! ( ( ( 1 ) <= (tk(P495)) ) & ( ( (! ( ( 1 ) <= (tk(P332)) )) | ( (tk(P203)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P112)) ) ) )) | (! ( ( (tk(P293)) <= ( 1 ) ) & ( ( ( ( (tk(P149)) <= ( 1 ) ) | ( (tk(P501)) <= ( 1 ) ) ) & ( ( (tk(P253)) <= (tk(P298)) ) | ( ( 1 ) <= (tk(P118)) ) ) ) | ( ( 1 ) <= (tk(P28)) ) ) )) ) ) & (! ( ( ( (! ( ( (tk(P380)) <= (tk(P227)) ) & (! ( (tk(P71)) <= ( 0 ) )) )) & ( ( (tk(P230)) <= (tk(P115)) ) & ( (tk(P129)) <= (tk(P428)) ) ) ) | ( (! ( ( ( (tk(P423)) <= ( 0 ) ) | ( (tk(P285)) <= ( 0 ) ) ) & ( ( (tk(P297)) <= (tk(P106)) ) & ( ( 1 ) <= (tk(P66)) ) ) )) | (! ( (tk(P292)) <= ( 1 ) )) ) ) | ( ( ( ( (! ( (tk(P423)) <= (tk(P317)) )) | ( ( (tk(P210)) <= (tk(P192)) ) | ( (tk(P519)) <= ( 1 ) ) ) ) & ( ( ( (tk(P251)) <= (tk(P104)) ) & ( (tk(P515)) <= (tk(P369)) ) ) & (! ( (tk(P25)) <= (tk(P103)) )) ) ) & ( (! ( ( (tk(P318)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P274)) ) )) & (! ( ( (tk(P343)) <= (tk(P65)) ) | ( (tk(P228)) <= ( 0 ) ) )) ) ) | (! ( (tk(P299)) <= (tk(P54)) )) ) )) ))))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P185)) ) | ( (! ( (! ( ( 1 ) <= (tk(P418)) )) | (! ( (! ( ( ( 1 ) <= (tk(P389)) ) & ( (tk(P39)) <= ( 1 ) ) )) & (! ( ( 1 ) <= (tk(P457)) )) )) )) & ( (tk(P164)) <= (tk(P185)) ) ) ))))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-10 (reachable & potential(( ( ( ( 1 ) <= (tk(P179)) ) & ( (! ( ( (tk(P259)) <= (tk(P453)) ) | ( (! ( ( ( ( 1 ) <= (tk(P489)) ) | ( (tk(P520)) <= ( 0 ) ) ) & ( (tk(P228)) <= ( 1 ) ) )) & ( (tk(P71)) <= ( 0 ) ) ) )) | ( (! ( ( 1 ) <= (tk(P252)) )) & ( (! ( ( ( (tk(P27)) <= ( 0 ) ) | ( (tk(P257)) <= ( 0 ) ) ) | ( (tk(P495)) <= (tk(P372)) ) )) & ( ( ( 1 ) <= (tk(P188)) ) | ( (! ( ( 1 ) <= (tk(P557)) )) & ( ( ( (tk(P397)) <= (tk(P99)) ) | ( ( 1 ) <= (tk(P154)) ) ) | ( (tk(P544)) <= ( 0 ) ) ) ) ) ) ) ) ) & (! ( ( ( (tk(P102)) <= (tk(P530)) ) & ( (tk(P19)) <= (tk(P465)) ) ) & (! ( ( 1 ) <= (tk(P133)) )) )) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-11 (reachable &!potential( ( ( (! ( (tk(P250)) <= (tk(P73)) )) | ( ( (tk(P487)) <= (tk(P400)) ) & ( (tk(P319)) <= ( 0 ) ) ) ) & ( ( ( 1 ) <= (tk(P502)) ) | ( (! ( (tk(P188)) <= (tk(P235)) )) | ( ( (! ( ( 1 ) <= (tk(P341)) )) | ( ( ( 1 ) <= (tk(P544)) ) | (! ( ( ( ( 1 ) <= (tk(P541)) ) | ( ( 1 ) <= (tk(P516)) ) ) | ( ( ( 1 ) <= (tk(P207)) ) | ( (tk(P250)) <= ( 0 ) ) ) )) ) ) & ( ( ( 1 ) <= (tk(P375)) ) | ( ( ( ( (tk(P441)) <= (tk(P459)) ) | ( ( ( 1 ) <= (tk(P471)) ) | ( (tk(P397)) <= (tk(P35)) ) ) ) & (! ( ( 1 ) <= (tk(P435)) )) ) | (! ( ( 1 ) <= (tk(P434)) )) ) ) ) ) ) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-12 (reachable &!potential( (! ( (! ( (tk(P87)) <= ( 1 ) )) & ( ( ( ( 1 ) <= (tk(P463)) ) & ( (! ( ( ( ( (tk(P98)) <= (tk(P146)) ) | ( (tk(P370)) <= (tk(P40)) ) ) | (! ( (tk(P353)) <= ( 1 ) )) ) | (! ( ( ( 1 ) <= (tk(P1)) ) & ( (tk(P492)) <= ( 1 ) ) )) )) & (! ( ( 1 ) <= (tk(P544)) )) ) ) | ( (tk(P334)) <= (tk(P240)) ) ) ))))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P81)) )))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-14 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P517)) ) & (! ( (! ( (! ( ( (tk(P408)) <= (tk(P479)) ) & ( (tk(P172)) <= ( 0 ) ) )) | ( ( ( 1 ) <= (tk(P390)) ) | ( ( ( (tk(P14)) <= (tk(P278)) ) & ( ( 1 ) <= (tk(P150)) ) ) & ( ( (tk(P21)) <= ( 0 ) ) & ( (tk(P562)) <= ( 1 ) ) ) ) ) )) | (! ( (! ( ( (tk(P449)) <= (tk(P343)) ) & ( ( 1 ) <= (tk(P81)) ) )) & ( (! ( ( 1 ) <= (tk(P244)) )) | ( ( (tk(P15)) <= ( 1 ) ) & ( (tk(P389)) <= ( 1 ) ) ) ) )) )) ))))
PROPERTY: StigmergyElection-PT-04b-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P330)) <= ( 0 ) )))
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyElection-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679434772971

--------------------
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="StigmergyElection-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 StigmergyElection-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-167912651500598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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