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.r233-tall-167856419000543.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 LeafsetExtension-PT-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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 LeafsetExtension-PT-S64C4-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679551496571

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=LeafsetExtension-PT-S64C4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:04:58] [INFO ] Load time of PNML (sax parser for PT used): 521 ms
[2023-03-23 06:04:58] [INFO ] Transformed 21462 places.
[2023-03-23 06:04:58] [INFO ] Transformed 21129 transitions.
[2023-03-23 06:04:58] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 700 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 300 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-23 06:05:03] [INFO ] Computed 333 place invariants in 2641 ms
[2023-03-23 06:05:08] [INFO ] [Real]Absence check using 67 positive place invariants in 69 ms returned sat
[2023-03-23 06:05:09] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 852 ms returned sat
[2023-03-23 06:05:28] [INFO ] After 17063ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-23 06:05:28] [INFO ] After 17098ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 06:05:28] [INFO ] After 25098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2023-03-23 06:05:33] [INFO ] [Nat]Absence check using 67 positive place invariants in 70 ms returned sat
[2023-03-23 06:05:33] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 883 ms returned sat
[2023-03-23 06:05:53] [INFO ] After 15223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 06:05:53] [INFO ] After 15232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 06:05:53] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 215 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 11142 are kept as prefixes of interest. Removing 10320 places using SCC suffix rule.42 ms
Discarding 10320 places :
Also discarding 4858 output transitions
Drop transitions removed 4858 transitions
Drop transitions removed 1190 transitions
Reduce isomorphic transitions removed 1190 transitions.
Drop transitions removed 3331 transitions
Trivial Post-agglo rules discarded 3331 transitions
Performed 3331 trivial Post agglomeration. Transition count delta: 3331
Iterating post reduction 0 with 4521 rules applied. Total rules applied 4522 place count 11142 transition count 11750
Reduce places removed 3332 places and 0 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 3339 rules applied. Total rules applied 7861 place count 7810 transition count 11743
Reduce places removed 7 places and 0 transitions.
Performed 1402 Post agglomeration using F-continuation condition.Transition count delta: 1402
Iterating post reduction 2 with 1409 rules applied. Total rules applied 9270 place count 7803 transition count 10341
Reduce places removed 1402 places and 0 transitions.
Iterating post reduction 3 with 1402 rules applied. Total rules applied 10672 place count 6401 transition count 10341
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 10672 place count 6401 transition count 10267
Deduced a syphon composed of 74 places in 8 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 10820 place count 6327 transition count 10267
Discarding 2841 places :
Symmetric choice reduction at 4 with 2841 rule applications. Total rules 13661 place count 3486 transition count 7426
Iterating global reduction 4 with 2841 rules applied. Total rules applied 16502 place count 3486 transition count 7426
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 16563 place count 3425 transition count 7365
Iterating global reduction 4 with 61 rules applied. Total rules applied 16624 place count 3425 transition count 7365
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16625 place count 3424 transition count 7365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 16627 place count 3423 transition count 7364
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 16644 place count 3423 transition count 7347
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 16661 place count 3406 transition count 7347
Partial Free-agglomeration rule applied 233 times.
Drop transitions removed 233 transitions
Iterating global reduction 6 with 233 rules applied. Total rules applied 16894 place count 3406 transition count 7347
Applied a total of 16894 rules in 4050 ms. Remains 3406 /21462 variables (removed 18056) and now considering 7347/21129 (removed 13782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4053 ms. Remains : 3406/21462 places, 7347/21129 transitions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 10) seen :5
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 06:05:57] [INFO ] Flow matrix only has 6028 transitions (discarded 1319 similar events)
// Phase 1: matrix 6028 rows 3406 cols
[2023-03-23 06:05:57] [INFO ] Computed 124 place invariants in 96 ms
[2023-03-23 06:05:58] [INFO ] [Real]Absence check using 0 positive and 124 generalized place invariants in 45 ms returned sat
[2023-03-23 06:05:58] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 06:05:59] [INFO ] [Nat]Absence check using 0 positive and 124 generalized place invariants in 55 ms returned sat
[2023-03-23 06:06:04] [INFO ] After 4574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 06:06:07] [INFO ] After 8046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3601 ms.
[2023-03-23 06:06:11] [INFO ] After 12481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 160 out of 3406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3406/3406 places, 7347/7347 transitions.
Graph (complete) has 17217 edges and 3406 vertex of which 3243 are kept as prefixes of interest. Removing 163 places using SCC suffix rule.4 ms
Discarding 163 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 3243 transition count 7181
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 15 rules applied. Total rules applied 163 place count 3235 transition count 7174
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 170 place count 3228 transition count 7174
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 170 place count 3228 transition count 7167
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 184 place count 3221 transition count 7167
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 225 place count 3180 transition count 7126
Iterating global reduction 3 with 41 rules applied. Total rules applied 266 place count 3180 transition count 7126
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 3180 transition count 7124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 270 place count 3178 transition count 7124
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 327 place count 3178 transition count 7124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 330 place count 3175 transition count 7121
Iterating global reduction 4 with 3 rules applied. Total rules applied 333 place count 3175 transition count 7121
Applied a total of 333 rules in 1790 ms. Remains 3175 /3406 variables (removed 231) and now considering 7121/7347 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1791 ms. Remains : 3175/3406 places, 7121/7347 transitions.
Incomplete random walk after 10000 steps, including 579 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 06:06:13] [INFO ] Flow matrix only has 5634 transitions (discarded 1487 similar events)
// Phase 1: matrix 5634 rows 3175 cols
[2023-03-23 06:06:13] [INFO ] Computed 115 place invariants in 61 ms
[2023-03-23 06:06:14] [INFO ] [Real]Absence check using 0 positive and 115 generalized place invariants in 41 ms returned sat
[2023-03-23 06:06:14] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:06:14] [INFO ] [Nat]Absence check using 0 positive and 115 generalized place invariants in 43 ms returned sat
[2023-03-23 06:06:18] [INFO ] After 3900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:06:21] [INFO ] After 6432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2096 ms.
[2023-03-23 06:06:23] [INFO ] After 9200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 149 out of 3175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3175/3175 places, 7121/7121 transitions.
Graph (complete) has 16062 edges and 3175 vertex of which 3112 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 3112 transition count 7060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 56 place count 3112 transition count 7059
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 3111 transition count 7059
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 70 place count 3099 transition count 7047
Iterating global reduction 1 with 12 rules applied. Total rules applied 82 place count 3099 transition count 7047
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 1 with 2 rules applied. Total rules applied 84 place count 3098 transition count 7046
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 111 place count 3098 transition count 7046
Applied a total of 111 rules in 1362 ms. Remains 3098 /3175 variables (removed 77) and now considering 7046/7121 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1362 ms. Remains : 3098/3175 places, 7046/7121 transitions.
Incomplete random walk after 10000 steps, including 584 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 31936 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31936 steps, saw 11047 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 06:06:28] [INFO ] Flow matrix only has 5494 transitions (discarded 1552 similar events)
// Phase 1: matrix 5494 rows 3098 cols
[2023-03-23 06:06:28] [INFO ] Computed 113 place invariants in 57 ms
[2023-03-23 06:06:28] [INFO ] [Real]Absence check using 0 positive and 113 generalized place invariants in 42 ms returned sat
[2023-03-23 06:06:28] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:06:29] [INFO ] [Nat]Absence check using 0 positive and 113 generalized place invariants in 40 ms returned sat
[2023-03-23 06:06:33] [INFO ] After 3561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:06:35] [INFO ] After 5594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2027 ms.
[2023-03-23 06:06:37] [INFO ] After 8280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 149 out of 3098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3098/3098 places, 7046/7046 transitions.
Applied a total of 0 rules in 329 ms. Remains 3098 /3098 variables (removed 0) and now considering 7046/7046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 3098/3098 places, 7046/7046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3098/3098 places, 7046/7046 transitions.
Applied a total of 0 rules in 340 ms. Remains 3098 /3098 variables (removed 0) and now considering 7046/7046 (removed 0) transitions.
[2023-03-23 06:06:37] [INFO ] Flow matrix only has 5494 transitions (discarded 1552 similar events)
[2023-03-23 06:06:37] [INFO ] Invariant cache hit.
[2023-03-23 06:06:40] [INFO ] Implicit Places using invariants in 2586 ms returned [3, 42, 45, 83, 197, 241, 275, 314, 351, 385, 388, 457, 460, 529, 532, 566, 608, 642, 684, 718, 760, 830, 833, 867, 870, 904, 980, 983, 1022, 1056, 1059, 1093, 1096, 1166, 1244, 1247, 1281, 1284, 1321, 1355, 1358, 1428, 1470, 1472, 1509, 1547, 1658, 1735, 1772, 1851, 1889, 2008, 2120, 2199, 2271, 2344, 2381, 2418, 2534, 2572, 2611, 2725, 2797, 2834, 2910, 2992]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 2595 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3032/3098 places, 7046/7046 transitions.
Discarding 1242 places :
Symmetric choice reduction at 0 with 1242 rule applications. Total rules 1242 place count 1790 transition count 5804
Iterating global reduction 0 with 1242 rules applied. Total rules applied 2484 place count 1790 transition count 5804
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 2529 place count 1745 transition count 5759
Iterating global reduction 0 with 45 rules applied. Total rules applied 2574 place count 1745 transition count 5759
Discarding 573 places :
Symmetric choice reduction at 0 with 573 rule applications. Total rules 3147 place count 1172 transition count 5186
Iterating global reduction 0 with 573 rules applied. Total rules applied 3720 place count 1172 transition count 5186
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 3778 place count 1143 transition count 5157
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 3790 place count 1143 transition count 5145
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 3802 place count 1131 transition count 5145
Applied a total of 3802 rules in 550 ms. Remains 1131 /3032 variables (removed 1901) and now considering 5145/7046 (removed 1901) transitions.
[2023-03-23 06:06:41] [INFO ] Flow matrix only has 2186 transitions (discarded 2959 similar events)
// Phase 1: matrix 2186 rows 1131 cols
[2023-03-23 06:06:41] [INFO ] Computed 47 place invariants in 15 ms
[2023-03-23 06:06:41] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-23 06:06:41] [INFO ] Flow matrix only has 2186 transitions (discarded 2959 similar events)
[2023-03-23 06:06:41] [INFO ] Invariant cache hit.
[2023-03-23 06:06:46] [INFO ] Implicit Places using invariants and state equation in 4634 ms returned [139, 175, 522, 558, 560, 579, 622, 626, 652, 661, 680, 703, 709, 761, 763, 789, 825, 827, 866, 869, 873, 876, 896, 915, 925, 930, 987, 1023, 1025, 1028, 1070, 1075, 1109]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5306 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1098/3098 places, 5145/7046 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 1098 transition count 5139
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1092 transition count 5139
Discarding 392 places :
Symmetric choice reduction at 0 with 392 rule applications. Total rules 404 place count 700 transition count 4747
Iterating global reduction 0 with 392 rules applied. Total rules applied 796 place count 700 transition count 4747
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 820 place count 688 transition count 4735
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 834 place count 688 transition count 4721
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 848 place count 674 transition count 4721
Applied a total of 848 rules in 204 ms. Remains 674 /1098 variables (removed 424) and now considering 4721/5145 (removed 424) transitions.
[2023-03-23 06:06:46] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
// Phase 1: matrix 1728 rows 674 cols
[2023-03-23 06:06:46] [INFO ] Computed 47 place invariants in 8 ms
[2023-03-23 06:06:47] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-23 06:06:47] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
[2023-03-23 06:06:47] [INFO ] Invariant cache hit.
[2023-03-23 06:06:49] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 674/3098 places, 4721/7046 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 11872 ms. Remains : 674/3098 places, 4721/7046 transitions.
Incomplete random walk after 10000 steps, including 862 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68218 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68218 steps, saw 18470 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 06:06:53] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
[2023-03-23 06:06:53] [INFO ] Invariant cache hit.
[2023-03-23 06:06:53] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-23 06:06:53] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:06:53] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-23 06:06:54] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:06:55] [INFO ] After 1990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 727 ms.
[2023-03-23 06:06:56] [INFO ] After 2878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5 ms.
Support contains 149 out of 674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 674/674 places, 4721/4721 transitions.
Applied a total of 0 rules in 59 ms. Remains 674 /674 variables (removed 0) and now considering 4721/4721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 674/674 places, 4721/4721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 674/674 places, 4721/4721 transitions.
Applied a total of 0 rules in 59 ms. Remains 674 /674 variables (removed 0) and now considering 4721/4721 (removed 0) transitions.
[2023-03-23 06:06:56] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
[2023-03-23 06:06:56] [INFO ] Invariant cache hit.
[2023-03-23 06:06:56] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-23 06:06:56] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
[2023-03-23 06:06:56] [INFO ] Invariant cache hit.
[2023-03-23 06:06:59] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2023-03-23 06:06:59] [INFO ] Redundant transitions in 378 ms returned []
[2023-03-23 06:06:59] [INFO ] Flow matrix only has 1728 transitions (discarded 2993 similar events)
[2023-03-23 06:06:59] [INFO ] Invariant cache hit.
[2023-03-23 06:07:01] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4822 ms. Remains : 674/674 places, 4721/4721 transitions.
Drop transitions removed 1083 transitions
Ensure Unique test removed 1932 transitions
Reduce isomorphic transitions removed 3015 transitions.
Iterating post reduction 0 with 3015 rules applied. Total rules applied 3015 place count 674 transition count 1706
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 3015 place count 674 transition count 1688
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 3051 place count 656 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 3054 place count 653 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 3057 place count 653 transition count 1628
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 3079 place count 642 transition count 1617
Free-agglomeration rule applied 184 times.
Iterating global reduction 1 with 184 rules applied. Total rules applied 3263 place count 642 transition count 1433
Reduce places removed 184 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 3457 place count 458 transition count 1423
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 3459 place count 458 transition count 1421
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 3471 place count 458 transition count 1409
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 3483 place count 446 transition count 1409
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3485 place count 444 transition count 1407
Iterating global reduction 3 with 2 rules applied. Total rules applied 3487 place count 444 transition count 1407
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3489 place count 444 transition count 1405
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 3 with 93 rules applied. Total rules applied 3582 place count 444 transition count 1405
Applied a total of 3582 rules in 112 ms. Remains 444 /674 variables (removed 230) and now considering 1405/4721 (removed 3316) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1405 rows 444 cols
[2023-03-23 06:07:01] [INFO ] Computed 47 place invariants in 14 ms
[2023-03-23 06:07:01] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 9 ms returned sat
[2023-03-23 06:07:01] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:07:01] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 9 ms returned sat
[2023-03-23 06:07:02] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:07:02] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-23 06:07:03] [INFO ] After 1815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 06:07:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-23 06:07:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 674 places, 4721 transitions and 19424 arcs took 23 ms.
[2023-03-23 06:07:03] [INFO ] Flatten gal took : 323 ms
Total runtime 125463 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/542/inv_0_ --invariant=/tmp/542/inv_1_ --invariant=/tmp/542/inv_2_ --invariant=/tmp/542/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15441236 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16081752 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="LeafsetExtension-PT-S64C4"
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 LeafsetExtension-PT-S64C4, 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 r233-tall-167856419000543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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