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.r457-smll-167912649500614.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 ltsminxred
Input is StigmergyElection-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649500614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 428K 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-05b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679543727318

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 03:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:55:30] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-23 03:55:30] [INFO ] Transformed 699 places.
[2023-03-23 03:55:30] [INFO ] Transformed 1266 transitions.
[2023-03-23 03:55:30] [INFO ] Found NUPN structural information;
[2023-03-23 03:55:30] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 698 ms. (steps per millisecond=14 ) properties (out of 11) seen :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-23 03:55:32] [INFO ] Computed 6 place invariants in 39 ms
[2023-03-23 03:55:33] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 03:55:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2023-03-23 03:55:35] [INFO ] After 1670ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 03:55:36] [INFO ] Deduced a trap composed of 110 places in 442 ms of which 9 ms to minimize.
[2023-03-23 03:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-23 03:55:37] [INFO ] Deduced a trap composed of 190 places in 1071 ms of which 2 ms to minimize.
[2023-03-23 03:55:38] [INFO ] Deduced a trap composed of 190 places in 464 ms of which 17 ms to minimize.
[2023-03-23 03:55:38] [INFO ] Deduced a trap composed of 192 places in 430 ms of which 2 ms to minimize.
[2023-03-23 03:55:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2181 ms
[2023-03-23 03:55:39] [INFO ] Deduced a trap composed of 190 places in 488 ms of which 1 ms to minimize.
[2023-03-23 03:55:39] [INFO ] Deduced a trap composed of 189 places in 427 ms of which 1 ms to minimize.
[2023-03-23 03:55:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1081 ms
[2023-03-23 03:55:40] [INFO ] Deduced a trap composed of 189 places in 397 ms of which 0 ms to minimize.
[2023-03-23 03:55:40] [INFO ] Deduced a trap composed of 189 places in 388 ms of which 1 ms to minimize.
[2023-03-23 03:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 988 ms
[2023-03-23 03:55:40] [INFO ] After 7107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 600 ms.
[2023-03-23 03:55:41] [INFO ] After 8409ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 126 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 476 edges and 699 vertex of which 53 / 699 are part of one of the 9 SCC in 16 ms
Free SCC test removed 44 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 1231 edges and 655 vertex of which 649 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 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 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 242 rules applied. Total rules applied 244 place count 649 transition count 966
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 247 rules applied. Total rules applied 491 place count 409 transition count 959
Reduce places removed 3 places and 0 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Iterating post reduction 2 with 74 rules applied. Total rules applied 565 place count 406 transition count 888
Reduce places removed 71 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 75 rules applied. Total rules applied 640 place count 335 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 642 place count 333 transition count 884
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 642 place count 333 transition count 872
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 666 place count 321 transition count 872
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 698 place count 289 transition count 840
Iterating global reduction 5 with 32 rules applied. Total rules applied 730 place count 289 transition count 840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 731 place count 289 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 731 place count 289 transition count 838
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 733 place count 288 transition count 838
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 739 place count 282 transition count 508
Iterating global reduction 6 with 6 rules applied. Total rules applied 745 place count 282 transition count 508
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 6 with 38 rules applied. Total rules applied 783 place count 263 transition count 489
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 793 place count 258 transition count 489
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 795 place count 258 transition count 487
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 818 place count 258 transition count 464
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 841 place count 235 transition count 464
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 235 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 843 place count 235 transition count 463
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 845 place count 235 transition count 463
Applied a total of 845 rules in 535 ms. Remains 235 /699 variables (removed 464) and now considering 463/1266 (removed 803) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 235/699 places, 463/1266 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 5) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :1
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 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 463 rows 235 cols
[2023-03-23 03:55:42] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-23 03:55:42] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:55:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-23 03:55:43] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:43] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-23 03:55:43] [INFO ] After 158ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:43] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2023-03-23 03:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-23 03:55:43] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 1 ms to minimize.
[2023-03-23 03:55:44] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 1 ms to minimize.
[2023-03-23 03:55:44] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 1 ms to minimize.
[2023-03-23 03:55:44] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 3 ms to minimize.
[2023-03-23 03:55:44] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 1 ms to minimize.
[2023-03-23 03:55:45] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 0 ms to minimize.
[2023-03-23 03:55:45] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 1 ms to minimize.
[2023-03-23 03:55:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1594 ms
[2023-03-23 03:55:45] [INFO ] After 2069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-23 03:55:45] [INFO ] After 2610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 74 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 463/463 transitions.
Graph (trivial) has 89 edges and 235 vertex of which 10 / 235 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 543 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 229 transition count 418
Reduce places removed 35 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 53 rules applied. Total rules applied 90 place count 194 transition count 400
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 110 place count 176 transition count 398
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 110 place count 176 transition count 392
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 122 place count 170 transition count 392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 168 transition count 355
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 168 transition count 355
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 164 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 163 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 163 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 161 transition count 350
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 161 transition count 345
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 161 transition count 341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 157 transition count 341
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 157 transition count 341
Applied a total of 154 rules in 87 ms. Remains 157 /235 variables (removed 78) and now considering 341/463 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 157/235 places, 341/463 transitions.
Incomplete random walk after 10000 steps, including 362 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 827268 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 827268 steps, saw 157012 distinct states, run finished after 3003 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 341 rows 157 cols
[2023-03-23 03:55:48] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-23 03:55:48] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:55:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 03:55:49] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-23 03:55:49] [INFO ] After 131ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:49] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2023-03-23 03:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-23 03:55:49] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2023-03-23 03:55:49] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 1 ms to minimize.
[2023-03-23 03:55:49] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2023-03-23 03:55:50] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2023-03-23 03:55:50] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2023-03-23 03:55:50] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 1 ms to minimize.
[2023-03-23 03:55:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 884 ms
[2023-03-23 03:55:50] [INFO ] After 1234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-23 03:55:50] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 74 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 341/341 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 157/157 places, 341/341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 341/341 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2023-03-23 03:55:50] [INFO ] Invariant cache hit.
[2023-03-23 03:55:50] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-23 03:55:50] [INFO ] Invariant cache hit.
[2023-03-23 03:55:51] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-23 03:55:51] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-23 03:55:51] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 03:55:51] [INFO ] Invariant cache hit.
[2023-03-23 03:55:51] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1145 ms. Remains : 157/157 places, 341/341 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 154 transition count 338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 154 transition count 337
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 153 transition count 337
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 151 transition count 335
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 151 transition count 335
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 151 transition count 334
Applied a total of 18 rules in 59 ms. Remains 151 /157 variables (removed 6) and now considering 334/341 (removed 7) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 334 rows 151 cols
[2023-03-23 03:55:51] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 03:55:51] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 03:55:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-23 03:55:52] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:52] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2023-03-23 03:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-23 03:55:52] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 8 ms to minimize.
[2023-03-23 03:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-23 03:55:52] [INFO ] After 922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-23 03:55:53] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 03:55:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-23 03:55:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 341 transitions and 1980 arcs took 4 ms.
[2023-03-23 03:55:53] [INFO ] Flatten gal took : 171 ms
Total runtime 23297 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/574/inv_0_ --invariant=/tmp/574/inv_1_ --inv-par
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679543788963

--------------------
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
mcc2023
rfs formula name StigmergyElection-PT-05b-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/574/inv_0_
rfs formula name StigmergyElection-PT-05b-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/574/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 157 places, 341 transitions and 1980 arcs
pnml2lts-sym: Petri net StigmergyElection_PT_05b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 341->249 groups
pnml2lts-sym: Regrouping took 0.100 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 157; there are 249 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/574/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/574/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 8.340 real 30.920 user 2.380 sys
pnml2lts-sym: max token count: 1

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-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-05b, 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 r457-smll-167912649500614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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