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.r453-smll-167912645500494.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 itstools
Input is StigmergyCommit-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 17M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679367884064

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 03:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 03:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 03:04:48] [INFO ] Load time of PNML (sax parser for PT used): 1367 ms
[2023-03-21 03:04:48] [INFO ] Transformed 328 places.
[2023-03-21 03:04:48] [INFO ] Transformed 18744 transitions.
[2023-03-21 03:04:48] [INFO ] Found NUPN structural information;
[2023-03-21 03:04:48] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 1822 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
[2023-03-21 03:04:50] [INFO ] Flatten gal took : 451 ms
[2023-03-21 03:04:50] [INFO ] Flatten gal took : 218 ms
[2023-03-21 03:04:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2871422114426731945.gal : 121 ms
[2023-03-21 03:04:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2119063620541281559.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2871422114426731945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2119063620541281559.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1669 ms. (steps per millisecond=5 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Loading property file /tmp/ReachabilityCardinality2119063620541281559.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-21 03:04:51] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 03:04:51] [INFO ] Computed 10 place invariants in 48 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :9 after 53
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :53 after 65
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :65 after 73
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :73 after 233
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :233 after 929
[2023-03-21 03:04:53] [INFO ] After 897ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-21 03:04:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :929 after 1.15296e+07
[2023-03-21 03:04:55] [INFO ] After 1944ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-21 03:04:55] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-21 03:04:58] [INFO ] After 2527ms SMT Verify possible using 1147 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-21 03:04:59] [INFO ] Deduced a trap composed of 19 places in 568 ms of which 15 ms to minimize.
[2023-03-21 03:04:59] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 1 ms to minimize.
[2023-03-21 03:05:00] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 2 ms to minimize.
Invariant property StigmergyCommit-PT-08a-ReachabilityCardinality-15 does not hold.
[2023-03-21 03:05:00] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 2 ms to minimize.
[2023-03-21 03:05:01] [INFO ] Deduced a trap composed of 17 places in 392 ms of which 2 ms to minimize.
[2023-03-21 03:05:01] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 1 ms to minimize.
[2023-03-21 03:05:01] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-21 03:05:02] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 1 ms to minimize.
[2023-03-21 03:05:02] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2023-03-21 03:05:02] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2023-03-21 03:05:03] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-21 03:05:03] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-21 03:05:03] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2023-03-21 03:05:03] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-21 03:05:04] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2023-03-21 03:05:04] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2023-03-21 03:05:04] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-21 03:05:04] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2023-03-21 03:05:04] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6399 ms
[2023-03-21 03:05:05] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2023-03-21 03:05:05] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 0 ms to minimize.
[2023-03-21 03:05:06] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2023-03-21 03:05:06] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 1 ms to minimize.
[2023-03-21 03:05:06] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-21 03:05:06] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-21 03:05:07] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-21 03:05:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2204 ms
[2023-03-21 03:05:08] [INFO ] Deduced a trap composed of 17 places in 460 ms of which 1 ms to minimize.
[2023-03-21 03:05:08] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 1 ms to minimize.
[2023-03-21 03:05:08] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 0 ms to minimize.
[2023-03-21 03:05:09] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 2 ms to minimize.
[2023-03-21 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1575 ms
[2023-03-21 03:05:09] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-21 03:05:09] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2023-03-21 03:05:10] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-21 03:05:10] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-21 03:05:10] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 6 ms to minimize.
[2023-03-21 03:05:10] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2023-03-21 03:05:11] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2023-03-21 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1940 ms
[2023-03-21 03:05:11] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-21 03:05:11] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-21 03:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-21 03:05:11] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-21 03:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-21 03:05:12] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 4 ms to minimize.
[2023-03-21 03:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-21 03:05:13] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 0 ms to minimize.
[2023-03-21 03:05:13] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 0 ms to minimize.
[2023-03-21 03:05:13] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 2 ms to minimize.
[2023-03-21 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1054 ms
[2023-03-21 03:05:14] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 0 ms to minimize.
[2023-03-21 03:05:15] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-21 03:05:15] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-21 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1025 ms
[2023-03-21 03:05:15] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2023-03-21 03:05:16] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-21 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 392 ms
[2023-03-21 03:05:16] [INFO ] After 20349ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :5
Attempting to minimize the solution found.
Minimization took 605 ms.
[2023-03-21 03:05:16] [INFO ] After 23512ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :5
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 14 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.23 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 319 transition count 1368
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 82 rules applied. Total rules applied 155 place count 274 transition count 1331
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 169 place count 266 transition count 1325
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 178 place count 260 transition count 1322
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 178 place count 260 transition count 1264
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 294 place count 202 transition count 1264
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 336 place count 160 transition count 1222
Iterating global reduction 4 with 42 rules applied. Total rules applied 378 place count 160 transition count 1222
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 417 place count 121 transition count 1183
Iterating global reduction 4 with 39 rules applied. Total rules applied 456 place count 121 transition count 1183
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 4 with 136 rules applied. Total rules applied 592 place count 121 transition count 1047
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 597 place count 116 transition count 1042
Iterating global reduction 5 with 5 rules applied. Total rules applied 602 place count 116 transition count 1042
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 607 place count 111 transition count 1037
Iterating global reduction 5 with 5 rules applied. Total rules applied 612 place count 111 transition count 1037
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 616 place count 111 transition count 1033
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 642 place count 98 transition count 1020
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 650 place count 98 transition count 1012
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 658 place count 90 transition count 1004
Iterating global reduction 7 with 8 rules applied. Total rules applied 666 place count 90 transition count 1004
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 673 place count 83 transition count 997
Iterating global reduction 7 with 7 rules applied. Total rules applied 680 place count 83 transition count 997
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 687 place count 76 transition count 990
Iterating global reduction 7 with 7 rules applied. Total rules applied 694 place count 76 transition count 990
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 703 place count 76 transition count 981
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 705 place count 76 transition count 979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 707 place count 74 transition count 979
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 715 place count 74 transition count 979
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 719 place count 74 transition count 975
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 720 place count 73 transition count 974
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 9 rules applied. Total rules applied 729 place count 72 transition count 966
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 10 rules applied. Total rules applied 739 place count 64 transition count 964
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 741 place count 62 transition count 964
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 741 place count 62 transition count 959
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 751 place count 57 transition count 959
Performed 13 Post agglomeration using F-continuation condition with reduction of 864 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 777 place count 44 transition count 82
Drop transitions removed 8 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 11 with 26 rules applied. Total rules applied 803 place count 44 transition count 56
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 6 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 813 place count 38 transition count 52
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 817 place count 38 transition count 48
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 820 place count 38 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 821 place count 38 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 822 place count 37 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 823 place count 37 transition count 44
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 824 place count 37 transition count 43
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 15 with 5 rules applied. Total rules applied 829 place count 32 transition count 38
Applied a total of 829 rules in 1727 ms. Remains 32 /328 variables (removed 296) and now considering 38/1449 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1727 ms. Remains : 32/328 places, 38/1449 transitions.
Finished random walk after 52 steps, including 1 resets, run visited all 5 properties in 2 ms. (steps per millisecond=26 )
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 31555 ms.

BK_STOP 1679367919729

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-08a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-08a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645500494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;