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.r459-smll-167912651200423.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 smartxred
Input is StigmergyCommit-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651200423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 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 359K 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-03b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679346954114

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-20 21:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:15:57] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-20 21:15:57] [INFO ] Transformed 1231 places.
[2023-03-20 21:15:57] [INFO ] Transformed 1476 transitions.
[2023-03-20 21:15:57] [INFO ] Found NUPN structural information;
[2023-03-20 21:15:57] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 129 resets, run finished after 766 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-20 21:15:59] [INFO ] Computed 5 place invariants in 40 ms
[2023-03-20 21:16:00] [INFO ] After 1064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 21:16:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2023-03-20 21:16:04] [INFO ] After 2614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 21:16:05] [INFO ] Deduced a trap composed of 490 places in 854 ms of which 16 ms to minimize.
[2023-03-20 21:16:06] [INFO ] Deduced a trap composed of 398 places in 681 ms of which 2 ms to minimize.
[2023-03-20 21:16:06] [INFO ] Deduced a trap composed of 396 places in 505 ms of which 2 ms to minimize.
[2023-03-20 21:16:07] [INFO ] Deduced a trap composed of 396 places in 447 ms of which 2 ms to minimize.
[2023-03-20 21:16:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2858 ms
[2023-03-20 21:16:08] [INFO ] Deduced a trap composed of 206 places in 503 ms of which 2 ms to minimize.
[2023-03-20 21:16:08] [INFO ] Deduced a trap composed of 397 places in 435 ms of which 1 ms to minimize.
[2023-03-20 21:16:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1225 ms
[2023-03-20 21:16:09] [INFO ] Deduced a trap composed of 398 places in 412 ms of which 0 ms to minimize.
[2023-03-20 21:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2023-03-20 21:16:11] [INFO ] Deduced a trap composed of 398 places in 628 ms of which 2 ms to minimize.
[2023-03-20 21:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 772 ms
[2023-03-20 21:16:11] [INFO ] After 10595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1924 ms.
[2023-03-20 21:16:13] [INFO ] After 13470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 203 ms.
Support contains 81 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1050 edges and 1231 vertex of which 52 / 1231 are part of one of the 8 SCC in 26 ms
Free SCC test removed 44 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 1681 edges and 1187 vertex of which 1181 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 774 transitions
Trivial Post-agglo rules discarded 774 transitions
Performed 774 trivial Post agglomeration. Transition count delta: 774
Iterating post reduction 0 with 777 rules applied. Total rules applied 779 place count 1181 transition count 640
Reduce places removed 774 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 789 rules applied. Total rules applied 1568 place count 407 transition count 625
Reduce places removed 7 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 64 rules applied. Total rules applied 1632 place count 400 transition count 568
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 58 rules applied. Total rules applied 1690 place count 343 transition count 567
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1690 place count 343 transition count 518
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1788 place count 294 transition count 518
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 1838 place count 244 transition count 468
Iterating global reduction 4 with 50 rules applied. Total rules applied 1888 place count 244 transition count 468
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1891 place count 244 transition count 465
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1899 place count 236 transition count 450
Iterating global reduction 5 with 8 rules applied. Total rules applied 1907 place count 236 transition count 450
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1910 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1911 place count 235 transition count 446
Iterating global reduction 6 with 1 rules applied. Total rules applied 1912 place count 235 transition count 446
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1913 place count 234 transition count 445
Iterating global reduction 6 with 1 rules applied. Total rules applied 1914 place count 234 transition count 445
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 6 with 34 rules applied. Total rules applied 1948 place count 217 transition count 428
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1952 place count 213 transition count 424
Iterating global reduction 6 with 4 rules applied. Total rules applied 1956 place count 213 transition count 424
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1959 place count 210 transition count 421
Iterating global reduction 6 with 3 rules applied. Total rules applied 1962 place count 210 transition count 421
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1963 place count 209 transition count 420
Iterating global reduction 6 with 1 rules applied. Total rules applied 1964 place count 209 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1966 place count 208 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1967 place count 208 transition count 419
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1970 place count 208 transition count 416
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1998 place count 208 transition count 388
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 2026 place count 180 transition count 388
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2028 place count 180 transition count 388
Applied a total of 2028 rules in 492 ms. Remains 180 /1231 variables (removed 1051) and now considering 388/1476 (removed 1088) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 180/1231 places, 388/1476 transitions.
Incomplete random walk after 10000 steps, including 605 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 5) seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 388 rows 180 cols
[2023-03-20 21:16:15] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 21:16:15] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:16:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-20 21:16:15] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:16:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-20 21:16:16] [INFO ] After 226ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 21:16:16] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2023-03-20 21:16:16] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 1 ms to minimize.
[2023-03-20 21:16:16] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 1 ms to minimize.
[2023-03-20 21:16:16] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 0 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 1 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1008 ms
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 0 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 1 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2023-03-20 21:16:17] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2023-03-20 21:16:18] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 1 ms to minimize.
[2023-03-20 21:16:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 621 ms
[2023-03-20 21:16:18] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2023-03-20 21:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-20 21:16:18] [INFO ] After 2375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-20 21:16:18] [INFO ] After 3091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 9 ms.
Support contains 78 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 388/388 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 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 179 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 178 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 178 transition count 386
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 176 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 175 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 175 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 174 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 174 transition count 382
Applied a total of 12 rules in 76 ms. Remains 174 /180 variables (removed 6) and now considering 382/388 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 174/180 places, 382/388 transitions.
Incomplete random walk after 10000 steps, including 595 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 550461 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550461 steps, saw 115718 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 382 rows 174 cols
[2023-03-20 21:16:22] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 21:16:22] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:16:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 21:16:22] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:16:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 21:16:22] [INFO ] After 179ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:16:23] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-03-20 21:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-20 21:16:23] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-20 21:16:23] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Support contains 45 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 382/382 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 174 transition count 354
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 63 place count 146 transition count 347
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 142 transition count 347
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 142 transition count 342
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 137 transition count 342
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 134 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 134 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 133 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 133 transition count 312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 132 transition count 311
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 132 transition count 311
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 3 with 14 rules applied. Total rules applied 101 place count 125 transition count 304
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 125 transition count 303
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 121 transition count 299
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 121 transition count 299
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 120 transition count 298
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 120 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 120 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 115 place count 119 transition count 298
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 127 place count 119 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 129 place count 118 transition count 300
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 138 place count 118 transition count 291
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 147 place count 109 transition count 291
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 160 place count 109 transition count 278
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 162 place count 109 transition count 278
Applied a total of 162 rules in 121 ms. Remains 109 /174 variables (removed 65) and now considering 278/382 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 109/174 places, 278/382 transitions.
Incomplete random walk after 10000 steps, including 687 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3528 steps, run visited all 1 properties in 16 ms. (steps per millisecond=220 )
Probabilistic random walk after 3528 steps, saw 1191 distinct states, run finished after 16 ms. (steps per millisecond=220 ) properties seen :1
FORMULA StigmergyCommit-PT-03b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 26683 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 03b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1231 places, 1476 transitions, 4168 arcs.
Final Score: 94707.532
Took : 60 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12240388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107092 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
Caught signal 15, terminating.

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-03b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-03b, 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 r459-smll-167912651200423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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