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.r521-tall-167987246400255.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 EisenbergMcGuire-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 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 EisenbergMcGuire-PT-07-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680842380991

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=EisenbergMcGuire-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:39:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 04:39:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:39:42] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-04-07 04:39:42] [INFO ] Transformed 553 places.
[2023-04-07 04:39:42] [INFO ] Transformed 1960 transitions.
[2023-04-07 04:39:42] [INFO ] Found NUPN structural information;
[2023-04-07 04:39:42] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 16) seen :7
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 04:39:43] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-07 04:39:43] [INFO ] Computed 22 invariants in 27 ms
[2023-04-07 04:39:44] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 04:39:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2023-04-07 04:39:44] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-07 04:39:45] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-04-07 04:39:45] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 04:39:45] [INFO ] After 349ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2023-04-07 04:39:46] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 5 ms to minimize.
[2023-04-07 04:39:46] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 1 ms to minimize.
[2023-04-07 04:39:46] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2023-04-07 04:39:46] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 0 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1805 ms
[2023-04-07 04:39:47] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-07 04:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-07 04:39:48] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:39:48] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:39:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-04-07 04:39:48] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-04-07 04:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 04:39:48] [INFO ] After 2974ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-04-07 04:39:48] [INFO ] After 4405ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 29 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 553 transition count 1954
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 547 transition count 1954
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 12 place count 547 transition count 1803
Deduced a syphon composed of 151 places in 4 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 314 place count 396 transition count 1803
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 353 place count 357 transition count 1530
Iterating global reduction 2 with 39 rules applied. Total rules applied 392 place count 357 transition count 1530
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 476 place count 315 transition count 1488
Applied a total of 476 rules in 213 ms. Remains 315 /553 variables (removed 238) and now considering 1488/1960 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 315/553 places, 1488/1960 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :1
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:39:49] [INFO ] Flow matrix only has 529 transitions (discarded 959 similar events)
// Phase 1: matrix 529 rows 315 cols
[2023-04-07 04:39:49] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:39:49] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:39:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:39:49] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:39:49] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:39:49] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-07 04:39:50] [INFO ] After 145ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-04-07 04:39:50] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1424 ms
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2023-04-07 04:39:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2023-04-07 04:39:51] [INFO ] After 2045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-04-07 04:39:52] [INFO ] After 2485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 17 ms.
Support contains 29 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 1488/1488 transitions.
Applied a total of 0 rules in 57 ms. Remains 315 /315 variables (removed 0) and now considering 1488/1488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 315/315 places, 1488/1488 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 406016 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{0=1}
Probabilistic random walk after 406016 steps, saw 176358 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :1
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-04-07 04:39:55] [INFO ] Flow matrix only has 529 transitions (discarded 959 similar events)
[2023-04-07 04:39:55] [INFO ] Invariant cache hit.
[2023-04-07 04:39:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:39:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:39:55] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:39:55] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:55] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-07 04:39:55] [INFO ] After 116ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 565 ms
[2023-04-07 04:39:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-07 04:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-07 04:39:56] [INFO ] After 838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-04-07 04:39:56] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 9 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 1488/1488 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 315 transition count 1486
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 313 transition count 1486
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 310 transition count 1465
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 310 transition count 1465
Applied a total of 10 rules in 89 ms. Remains 310 /315 variables (removed 5) and now considering 1465/1488 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 310/315 places, 1465/1488 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 446840 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446840 steps, saw 184661 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:40:00] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2023-04-07 04:40:00] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 04:40:00] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:40:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:40:00] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:40:00] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:40:00] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:40:00] [INFO ] After 105ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:40:00] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-04-07 04:40:00] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-07 04:40:00] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-04-07 04:40:00] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:40:00] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 574 ms
[2023-04-07 04:40:01] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:40:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2023-04-07 04:40:01] [INFO ] After 1120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-04-07 04:40:01] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 9 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1465/1465 transitions.
Applied a total of 0 rules in 36 ms. Remains 310 /310 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 310/310 places, 1465/1465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1465/1465 transitions.
Applied a total of 0 rules in 32 ms. Remains 310 /310 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
[2023-04-07 04:40:01] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-07 04:40:01] [INFO ] Invariant cache hit.
[2023-04-07 04:40:01] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 04:40:01] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-07 04:40:01] [INFO ] Invariant cache hit.
[2023-04-07 04:40:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:40:02] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2023-04-07 04:40:02] [INFO ] Redundant transitions in 89 ms returned []
[2023-04-07 04:40:02] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2023-04-07 04:40:02] [INFO ] Invariant cache hit.
[2023-04-07 04:40:03] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1700 ms. Remains : 310/310 places, 1465/1465 transitions.
Graph (trivial) has 1307 edges and 310 vertex of which 49 / 310 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 268 transition count 322
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 210 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 208 transition count 320
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 121 place count 208 transition count 305
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 186 transition count 305
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 318 place count 106 transition count 225
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 354 place count 106 transition count 189
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 364 place count 101 transition count 189
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 369 place count 101 transition count 184
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 376 place count 101 transition count 177
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 420 place count 101 transition count 133
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 464 place count 57 transition count 133
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 471 place count 57 transition count 133
Applied a total of 471 rules in 32 ms. Remains 57 /310 variables (removed 253) and now considering 133/1465 (removed 1332) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 133 rows 57 cols
[2023-04-07 04:40:03] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:40:03] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:40:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:40:03] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:40:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:40:03] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:40:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-07 04:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 04:40:03] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 04:40:03] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:40:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-04-07 04:40:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 310 places, 1465 transitions and 7634 arcs took 8 ms.
[2023-04-07 04:40:03] [INFO ] Flatten gal took : 192 ms
Total runtime 21427 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/651/inv_0_ --invariant=/tmp/651/inv_1_ --invariant=/tmp/651/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 14943884 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102024 kB
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-04
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-06
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-12

BK_STOP 1680845976248

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/651/inv_0_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/651/inv_1_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/651/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 310 places, 1465 transitions and 7634 arcs
pnml2lts-sym: Petri net EisenbergMcGuire_PT_07 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1465->1458 groups
pnml2lts-sym: Regrouping took 1.060 real 1.070 user 0.000 sys
pnml2lts-sym: state vector length is 310; there are 1458 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 657
Killing (9) : 657

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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r521-tall-167987246400255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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