Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800135.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 256K 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 ShieldRVs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679299283620

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:01:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:01:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:01:25] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-20 08:01:25] [INFO ] Transformed 563 places.
[2023-03-20 08:01:25] [INFO ] Transformed 763 transitions.
[2023-03-20 08:01:25] [INFO ] Found NUPN structural information;
[2023-03-20 08:01:25] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 08:01:27] [INFO ] Computed 161 place invariants in 30 ms
[2023-03-20 08:01:27] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 08:01:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 86 ms returned sat
[2023-03-20 08:01:29] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 08:01:29] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 19 ms to minimize.
[2023-03-20 08:01:30] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-20 08:01:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:01:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2023-03-20 08:01:30] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:01:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 811 ms
[2023-03-20 08:01:30] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:01:31] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:01:32] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 20 places in 335 ms of which 0 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-20 08:01:33] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 4 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:01:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 4434 ms
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-20 08:01:35] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-20 08:01:36] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-03-20 08:01:37] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:01:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:01:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1900 ms
[2023-03-20 08:01:37] [INFO ] After 9020ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 825 ms.
[2023-03-20 08:01:38] [INFO ] After 10255ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 160 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 54 place count 562 transition count 762
Applied a total of 54 rules in 146 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) 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 3) 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 3) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 08:01:38] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-20 08:01:38] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:01:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 08:01:39] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 12 ms to minimize.
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-20 08:01:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-20 08:01:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 748 ms
[2023-03-20 08:01:41] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2023-03-20 08:01:41] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 08:01:41] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-20 08:01:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2023-03-20 08:01:42] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:01:43] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:01:44] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:01:44] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:01:44] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:01:44] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:01:44] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:01:45] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2023-03-20 08:01:46] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:01:47] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2023-03-20 08:01:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2023-03-20 08:01:49] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 8378 ms
[2023-03-20 08:01:49] [INFO ] After 10458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 708 ms.
[2023-03-20 08:01:50] [INFO ] After 11330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 66 ms.
Support contains 141 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 562 transition count 762
Applied a total of 4 rules in 56 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 260250 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260250 steps, saw 59547 distinct states, run finished after 3018 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 08:01:53] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 08:01:53] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:01:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 08:01:55] [INFO ] After 1002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:01:55] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:01:55] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-20 08:01:55] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-20 08:01:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 595 ms
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-20 08:01:56] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:01:57] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:01:58] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 08:01:59] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:02:00] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 08:02:01] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:02:02] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:02:03] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-20 08:02:04] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-20 08:02:05] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-20 08:02:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-20 08:02:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-20 08:02:06] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 9984 ms
[2023-03-20 08:02:06] [INFO ] After 12126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 497 ms.
[2023-03-20 08:02:06] [INFO ] After 12827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 141 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 22 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 22 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2023-03-20 08:02:06] [INFO ] Invariant cache hit.
[2023-03-20 08:02:07] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-20 08:02:07] [INFO ] Invariant cache hit.
[2023-03-20 08:02:07] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2023-03-20 08:02:07] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-20 08:02:07] [INFO ] Invariant cache hit.
[2023-03-20 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:02:08] [INFO ] Invariant cache hit.
[2023-03-20 08:02:08] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:02:08] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-20 08:02:09] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-20 08:02:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 448 ms
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-20 08:02:10] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-20 08:02:11] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-20 08:02:12] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 08:02:13] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:02:14] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:02:15] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:02:16] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:02:17] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2023-03-20 08:02:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:02:19] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-20 08:02:20] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2023-03-20 08:02:21] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2023-03-20 08:02:22] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:02:23] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:02:24] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2023-03-20 08:02:25] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:02:26] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:02:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:02:28] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:02:29] [INFO ] Trap strengthening (SAT) tested/added 159/158 trap constraints in 19131 ms
[2023-03-20 08:02:29] [INFO ] After 20853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1111 ms.
[2023-03-20 08:02:30] [INFO ] After 22118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:02:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2023-03-20 08:02:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 762 transitions and 3790 arcs took 7 ms.
[2023-03-20 08:02:31] [INFO ] Flatten gal took : 138 ms
Total runtime 65558 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1641/inv_0_ --invariant=/tmp/1641/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16023652 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095116 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ShieldRVs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-040A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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