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.r169-tall-167838855400134.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 EnergyBus-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678493930541

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=EnergyBus-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:18:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:18:52] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2023-03-11 00:18:52] [INFO ] Transformed 157 places.
[2023-03-11 00:18:52] [INFO ] Transformed 4430 transitions.
[2023-03-11 00:18:52] [INFO ] Found NUPN structural information;
[2023-03-11 00:18:52] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 22 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-13 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 10) seen :5
FORMULA EnergyBus-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 00:18:53] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 00:18:53] [INFO ] Computed 23 place invariants in 15 ms
[2023-03-11 00:18:53] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 00:18:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-11 00:18:53] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:18:54] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 00:18:54] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-11 00:18:54] [INFO ] After 184ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-11 00:18:54] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 6 ms to minimize.
[2023-03-11 00:18:55] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-11 00:18:55] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-11 00:18:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 746 ms
[2023-03-11 00:18:55] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-11 00:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-11 00:18:55] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 0 ms to minimize.
[2023-03-11 00:18:55] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-11 00:18:56] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2023-03-11 00:18:56] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2023-03-11 00:18:56] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 0 ms to minimize.
[2023-03-11 00:18:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1343 ms
[2023-03-11 00:18:56] [INFO ] After 2459ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-11 00:18:56] [INFO ] After 2980ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA EnergyBus-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 12 / 153 are part of one of the 5 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 21 transitions
Ensure Unique test removed 1035 transitions
Reduce isomorphic transitions removed 1056 transitions.
Graph (complete) has 762 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 142 transition count 849
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 139 transition count 847
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 139 transition count 840
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 132 transition count 840
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 47 place count 111 transition count 585
Iterating global reduction 2 with 21 rules applied. Total rules applied 68 place count 111 transition count 585
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 98 place count 111 transition count 555
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 114 place count 103 transition count 547
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 141 place count 103 transition count 520
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 518
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 518
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 4 with 2 rules applied. Total rules applied 145 place count 101 transition count 517
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 101 transition count 515
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 161 place count 94 transition count 550
Drop transitions removed 3 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 169 place count 94 transition count 542
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 217 place count 94 transition count 494
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 219 place count 93 transition count 493
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 221 place count 92 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 91 transition count 492
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 222 place count 91 transition count 489
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 228 place count 88 transition count 489
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 240 place count 82 transition count 483
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 271 place count 82 transition count 452
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 281 place count 82 transition count 442
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 291 place count 72 transition count 442
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 292 place count 72 transition count 441
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 293 place count 72 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 294 place count 71 transition count 463
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 302 place count 71 transition count 455
Applied a total of 302 rules in 395 ms. Remains 71 /153 variables (removed 82) and now considering 455/1913 (removed 1458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 71/153 places, 455/1913 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :1
FORMULA EnergyBus-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 :1
FORMULA EnergyBus-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 00:18:57] [INFO ] Flow matrix only has 201 transitions (discarded 254 similar events)
// Phase 1: matrix 201 rows 71 cols
[2023-03-11 00:18:57] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-11 00:18:57] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 00:18:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 00:18:57] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 00:18:57] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 00:18:57] [INFO ] State equation strengthened by 150 read => feed constraints.
[2023-03-11 00:18:57] [INFO ] After 39ms SMT Verify possible using 150 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 00:18:57] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-11 00:18:57] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-11 00:18:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-11 00:18:57] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 00:18:57] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 455/455 transitions.
Graph (trivial) has 14 edges and 71 vertex of which 3 / 71 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 67 transition count 403
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 67 transition count 403
Applied a total of 4 rules in 26 ms. Remains 67 /71 variables (removed 4) and now considering 403/455 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 67/71 places, 403/455 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 712193 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 712193 steps, saw 114752 distinct states, run finished after 3002 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 00:19:01] [INFO ] Flow matrix only has 177 transitions (discarded 226 similar events)
// Phase 1: matrix 177 rows 67 cols
[2023-03-11 00:19:01] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-11 00:19:01] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 00:19:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-11 00:19:01] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 00:19:01] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 00:19:01] [INFO ] State equation strengthened by 130 read => feed constraints.
[2023-03-11 00:19:01] [INFO ] After 42ms SMT Verify possible using 130 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 00:19:01] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-11 00:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-11 00:19:01] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 00:19:01] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 403/403 transitions.
Applied a total of 0 rules in 22 ms. Remains 67 /67 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 67/67 places, 403/403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 67 /67 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2023-03-11 00:19:01] [INFO ] Flow matrix only has 177 transitions (discarded 226 similar events)
[2023-03-11 00:19:01] [INFO ] Invariant cache hit.
[2023-03-11 00:19:01] [INFO ] Implicit Places using invariants in 418 ms returned [3, 4, 5, 6, 24, 28, 55]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 424 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/67 places, 403/403 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 59 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 58 transition count 401
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 53 transition count 396
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 2 with 73 rules applied. Total rules applied 87 place count 53 transition count 323
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 53 transition count 321
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 51 transition count 321
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 100 place count 51 transition count 321
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 51 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 50 transition count 314
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 50 transition count 314
Applied a total of 108 rules in 64 ms. Remains 50 /60 variables (removed 10) and now considering 314/403 (removed 89) transitions.
[2023-03-11 00:19:01] [INFO ] Flow matrix only has 124 transitions (discarded 190 similar events)
// Phase 1: matrix 124 rows 50 cols
[2023-03-11 00:19:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 00:19:02] [INFO ] Implicit Places using invariants in 156 ms returned [35, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 157 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/67 places, 314/403 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 311
Applied a total of 6 rules in 9 ms. Remains 45 /48 variables (removed 3) and now considering 311/314 (removed 3) transitions.
[2023-03-11 00:19:02] [INFO ] Flow matrix only has 121 transitions (discarded 190 similar events)
// Phase 1: matrix 121 rows 45 cols
[2023-03-11 00:19:02] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 00:19:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 00:19:02] [INFO ] Flow matrix only has 121 transitions (discarded 190 similar events)
[2023-03-11 00:19:02] [INFO ] Invariant cache hit.
[2023-03-11 00:19:02] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-11 00:19:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [7, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 43/67 places, 311/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 43 /43 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 829 ms. Remains : 43/67 places, 311/403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 857086 steps, run visited all 2 properties in 1395 ms. (steps per millisecond=614 )
Probabilistic random walk after 857086 steps, saw 123504 distinct states, run finished after 1395 ms. (steps per millisecond=614 ) properties seen :2
FORMULA EnergyBus-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11554 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/521/inv_0_ --invariant=/tmp/521/inv_1_ --invariant=/tmp/521/inv_2_ --invariant=/tmp/521/inv_3_ --invariant=/tmp/521/inv_4_ --invariant=/tmp/521/inv_5_ --invariant=/tmp/521/inv_6_ --invariant=/tmp/521/inv_7_ --invariant=/tmp/521/inv_8_ --invariant=/tmp/521/inv_9_ --invariant=/tmp/521/inv_10_ --invariant=/tmp/521/inv_11_ --invariant=/tmp/521/inv_12_ --invariant=/tmp/521/inv_13_ --invariant=/tmp/521/inv_14_ --invariant=/tmp/521/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 15486488 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096180 kB
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-00
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-01
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-02
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-03
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-04
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-05
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-06
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-07
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-08
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-09
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-10
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-11
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-12
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-13
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-14
Could not compute solution for formula : EnergyBus-PT-none-ReachabilityCardinality-15

BK_STOP 1678497516115

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_0_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_1_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_2_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_3_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_4_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_5_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_6_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_7_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_8_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_9_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_10_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_11_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_12_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_13_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/521/inv_14_
rfs formula name EnergyBus-PT-none-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/521/inv_15_
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 157 places, 4430 transitions and 63389 arcs
pnml2lts-sym: Petri net EnergyBus-PT-none analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.120 real 0.110 user 0.010 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: 4430->2148 groups
pnml2lts-sym: Regrouping took 8.860 real 8.850 user 0.000 sys
pnml2lts-sym: state vector length is 157; there are 2148 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
Killing (15) : 527
Killing (9) : 527

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="EnergyBus-PT-none"
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 EnergyBus-PT-none, 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 r169-tall-167838855400134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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