fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872800326
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
500.312 57896.00 111405.00 238.80 TTFTFTTTTTTTFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872800326.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.8K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.2M May 29 12:20 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-06b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654853924766

Running Version 202205111006
[2022-06-10 09:38:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 09:38:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 09:38:48] [INFO ] Load time of PNML (sax parser for PT used): 569 ms
[2022-06-10 09:38:48] [INFO ] Transformed 835 places.
[2022-06-10 09:38:48] [INFO ] Transformed 2416 transitions.
[2022-06-10 09:38:48] [INFO ] Found NUPN structural information;
[2022-06-10 09:38:48] [INFO ] Parsed PT model containing 835 places and 2416 transitions in 884 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 71 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 95 resets, run finished after 895 ms. (steps per millisecond=11 ) properties (out of 15) seen :3
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2416 rows 835 cols
[2022-06-10 09:38:50] [INFO ] Computed 7 place invariants in 74 ms
[2022-06-10 09:38:52] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-10 09:38:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2022-06-10 09:38:55] [INFO ] After 2739ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2022-06-10 09:38:56] [INFO ] Deduced a trap composed of 194 places in 1202 ms of which 10 ms to minimize.
[2022-06-10 09:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1460 ms
[2022-06-10 09:38:59] [INFO ] Deduced a trap composed of 193 places in 1582 ms of which 3 ms to minimize.
[2022-06-10 09:39:00] [INFO ] Deduced a trap composed of 189 places in 1307 ms of which 2 ms to minimize.
[2022-06-10 09:39:02] [INFO ] Deduced a trap composed of 195 places in 1316 ms of which 3 ms to minimize.
[2022-06-10 09:39:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4892 ms
[2022-06-10 09:39:03] [INFO ] Deduced a trap composed of 190 places in 1196 ms of which 5 ms to minimize.
[2022-06-10 09:39:05] [INFO ] Deduced a trap composed of 241 places in 1474 ms of which 1 ms to minimize.
[2022-06-10 09:39:06] [INFO ] Deduced a trap composed of 190 places in 978 ms of which 1 ms to minimize.
[2022-06-10 09:39:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4329 ms
[2022-06-10 09:39:08] [INFO ] Deduced a trap composed of 189 places in 1353 ms of which 1 ms to minimize.
[2022-06-10 09:39:09] [INFO ] Deduced a trap composed of 193 places in 953 ms of which 1 ms to minimize.
[2022-06-10 09:39:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2640 ms
[2022-06-10 09:39:10] [INFO ] After 18084ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 2045 ms.
[2022-06-10 09:39:12] [INFO ] After 20811ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 7 different solutions.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 3161 ms.
Support contains 63 out of 835 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 738 edges and 835 vertex of which 68 / 835 are part of one of the 12 SCC in 11 ms
Free SCC test removed 56 places
Drop transitions removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Graph (complete) has 1600 edges and 779 vertex of which 769 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.31 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 455 rules applied. Total rules applied 457 place count 769 transition count 1885
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 464 rules applied. Total rules applied 921 place count 319 transition count 1871
Reduce places removed 6 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 2 with 41 rules applied. Total rules applied 962 place count 313 transition count 1836
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 999 place count 278 transition count 1834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1000 place count 277 transition count 1834
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1000 place count 277 transition count 1817
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1034 place count 260 transition count 1817
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1071 place count 223 transition count 1780
Iterating global reduction 5 with 37 rules applied. Total rules applied 1108 place count 223 transition count 1780
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 5 with 3 rules applied. Total rules applied 1111 place count 223 transition count 1777
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1112 place count 222 transition count 1777
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1112 place count 222 transition count 1775
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1116 place count 220 transition count 1775
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1125 place count 211 transition count 593
Iterating global reduction 7 with 9 rules applied. Total rules applied 1134 place count 211 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1137 place count 211 transition count 590
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 1195 place count 182 transition count 561
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1199 place count 178 transition count 557
Iterating global reduction 8 with 4 rules applied. Total rules applied 1203 place count 178 transition count 557
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1213 place count 173 transition count 557
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1216 place count 173 transition count 554
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1222 place count 173 transition count 548
Free-agglomeration rule applied 37 times.
Iterating global reduction 9 with 37 rules applied. Total rules applied 1259 place count 173 transition count 511
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 9 with 37 rules applied. Total rules applied 1296 place count 136 transition count 511
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1297 place count 135 transition count 510
Iterating global reduction 10 with 1 rules applied. Total rules applied 1298 place count 135 transition count 510
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 10 with 51 rules applied. Total rules applied 1349 place count 135 transition count 459
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1352 place count 135 transition count 459
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1353 place count 135 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1354 place count 134 transition count 457
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 10 with 3 rules applied. Total rules applied 1357 place count 133 transition count 455
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1360 place count 131 transition count 454
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 5 Pre rules applied. Total rules applied 1360 place count 131 transition count 449
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1370 place count 126 transition count 449
Performed 5 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1380 place count 121 transition count 428
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 12 with 34 rules applied. Total rules applied 1414 place count 121 transition count 394
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1415 place count 120 transition count 322
Iterating global reduction 13 with 1 rules applied. Total rules applied 1416 place count 120 transition count 322
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 13 with 57 rules applied. Total rules applied 1473 place count 120 transition count 265
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1476 place count 120 transition count 265
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1479 place count 120 transition count 262
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1482 place count 117 transition count 259
Iterating global reduction 13 with 3 rules applied. Total rules applied 1485 place count 117 transition count 259
Applied a total of 1485 rules in 682 ms. Remains 117 /835 variables (removed 718) and now considering 259/2416 (removed 2157) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/835 places, 259/2416 transitions.
Incomplete random walk after 1000000 steps, including 34063 resets, run finished after 15759 ms. (steps per millisecond=63 ) properties (out of 5) seen :2
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6704 resets, run finished after 4598 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5525 resets, run finished after 2660 ms. (steps per millisecond=375 ) properties (out of 3) seen :1
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 5542 resets, run finished after 1636 ms. (steps per millisecond=611 ) properties (out of 2) seen :1
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 259 rows 117 cols
[2022-06-10 09:39:41] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-10 09:39:41] [INFO ] [Real]Absence check using 6 positive place invariants in 37 ms returned sat
[2022-06-10 09:39:41] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 09:39:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-10 09:39:41] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 09:39:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 09:39:41] [INFO ] After 36ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 09:39:41] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2022-06-10 09:39:42] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2022-06-10 09:39:42] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2022-06-10 09:39:42] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-06-10 09:39:42] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-06-10 09:39:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 538 ms
[2022-06-10 09:39:42] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-10 09:39:42] [INFO ] After 778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 259/259 transitions.
Graph (trivial) has 121 edges and 117 vertex of which 19 / 117 are part of one of the 9 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 361 edges and 107 vertex of which 106 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 106 transition count 191
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 107 place count 59 transition count 181
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 57 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 55 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 113 place count 55 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 54 transition count 178
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 130 place count 39 transition count 163
Iterating global reduction 4 with 15 rules applied. Total rules applied 145 place count 39 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 38 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 38 transition count 147
Performed 5 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 157 place count 33 transition count 132
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 160 place count 33 transition count 129
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 31 transition count 81
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 31 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 31 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 170 place count 29 transition count 78
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 179 place count 29 transition count 69
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 181 place count 29 transition count 67
Free-agglomeration rule applied 12 times with reduction of 32 identical transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 193 place count 29 transition count 23
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 211 place count 16 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 213 place count 15 transition count 17
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 214 place count 15 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 215 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 216 place count 13 transition count 15
Applied a total of 216 rules in 49 ms. Remains 13 /117 variables (removed 104) and now considering 15/259 (removed 244) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/117 places, 15/259 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 55279 ms.

BK_STOP 1654853982662

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-06b, 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 r294-smll-165463872800326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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