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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 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 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 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.7M 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-08-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680845722776

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-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 05:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:35:25] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-04-07 05:35:25] [INFO ] Transformed 712 places.
[2023-04-07 05:35:25] [INFO ] Transformed 2816 transitions.
[2023-04-07 05:35:25] [INFO ] Found NUPN structural information;
[2023-04-07 05:35:25] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 13) seen :6
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-04-07 05:35:26] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-07 05:35:26] [INFO ] Computed 25 invariants in 19 ms
[2023-04-07 05:35:27] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:35:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-04-07 05:35:27] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:35:28] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-07 05:35:28] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-07 05:35:29] [INFO ] After 593ms SMT Verify possible using 676 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-07 05:35:32] [INFO ] Deduced a trap composed of 6 places in 2554 ms of which 30 ms to minimize.
[2023-04-07 05:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2680 ms
[2023-04-07 05:35:32] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-04-07 05:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-04-07 05:35:33] [INFO ] Deduced a trap composed of 40 places in 1100 ms of which 22 ms to minimize.
[2023-04-07 05:35:33] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 05:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1360 ms
[2023-04-07 05:35:34] [INFO ] Deduced a trap composed of 3 places in 521 ms of which 6 ms to minimize.
[2023-04-07 05:35:34] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-04-07 05:35:35] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 1 ms to minimize.
[2023-04-07 05:35:36] [INFO ] Deduced a trap composed of 88 places in 1646 ms of which 1 ms to minimize.
[2023-04-07 05:35:37] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2023-04-07 05:35:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3061 ms
[2023-04-07 05:35:37] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 1 ms to minimize.
[2023-04-07 05:35:37] [INFO ] Deduced a trap composed of 127 places in 373 ms of which 1 ms to minimize.
[2023-04-07 05:35:38] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 0 ms to minimize.
[2023-04-07 05:35:38] [INFO ] Deduced a trap composed of 153 places in 302 ms of which 1 ms to minimize.
[2023-04-07 05:35:38] [INFO ] Deduced a trap composed of 148 places in 305 ms of which 0 ms to minimize.
[2023-04-07 05:35:39] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2023-04-07 05:35:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2057 ms
[2023-04-07 05:35:39] [INFO ] After 10489ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-04-07 05:35:39] [INFO ] After 12493ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 65 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 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 0 with 7 rules applied. Total rules applied 7 place count 712 transition count 2809
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 705 transition count 2809
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 163 Pre rules applied. Total rules applied 14 place count 705 transition count 2646
Deduced a syphon composed of 163 places in 3 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 340 place count 542 transition count 2646
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 391 place count 491 transition count 2238
Iterating global reduction 2 with 51 rules applied. Total rules applied 442 place count 491 transition count 2238
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 536 place count 444 transition count 2191
Applied a total of 536 rules in 275 ms. Remains 444 /712 variables (removed 268) and now considering 2191/2816 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 444/712 places, 2191/2816 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 278208 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{1=1, 2=1, 5=1}
Probabilistic random walk after 278208 steps, saw 174120 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :3
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-04-07 05:35:43] [INFO ] Flow matrix only has 743 transitions (discarded 1448 similar events)
// Phase 1: matrix 743 rows 444 cols
[2023-04-07 05:35:43] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 05:35:43] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:35:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:35:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:35:44] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:35:44] [INFO ] State equation strengthened by 319 read => feed constraints.
[2023-04-07 05:35:44] [INFO ] After 194ms SMT Verify possible using 319 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:35:44] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:35:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-07 05:35:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-04-07 05:35:44] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-04-07 05:35:45] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 59 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 2191/2191 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 444 transition count 2188
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 441 transition count 2188
Applied a total of 6 rules in 83 ms. Remains 441 /444 variables (removed 3) and now considering 2188/2191 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 441/444 places, 2188/2191 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 322488 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{1=1}
Probabilistic random walk after 322488 steps, saw 197446 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-07 05:35:48] [INFO ] Flow matrix only has 740 transitions (discarded 1448 similar events)
// Phase 1: matrix 740 rows 441 cols
[2023-04-07 05:35:48] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:35:48] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:35:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:35:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:35:48] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:48] [INFO ] State equation strengthened by 319 read => feed constraints.
[2023-04-07 05:35:48] [INFO ] After 167ms SMT Verify possible using 319 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 4 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 533 ms
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:35:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-07 05:35:49] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-04-07 05:35:50] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 52 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 2188/2188 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 441 transition count 2184
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 437 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 436 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 436 transition count 2176
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 0 with 2 rules applied. Total rules applied 12 place count 435 transition count 2175
Applied a total of 12 rules in 107 ms. Remains 435 /441 variables (removed 6) and now considering 2175/2188 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 435/441 places, 2175/2188 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 326115 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326115 steps, saw 197264 distinct states, run finished after 3005 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 05:35:53] [INFO ] Flow matrix only has 727 transitions (discarded 1448 similar events)
// Phase 1: matrix 727 rows 435 cols
[2023-04-07 05:35:53] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:35:53] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:35:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:35:53] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:35:53] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:53] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 05:35:54] [INFO ] After 163ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 05:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-07 05:35:54] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 1 ms to minimize.
[2023-04-07 05:35:54] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-07 05:35:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-04-07 05:35:54] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-04-07 05:35:54] [INFO ] After 1230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 52 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 2175/2175 transitions.
Applied a total of 0 rules in 81 ms. Remains 435 /435 variables (removed 0) and now considering 2175/2175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 435/435 places, 2175/2175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 2175/2175 transitions.
Applied a total of 0 rules in 59 ms. Remains 435 /435 variables (removed 0) and now considering 2175/2175 (removed 0) transitions.
[2023-04-07 05:35:54] [INFO ] Flow matrix only has 727 transitions (discarded 1448 similar events)
[2023-04-07 05:35:54] [INFO ] Invariant cache hit.
[2023-04-07 05:35:55] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-04-07 05:35:55] [INFO ] Flow matrix only has 727 transitions (discarded 1448 similar events)
[2023-04-07 05:35:55] [INFO ] Invariant cache hit.
[2023-04-07 05:35:55] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 05:35:56] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
[2023-04-07 05:35:57] [INFO ] Redundant transitions in 266 ms returned []
[2023-04-07 05:35:57] [INFO ] Flow matrix only has 727 transitions (discarded 1448 similar events)
[2023-04-07 05:35:57] [INFO ] Invariant cache hit.
[2023-04-07 05:35:58] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3181 ms. Remains : 435/435 places, 2175/2175 transitions.
Graph (trivial) has 1635 edges and 435 vertex of which 56 / 435 are part of one of the 8 SCC in 4 ms
Free SCC test removed 48 places
Drop transitions removed 177 transitions
Ensure Unique test removed 1430 transitions
Reduce isomorphic transitions removed 1607 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 387 transition count 513
Reduce places removed 55 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 68 rules applied. Total rules applied 124 place count 332 transition count 500
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 138 place count 319 transition count 499
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 138 place count 319 transition count 491
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 155 place count 310 transition count 491
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 161 place count 304 transition count 485
Iterating global reduction 3 with 6 rules applied. Total rules applied 167 place count 304 transition count 485
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 351 place count 212 transition count 393
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 388 place count 212 transition count 356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 390 place count 211 transition count 369
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 409 place count 211 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 210 transition count 351
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 454 place count 210 transition count 308
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 497 place count 167 transition count 308
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 498 place count 167 transition count 307
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 503 place count 167 transition count 307
Applied a total of 503 rules in 66 ms. Remains 167 /435 variables (removed 268) and now considering 307/2175 (removed 1868) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 307 rows 167 cols
[2023-04-07 05:35:58] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 05:35:58] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 05:35:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 05:35:58] [INFO ] [Nat]Absence check using 17 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 05:35:58] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-07 05:35:58] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-04-07 05:35:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-07 05:35:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-04-07 05:35:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 104 ms
[2023-04-07 05:35:58] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 9 ms to minimize.
[2023-04-07 05:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-07 05:35:58] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-07 05:35:58] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-07 05:35:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 05:35:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 435 places, 2175 transitions and 11326 arcs took 13 ms.
[2023-04-07 05:35:59] [INFO ] Flatten gal took : 159 ms
Total runtime 34034 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/601/inv_0_ --invariant=/tmp/601/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15249436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101864 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-08"
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-08, 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-167987246400262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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