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.r329-tall-167889202500766.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 ResAllocation-PT-R050C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202500766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 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 ResAllocation-PT-R050C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679169994954

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=ResAllocation-PT-R050C002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:06:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:06:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:06:36] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-18 20:06:36] [INFO ] Transformed 200 places.
[2023-03-18 20:06:36] [INFO ] Transformed 102 transitions.
[2023-03-18 20:06:36] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 102 rows 200 cols
[2023-03-18 20:06:37] [INFO ] Computed 100 place invariants in 13 ms
[2023-03-18 20:06:37] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-18 20:06:37] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-18 20:06:38] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 20:06:38] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
[2023-03-18 20:06:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-18 20:06:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-18 20:06:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2023-03-18 20:06:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:06:38] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2023-03-18 20:06:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-18 20:06:38] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-18 20:06:38] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 68 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 196 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 195 transition count 99
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 195 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 192 transition count 98
Applied a total of 12 rules in 62 ms. Remains 192 /200 variables (removed 8) and now considering 98/102 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 192/200 places, 98/102 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 635074 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{1=1}
Probabilistic random walk after 635074 steps, saw 169055 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 192 cols
[2023-03-18 20:06:42] [INFO ] Computed 96 place invariants in 3 ms
[2023-03-18 20:06:42] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:06:42] [INFO ] [Nat]Absence check using 96 positive place invariants in 48 ms returned sat
[2023-03-18 20:06:42] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:06:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-18 20:06:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:06:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:06:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 20:06:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2023-03-18 20:06:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 178 ms
[2023-03-18 20:06:42] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 20:06:42] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 624040 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 624040 steps, saw 165975 distinct states, run finished after 3002 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 20:06:46] [INFO ] Invariant cache hit.
[2023-03-18 20:06:46] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:06:46] [INFO ] [Nat]Absence check using 96 positive place invariants in 12 ms returned sat
[2023-03-18 20:06:46] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:06:46] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 20:06:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2023-03-18 20:06:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2023-03-18 20:06:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2023-03-18 20:06:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 20:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-18 20:06:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-18 20:06:46] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-18 20:06:46] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 52 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 20:06:46] [INFO ] Invariant cache hit.
[2023-03-18 20:06:46] [INFO ] Implicit Places using invariants in 111 ms returned [101, 107, 109, 113, 115, 121, 123, 127, 129, 131, 135, 137, 139, 141, 143, 145, 147, 149, 153, 155, 157, 159, 161, 163, 167, 171, 173, 177, 179, 181, 183, 187, 189, 191]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 114 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/192 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 125 ms. Remains : 158/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 619954 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619954 steps, saw 164414 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 158 cols
[2023-03-18 20:06:50] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-18 20:06:50] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:06:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 6 ms returned sat
[2023-03-18 20:06:50] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2023-03-18 20:06:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 203 ms
[2023-03-18 20:06:50] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 20:06:50] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 97 ms.
Support contains 53 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 20:06:50] [INFO ] Invariant cache hit.
[2023-03-18 20:06:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 20:06:50] [INFO ] Invariant cache hit.
[2023-03-18 20:06:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-18 20:06:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:06:51] [INFO ] Invariant cache hit.
[2023-03-18 20:06:51] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 20:06:51] [INFO ] Invariant cache hit.
[2023-03-18 20:06:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:06:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 6 ms returned sat
[2023-03-18 20:06:51] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:06:51] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-03-18 20:06:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2023-03-18 20:06:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2023-03-18 20:06:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-18 20:06:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 125 ms
[2023-03-18 20:06:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-18 20:06:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-18 20:06:51] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-18 20:06:51] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 20:06:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-18 20:06:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 98 transitions and 412 arcs took 2 ms.
[2023-03-18 20:06:51] [INFO ] Flatten gal took : 39 ms
Total runtime 15455 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/581/inv_0_ --invariant=/tmp/581/inv_1_ --invariant=/tmp/581/inv_2_ --invariant=/tmp/581/inv_3_ --inv-par
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679170015523

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 ResAllocation-PT-R050C002-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/581/inv_0_
rfs formula name ResAllocation-PT-R050C002-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/581/inv_1_
rfs formula name ResAllocation-PT-R050C002-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/581/inv_2_
rfs formula name ResAllocation-PT-R050C002-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/581/inv_3_
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 158 places, 98 transitions and 412 arcs
pnml2lts-sym: Petri net ResAllocation_PT_R050C002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 98->94 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 158; there are 94 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:
pnml2lts-sym: Invariant violation (/tmp/581/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 9448 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.060 real 0.230 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 7.0368744177664e+15 states, 562 nodes
pnml2lts-sym: group_next: 958 nodes total
pnml2lts-sym: group_explored: 1074 nodes, 752 short vectors total
pnml2lts-sym: max token count: 1

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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r329-tall-167889202500766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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