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-167987246400270.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-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 2.3M 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-09-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680849288565

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 06:34:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 06:34:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 06:34:51] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-04-07 06:34:51] [INFO ] Transformed 891 places.
[2023-04-07 06:34:51] [INFO ] Transformed 3888 transitions.
[2023-04-07 06:34:51] [INFO ] Found NUPN structural information;
[2023-04-07 06:34:51] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 14) seen :6
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 06:34:52] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-07 06:34:52] [INFO ] Computed 28 invariants in 50 ms
[2023-04-07 06:34:53] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 06:34:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 36 ms returned sat
[2023-04-07 06:34:53] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 19 ms returned sat
[2023-04-07 06:34:55] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 06:34:55] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-07 06:34:56] [INFO ] After 1007ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 06:34:56] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 25 ms to minimize.
[2023-04-07 06:34:57] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 1 ms to minimize.
[2023-04-07 06:34:57] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2023-04-07 06:34:57] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 0 ms to minimize.
[2023-04-07 06:34:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1399 ms
[2023-04-07 06:34:58] [INFO ] Deduced a trap composed of 3 places in 468 ms of which 1 ms to minimize.
[2023-04-07 06:34:58] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 1 ms to minimize.
[2023-04-07 06:34:59] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 0 ms to minimize.
[2023-04-07 06:34:59] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 0 ms to minimize.
[2023-04-07 06:34:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1458 ms
[2023-04-07 06:34:59] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 0 ms to minimize.
[2023-04-07 06:35:00] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 0 ms to minimize.
[2023-04-07 06:35:00] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 0 ms to minimize.
[2023-04-07 06:35:00] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2023-04-07 06:35:01] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2023-04-07 06:35:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1508 ms
[2023-04-07 06:35:01] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2023-04-07 06:35:01] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2023-04-07 06:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-04-07 06:35:01] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-04-07 06:35:02] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 1 ms to minimize.
[2023-04-07 06:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2023-04-07 06:35:02] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-04-07 06:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-04-07 06:35:02] [INFO ] After 7418ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 694 ms.
[2023-04-07 06:35:03] [INFO ] After 10024ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 203 ms.
Support contains 113 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 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 891 transition count 3882
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 885 transition count 3880
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 883 transition count 3880
Performed 186 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 186 Pre rules applied. Total rules applied 16 place count 883 transition count 3694
Deduced a syphon composed of 186 places in 4 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 388 place count 697 transition count 3694
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 451 place count 634 transition count 3127
Iterating global reduction 3 with 63 rules applied. Total rules applied 514 place count 634 transition count 3127
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 6 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 616 place count 583 transition count 3076
Applied a total of 616 rules in 429 ms. Remains 583 /891 variables (removed 308) and now considering 3076/3888 (removed 812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 583/891 places, 3076/3888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 301250 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1, 6=1}
Probabilistic random walk after 301250 steps, saw 202322 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :6
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-04-07 06:35:07] [INFO ] Flow matrix only has 997 transitions (discarded 2079 similar events)
// Phase 1: matrix 997 rows 583 cols
[2023-04-07 06:35:07] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:35:07] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:35:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:35:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:35:08] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:08] [INFO ] State equation strengthened by 428 read => feed constraints.
[2023-04-07 06:35:08] [INFO ] After 101ms SMT Verify possible using 428 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:08] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-04-07 06:35:08] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 0 ms to minimize.
[2023-04-07 06:35:09] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2023-04-07 06:35:09] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2023-04-07 06:35:09] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 0 ms to minimize.
[2023-04-07 06:35:09] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2023-04-07 06:35:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1470 ms
[2023-04-07 06:35:09] [INFO ] After 1601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 06:35:09] [INFO ] After 1994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 3076/3076 transitions.
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 65 Pre rules applied. Total rules applied 0 place count 583 transition count 3011
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 518 transition count 3011
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 510 transition count 2939
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 510 transition count 2939
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 184 place count 491 transition count 2920
Applied a total of 184 rules in 329 ms. Remains 491 /583 variables (removed 92) and now considering 2920/3076 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 491/583 places, 2920/3076 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437970 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437970 steps, saw 266796 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:35:13] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
// Phase 1: matrix 841 rows 491 cols
[2023-04-07 06:35:13] [INFO ] Computed 28 invariants in 15 ms
[2023-04-07 06:35:13] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:35:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:35:13] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:35:13] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:13] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:35:13] [INFO ] After 99ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:13] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2023-04-07 06:35:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-07 06:35:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-04-07 06:35:14] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-07 06:35:14] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 124 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 491/491 places, 2920/2920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2920/2920 transitions.
Applied a total of 0 rules in 138 ms. Remains 491 /491 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2023-04-07 06:35:14] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 06:35:14] [INFO ] Invariant cache hit.
[2023-04-07 06:35:15] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-04-07 06:35:15] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 06:35:15] [INFO ] Invariant cache hit.
[2023-04-07 06:35:15] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 06:35:17] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 3101 ms to find 0 implicit places.
[2023-04-07 06:35:17] [INFO ] Redundant transitions in 150 ms returned []
[2023-04-07 06:35:17] [INFO ] Flow matrix only has 841 transitions (discarded 2079 similar events)
[2023-04-07 06:35:17] [INFO ] Invariant cache hit.
[2023-04-07 06:35:18] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4407 ms. Remains : 491/491 places, 2920/2920 transitions.
Graph (trivial) has 2695 edges and 491 vertex of which 80 / 491 are part of one of the 9 SCC in 5 ms
Free SCC test removed 71 places
Drop transitions removed 271 transitions
Ensure Unique test removed 2025 transitions
Reduce isomorphic transitions removed 2296 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 420 transition count 528
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 324 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 322 transition count 526
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 197 place count 322 transition count 509
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 238 place count 298 transition count 509
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 284 rules applied. Total rules applied 522 place count 156 transition count 367
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 591 place count 156 transition count 298
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 605 place count 149 transition count 298
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 612 place count 149 transition count 291
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 623 place count 149 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 698 place count 149 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 773 place count 74 transition count 205
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 774 place count 74 transition count 204
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 783 place count 74 transition count 204
Applied a total of 783 rules in 83 ms. Remains 74 /491 variables (removed 417) and now considering 204/2920 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 204 rows 74 cols
[2023-04-07 06:35:18] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 06:35:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:35:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 133 ms returned sat
[2023-04-07 06:35:19] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 24 ms returned sat
[2023-04-07 06:35:19] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 06:35:19] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:19] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 06:35:19] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:35:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-04-07 06:35:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 2920 transitions and 15578 arcs took 19 ms.
[2023-04-07 06:35:20] [INFO ] Flatten gal took : 309 ms
Total runtime 29340 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 --invariant=/tmp/579/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15259320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100048 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="ReachabilityCardinality"
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-09, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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