fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r457-smll-167912649300471
Last Updated
May 14, 2023

About the Execution of LTSMin+red for StigmergyCommit-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
702.644 3600000.00 14140693.00 849.20 T???T???T???F?F? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3.7M 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-06b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679454575187

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:09:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:09:39] [INFO ] Load time of PNML (sax parser for PT used): 893 ms
[2023-03-22 03:09:39] [INFO ] Transformed 2140 places.
[2023-03-22 03:09:39] [INFO ] Transformed 6760 transitions.
[2023-03-22 03:09:39] [INFO ] Found NUPN structural information;
[2023-03-22 03:09:39] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 1103 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 78 resets, run finished after 993 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 81867 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81867 steps, saw 21213 distinct states, run finished after 3008 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 6760 rows 2140 cols
[2023-03-22 03:09:44] [INFO ] Computed 8 place invariants in 302 ms
[2023-03-22 03:09:47] [INFO ] [Real]Absence check using 8 positive place invariants in 38 ms returned sat
[2023-03-22 03:09:47] [INFO ] After 2215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 03:09:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 32 ms returned sat
[2023-03-22 03:10:00] [INFO ] After 9904ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-22 03:10:05] [INFO ] Deduced a trap composed of 401 places in 3350 ms of which 14 ms to minimize.
[2023-03-22 03:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4017 ms
[2023-03-22 03:10:11] [INFO ] Deduced a trap composed of 397 places in 3615 ms of which 5 ms to minimize.
[2023-03-22 03:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4382 ms
[2023-03-22 03:10:13] [INFO ] After 22864ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 03:10:13] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 579 ms.
Support contains 87 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 1851 edges and 2140 vertex of which 131 / 2140 are part of one of the 20 SCC in 20 ms
Free SCC test removed 111 places
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Graph (complete) has 3345 edges and 2029 vertex of which 2016 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.50 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1370 transitions
Trivial Post-agglo rules discarded 1370 transitions
Performed 1370 trivial Post agglomeration. Transition count delta: 1370
Iterating post reduction 0 with 1376 rules applied. Total rules applied 1378 place count 2016 transition count 5237
Reduce places removed 1370 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1382 rules applied. Total rules applied 2760 place count 646 transition count 5225
Reduce places removed 6 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 2 with 73 rules applied. Total rules applied 2833 place count 640 transition count 5158
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 3 with 67 rules applied. Total rules applied 2900 place count 573 transition count 5158
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 123 Pre rules applied. Total rules applied 2900 place count 573 transition count 5035
Deduced a syphon composed of 123 places in 5 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 3146 place count 450 transition count 5035
Discarding 121 places :
Symmetric choice reduction at 4 with 121 rule applications. Total rules 3267 place count 329 transition count 4914
Iterating global reduction 4 with 121 rules applied. Total rules applied 3388 place count 329 transition count 4914
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 21 rules applied. Total rules applied 3409 place count 329 transition count 4893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3410 place count 328 transition count 4893
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3410 place count 328 transition count 4892
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3412 place count 327 transition count 4892
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 3445 place count 294 transition count 4846
Iterating global reduction 6 with 33 rules applied. Total rules applied 3478 place count 294 transition count 4846
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 3484 place count 294 transition count 4840
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 3498 place count 280 transition count 4826
Iterating global reduction 7 with 14 rules applied. Total rules applied 3512 place count 280 transition count 4826
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 3522 place count 270 transition count 4816
Iterating global reduction 7 with 10 rules applied. Total rules applied 3532 place count 270 transition count 4816
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 3542 place count 270 transition count 4806
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 8 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 3586 place count 248 transition count 4784
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3593 place count 241 transition count 4777
Iterating global reduction 8 with 7 rules applied. Total rules applied 3600 place count 241 transition count 4777
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3606 place count 235 transition count 4771
Iterating global reduction 8 with 6 rules applied. Total rules applied 3612 place count 235 transition count 4771
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3618 place count 229 transition count 4765
Iterating global reduction 8 with 6 rules applied. Total rules applied 3624 place count 229 transition count 4765
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3632 place count 225 transition count 4775
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3634 place count 225 transition count 4773
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3637 place count 225 transition count 4770
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 3646 place count 225 transition count 4761
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 3655 place count 216 transition count 4761
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 3660 place count 211 transition count 4756
Iterating global reduction 10 with 5 rules applied. Total rules applied 3665 place count 211 transition count 4756
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3666 place count 211 transition count 4755
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3669 place count 211 transition count 4752
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 3672 place count 208 transition count 4752
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 3691 place count 208 transition count 4752
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 3693 place count 208 transition count 4750
Applied a total of 3693 rules in 1894 ms. Remains 208 /2140 variables (removed 1932) and now considering 4750/6760 (removed 2010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1898 ms. Remains : 208/2140 places, 4750/6760 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4750 rows 208 cols
[2023-03-22 03:10:16] [INFO ] Computed 7 place invariants in 52 ms
[2023-03-22 03:10:17] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 03:10:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-22 03:10:21] [INFO ] After 3955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-22 03:10:23] [INFO ] After 1843ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:26] [INFO ] After 5017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1545 ms.
[2023-03-22 03:10:28] [INFO ] After 10741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 105 ms.
Support contains 80 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 4750/4750 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 0 with 6 rules applied. Total rules applied 6 place count 208 transition count 4744
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 202 transition count 4742
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 200 transition count 4742
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 200 transition count 4740
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 198 transition count 4740
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 196 transition count 4738
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 196 transition count 4738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 196 transition count 4737
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 26 place count 195 transition count 4736
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 195 transition count 4736
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 31 place count 193 transition count 4734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 193 transition count 4732
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 191 transition count 4730
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 191 transition count 4730
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 43 place count 191 transition count 4724
Applied a total of 43 rules in 411 ms. Remains 191 /208 variables (removed 17) and now considering 4724/4750 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 191/208 places, 4724/4750 transitions.
Incomplete random walk after 10000 steps, including 249 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 180377 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180377 steps, saw 35821 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4724 rows 191 cols
[2023-03-22 03:10:33] [INFO ] Computed 7 place invariants in 47 ms
[2023-03-22 03:10:33] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 03:10:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-22 03:10:36] [INFO ] After 2855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 03:10:38] [INFO ] After 1897ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:41] [INFO ] After 5171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1466 ms.
[2023-03-22 03:10:43] [INFO ] After 9759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 112 ms.
Support contains 80 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 4724/4724 transitions.
Applied a total of 0 rules in 151 ms. Remains 191 /191 variables (removed 0) and now considering 4724/4724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 191/191 places, 4724/4724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 4724/4724 transitions.
Applied a total of 0 rules in 145 ms. Remains 191 /191 variables (removed 0) and now considering 4724/4724 (removed 0) transitions.
[2023-03-22 03:10:43] [INFO ] Invariant cache hit.
[2023-03-22 03:10:43] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 03:10:43] [INFO ] Invariant cache hit.
[2023-03-22 03:10:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 03:10:44] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2023-03-22 03:10:45] [INFO ] Redundant transitions in 838 ms returned []
[2023-03-22 03:10:45] [INFO ] Invariant cache hit.
[2023-03-22 03:10:48] [INFO ] Dead Transitions using invariants and state equation in 3177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5332 ms. Remains : 191/191 places, 4724/4724 transitions.
Graph (complete) has 949 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 190 transition count 4719
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 185 transition count 4718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 184 transition count 4718
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 184 transition count 4715
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 181 transition count 4715
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 51 place count 165 transition count 4696
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 63 place count 165 transition count 4684
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 163 transition count 4680
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 163 transition count 4680
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 75 place count 163 transition count 4672
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 83 place count 159 transition count 4668
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 158 transition count 4669
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 158 transition count 4667
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 156 transition count 4667
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 156 transition count 4666
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 95 place count 156 transition count 4666
Applied a total of 95 rules in 865 ms. Remains 156 /191 variables (removed 35) and now considering 4666/4724 (removed 58) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 4666 rows 156 cols
[2023-03-22 03:10:49] [INFO ] Computed 6 place invariants in 70 ms
[2023-03-22 03:10:50] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 03:10:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-22 03:10:54] [INFO ] After 3508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:57] [INFO ] After 6599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1563 ms.
[2023-03-22 03:10:58] [INFO ] After 8337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-22 03:10:58] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-22 03:10:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 191 places, 4724 transitions and 63655 arcs took 65 ms.
[2023-03-22 03:11:00] [INFO ] Flatten gal took : 1236 ms
Total runtime 81896 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/513/inv_0_ --invariant=/tmp/513/inv_1_ --invariant=/tmp/513/inv_2_ --invariant=/tmp/513/inv_3_ --invariant=/tmp/513/inv_4_ --invariant=/tmp/513/inv_5_ --invariant=/tmp/513/inv_6_ --invariant=/tmp/513/inv_7_ --invariant=/tmp/513/inv_8_ --invariant=/tmp/513/inv_9_ --invariant=/tmp/513/inv_10_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15661740 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086160 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649300471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;