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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 10:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 627K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679339591804

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-04b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-20 19:13:14] [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-20 19:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:13:14] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2023-03-20 19:13:14] [INFO ] Transformed 1534 places.
[2023-03-20 19:13:14] [INFO ] Transformed 2136 transitions.
[2023-03-20 19:13:14] [INFO ] Found NUPN structural information;
[2023-03-20 19:13:14] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 107 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 12) seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
[2023-03-20 19:13:16] [INFO ] Flatten gal took : 431 ms
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
[2023-03-20 19:13:16] [INFO ] Flatten gal took : 213 ms
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
[2023-03-20 19:13:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18299762755344015864.gal : 92 ms
[2023-03-20 19:13:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13955765591462458544.prop : 6 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/ReachabilityCardinality18299762755344015864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13955765591462458544.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :0

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 ...330
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Loading property file /tmp/ReachabilityCardinality13955765591462458544.prop.
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2136 rows 1534 cols
[2023-03-20 19:13:17] [INFO ] Computed 6 place invariants in 82 ms
[2023-03-20 19:13:18] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2023-03-20 19:13:18] [INFO ] After 1144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 19:13:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :12 after 17
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :17 after 19
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :19 after 192
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :192 after 999
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :999 after 1094
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1094 after 2372
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :2372 after 11199
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :11199 after 1.10618e+06
[2023-03-20 19:13:22] [INFO ] After 2411ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-20 19:13:22] [INFO ] Deduced a trap composed of 399 places in 821 ms of which 14 ms to minimize.
[2023-03-20 19:13:23] [INFO ] Deduced a trap composed of 396 places in 627 ms of which 2 ms to minimize.
[2023-03-20 19:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1755 ms
[2023-03-20 19:13:24] [INFO ] Deduced a trap composed of 399 places in 691 ms of which 2 ms to minimize.
[2023-03-20 19:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 895 ms
Invariant property StigmergyCommit-PT-04b-ReachabilityCardinality-07 does not hold.
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.10618e+06 after 1.10518e+07
[2023-03-20 19:13:25] [INFO ] Deduced a trap composed of 399 places in 720 ms of which 3 ms to minimize.
[2023-03-20 19:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 932 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.10518e+07 after 1.40382e+07
[2023-03-20 19:13:27] [INFO ] Deduced a trap composed of 397 places in 1308 ms of which 3 ms to minimize.
[2023-03-20 19:13:28] [INFO ] Deduced a trap composed of 400 places in 1223 ms of which 2 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :1.40382e+07 after 1.64616e+07
[2023-03-20 19:13:30] [INFO ] Deduced a trap composed of 397 places in 1042 ms of which 1 ms to minimize.
[2023-03-20 19:13:31] [INFO ] Deduced a trap composed of 401 places in 979 ms of which 3 ms to minimize.
[2023-03-20 19:13:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5187 ms
[2023-03-20 19:13:33] [INFO ] Deduced a trap composed of 489 places in 1213 ms of which 1 ms to minimize.
[2023-03-20 19:13:34] [INFO ] Deduced a trap composed of 397 places in 1304 ms of which 1 ms to minimize.
[2023-03-20 19:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2822 ms
[2023-03-20 19:13:35] [INFO ] Deduced a trap composed of 399 places in 1234 ms of which 2 ms to minimize.
[2023-03-20 19:13:37] [INFO ] Deduced a trap composed of 396 places in 964 ms of which 3 ms to minimize.
[2023-03-20 19:13:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 2399 ms
[2023-03-20 19:13:37] [INFO ] After 17588ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 948 ms.
[2023-03-20 19:13:38] [INFO ] After 19611ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 61 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1413 edges and 1534 vertex of which 99 / 1534 are part of one of the 15 SCC in 15 ms
Free SCC test removed 84 places
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Graph (complete) has 2169 edges and 1450 vertex of which 1440 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.18 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 1023 transitions
Trivial Post-agglo rules discarded 1023 transitions
Performed 1023 trivial Post agglomeration. Transition count delta: 1023
Iterating post reduction 0 with 1028 rules applied. Total rules applied 1030 place count 1440 transition count 996
Reduce places removed 1023 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 1042 rules applied. Total rules applied 2072 place count 417 transition count 977
Reduce places removed 6 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 57 rules applied. Total rules applied 2129 place count 411 transition count 926
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 2180 place count 360 transition count 926
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 2180 place count 360 transition count 872
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2288 place count 306 transition count 872
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 2334 place count 260 transition count 826
Iterating global reduction 4 with 46 rules applied. Total rules applied 2380 place count 260 transition count 826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2381 place count 260 transition count 825
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2381 place count 260 transition count 824
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2383 place count 259 transition count 824
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 2401 place count 241 transition count 424
Iterating global reduction 5 with 18 rules applied. Total rules applied 2419 place count 241 transition count 424
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2424 place count 241 transition count 419
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2425 place count 240 transition count 418
Iterating global reduction 6 with 1 rules applied. Total rules applied 2426 place count 240 transition count 418
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2427 place count 239 transition count 417
Iterating global reduction 6 with 1 rules applied. Total rules applied 2428 place count 239 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2429 place count 239 transition count 416
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 2463 place count 222 transition count 399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2464 place count 222 transition count 398
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2469 place count 217 transition count 393
Iterating global reduction 8 with 5 rules applied. Total rules applied 2474 place count 217 transition count 393
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2477 place count 214 transition count 390
Iterating global reduction 8 with 3 rules applied. Total rules applied 2480 place count 214 transition count 390
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2482 place count 212 transition count 388
Iterating global reduction 8 with 2 rules applied. Total rules applied 2484 place count 212 transition count 388
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2502 place count 203 transition count 396
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2504 place count 203 transition count 394
Free-agglomeration rule applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 2545 place count 203 transition count 353
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 2586 place count 162 transition count 353
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 2638 place count 162 transition count 301
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2639 place count 162 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2640 place count 161 transition count 300
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2643 place count 161 transition count 300
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2645 place count 161 transition count 300
Applied a total of 2645 rules in 638 ms. Remains 161 /1534 variables (removed 1373) and now considering 300/2136 (removed 1836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 640 ms. Remains : 161/1534 places, 300/2136 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 7) seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 300 rows 161 cols
[2023-03-20 19:13:39] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 19:13:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-20 19:13:39] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 19:13:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-20 19:13:40] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 19:13:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 19:13:40] [INFO ] After 119ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 19:13:40] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:13:40] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2023-03-20 19:13:40] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:13:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2023-03-20 19:13:40] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-20 19:13:41] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2023-03-20 19:13:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-20 19:13:41] [INFO ] After 1061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-20 19:13:41] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 28 ms.
Support contains 20 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 300/300 transitions.
Graph (trivial) has 80 edges and 161 vertex of which 2 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 160 transition count 266
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 128 transition count 264
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 67 place count 128 transition count 258
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 122 transition count 258
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 112 transition count 248
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 112 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 108 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 108 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 106 transition count 242
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 106 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 104 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 104 transition count 240
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 97 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 97 transition count 229
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 140 place count 90 transition count 222
Iterating global reduction 3 with 7 rules applied. Total rules applied 147 place count 90 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 90 transition count 221
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 86 transition count 217
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 86 transition count 217
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 82 transition count 213
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 82 transition count 213
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 175 place count 82 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 81 transition count 208
Free-agglomeration rule applied 13 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 190 place count 81 transition count 183
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 209 place count 68 transition count 177
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 224 place count 68 transition count 162
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 68 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 68 transition count 161
Applied a total of 227 rules in 160 ms. Remains 68 /161 variables (removed 93) and now considering 161/300 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 68/161 places, 161/300 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 68 cols
[2023-03-20 19:13:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 19:13:42] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-20 19:13:42] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 19:13:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 19:13:42] [INFO ] After 22ms SMT Verify possible using 61 Read/Feed constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-20 19:13:42] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 19:13:42] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-20 19:13:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-20 19:13:42] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 19:13:42] [INFO ] After 39ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 19:13:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-20 19:13:42] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-20 19:13:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-20 19:13:42] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:13:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2023-03-20 19:13:42] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-20 19:13:42] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 8 ms.
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 161/161 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 68 transition count 154
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 61 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 57 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 57 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 27 place count 54 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 54 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 54 transition count 142
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 40 place count 54 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 54 transition count 133
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 53 place count 52 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 52 transition count 124
Applied a total of 54 rules in 27 ms. Remains 52 /68 variables (removed 16) and now considering 124/161 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 52/68 places, 124/161 transitions.
Finished random walk after 6780 steps, including 2 resets, run visited all 2 properties in 114 ms. (steps per millisecond=59 )
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-04 TRUE 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 28571 ms.

BK_STOP 1679339624392

--------------------
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-04b"
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-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645400438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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