fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r137-smll-167819418800541
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DoubleLock-PT-p2s2

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
702.896 3600000.00 14125368.00 684.40 0 1 0 1 1 1 1 ? 1 10 1 1 1 ? 1 1 normal

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.r137-smll-167819418800541.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 DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418800541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 14:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 813K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678933339562

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 02:22:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 02:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:22:22] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2023-03-16 02:22:22] [INFO ] Transformed 184 places.
[2023-03-16 02:22:22] [INFO ] Transformed 1832 transitions.
[2023-03-16 02:22:22] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1225 out of 1768 initially.
// Phase 1: matrix 1225 rows 148 cols
[2023-03-16 02:22:22] [INFO ] Computed 4 place invariants in 56 ms
Incomplete random walk after 10007 steps, including 95 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :19
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :5
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :6
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
[2023-03-16 02:22:22] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2023-03-16 02:22:22] [INFO ] Computed 4 place invariants in 29 ms
[2023-03-16 02:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-16 02:22:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 02:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:23] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-16 02:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 02:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:24] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2023-03-16 02:22:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:22:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 211 ms returned sat
[2023-03-16 02:22:24] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 5 ms to minimize.
[2023-03-16 02:22:25] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 1 ms to minimize.
[2023-03-16 02:22:25] [INFO ] Deduced a trap composed of 66 places in 323 ms of which 2 ms to minimize.
[2023-03-16 02:22:25] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 2 ms to minimize.
[2023-03-16 02:22:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1620 ms
[2023-03-16 02:22:26] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 209 ms.
[2023-03-16 02:22:26] [INFO ] Added : 0 causal constraints over 0 iterations in 316 ms. Result :sat
Minimization took 300 ms.
[2023-03-16 02:22:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-16 02:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:26] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-16 02:22:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:22:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 02:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:27] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-16 02:22:27] [INFO ] [Nat]Added 116 Read/Feed constraints in 471 ms returned sat
[2023-03-16 02:22:27] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 117 ms.
[2023-03-16 02:22:28] [INFO ] Added : 0 causal constraints over 0 iterations in 211 ms. Result :sat
Minimization took 315 ms.
[2023-03-16 02:22:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 02:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:28] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-16 02:22:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 02:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:29] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-16 02:22:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 108 ms returned sat
[2023-03-16 02:22:29] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 1 ms to minimize.
[2023-03-16 02:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-16 02:22:29] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 113 ms.
[2023-03-16 02:22:29] [INFO ] Added : 0 causal constraints over 0 iterations in 212 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, -1] Max seen :[1, 7, 2]
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 144 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 143 transition count 1704
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 143 transition count 1704
Applied a total of 35 rules in 156 ms. Remains 143 /148 variables (removed 5) and now considering 1704/1768 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 143/148 places, 1704/1768 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:30] [INFO ] Computed 3 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 10152 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000000 steps, including 1946 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1959 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 2) seen :2
[2023-03-16 02:22:34] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:34] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-16 02:22:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:34] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2023-03-16 02:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:35] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-16 02:22:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:22:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 163 ms returned sat
[2023-03-16 02:22:35] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 1 ms to minimize.
[2023-03-16 02:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-16 02:22:35] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 111 ms.
[2023-03-16 02:22:35] [INFO ] Added : 0 causal constraints over 0 iterations in 196 ms. Result :sat
Minimization took 264 ms.
[2023-03-16 02:22:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:36] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-16 02:22:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:36] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-16 02:22:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 340 ms returned sat
[2023-03-16 02:22:37] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 1 ms to minimize.
[2023-03-16 02:22:37] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 1 ms to minimize.
[2023-03-16 02:22:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2023-03-16 02:22:37] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 106 ms.
[2023-03-16 02:22:37] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[2, 3]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 42 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 46 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:22:38] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:38] [INFO ] Invariant cache hit.
[2023-03-16 02:22:38] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-16 02:22:38] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:38] [INFO ] Invariant cache hit.
[2023-03-16 02:22:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:22:39] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
[2023-03-16 02:22:40] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-16 02:22:40] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:40] [INFO ] Invariant cache hit.
[2023-03-16 02:22:41] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2987 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:41] [INFO ] Computed 3 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 10157 resets, run finished after 1824 ms. (steps per millisecond=548 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 1950 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1970 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 2) seen :2
[2023-03-16 02:22:44] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:44] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-16 02:22:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:45] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-16 02:22:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:45] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-16 02:22:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:22:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 02:22:48] [INFO ] [Nat]Added 116 Read/Feed constraints in 3574 ms returned sat
[2023-03-16 02:22:49] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 1 ms to minimize.
[2023-03-16 02:22:49] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 0 ms to minimize.
[2023-03-16 02:22:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2023-03-16 02:22:49] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 108 ms.
[2023-03-16 02:22:49] [INFO ] Added : 0 causal constraints over 0 iterations in 194 ms. Result :sat
Minimization took 194 ms.
[2023-03-16 02:22:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:50] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-16 02:22:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:50] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-16 02:22:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 362 ms returned sat
[2023-03-16 02:22:51] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 1 ms to minimize.
[2023-03-16 02:22:51] [INFO ] Deduced a trap composed of 67 places in 298 ms of which 1 ms to minimize.
[2023-03-16 02:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 660 ms
[2023-03-16 02:22:51] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 111 ms.
[2023-03-16 02:22:51] [INFO ] Added : 0 causal constraints over 0 iterations in 192 ms. Result :sat
Minimization took 296 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[3, 3]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 35 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 44 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:22:52] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:52] [INFO ] Invariant cache hit.
[2023-03-16 02:22:52] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-16 02:22:52] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:52] [INFO ] Invariant cache hit.
[2023-03-16 02:22:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:22:54] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2023-03-16 02:22:54] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-16 02:22:54] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:22:54] [INFO ] Invariant cache hit.
[2023-03-16 02:22:55] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2802 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:55] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 10188 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 1957 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1935 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 2) seen :3
[2023-03-16 02:22:58] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:22:58] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-16 02:22:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:58] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-16 02:22:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:22:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:22:59] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-16 02:22:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 02:23:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 3649 ms returned sat
[2023-03-16 02:23:03] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 1 ms to minimize.
[2023-03-16 02:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-16 02:23:03] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 92 ms.
[2023-03-16 02:23:03] [INFO ] Added : 0 causal constraints over 0 iterations in 178 ms. Result :sat
Minimization took 441 ms.
[2023-03-16 02:23:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:04] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-16 02:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:04] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-16 02:23:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 288 ms returned sat
[2023-03-16 02:23:05] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 0 ms to minimize.
[2023-03-16 02:23:05] [INFO ] Deduced a trap composed of 78 places in 300 ms of which 1 ms to minimize.
[2023-03-16 02:23:05] [INFO ] Deduced a trap composed of 80 places in 230 ms of which 0 ms to minimize.
[2023-03-16 02:23:05] [INFO ] Deduced a trap composed of 83 places in 245 ms of which 1 ms to minimize.
[2023-03-16 02:23:06] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 0 ms to minimize.
[2023-03-16 02:23:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1404 ms
[2023-03-16 02:23:06] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 109 ms.
[2023-03-16 02:23:06] [INFO ] Added : 0 causal constraints over 0 iterations in 191 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[3, 4]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 35 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:06] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:06] [INFO ] Invariant cache hit.
[2023-03-16 02:23:07] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-16 02:23:07] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:07] [INFO ] Invariant cache hit.
[2023-03-16 02:23:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:08] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2023-03-16 02:23:08] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-16 02:23:08] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:08] [INFO ] Invariant cache hit.
[2023-03-16 02:23:09] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2536 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:09] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 10230 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 1938 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1955 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 2) seen :3
[2023-03-16 02:23:12] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:12] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-16 02:23:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:12] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-16 02:23:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:13] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-16 02:23:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 02:23:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 3737 ms returned sat
[2023-03-16 02:23:17] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 105 ms.
[2023-03-16 02:23:17] [INFO ] Added : 0 causal constraints over 0 iterations in 191 ms. Result :sat
Minimization took 310 ms.
[2023-03-16 02:23:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:17] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-16 02:23:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:18] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-16 02:23:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 299 ms returned sat
[2023-03-16 02:23:18] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 0 ms to minimize.
[2023-03-16 02:23:19] [INFO ] Deduced a trap composed of 78 places in 265 ms of which 1 ms to minimize.
[2023-03-16 02:23:19] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 1 ms to minimize.
[2023-03-16 02:23:19] [INFO ] Deduced a trap composed of 83 places in 237 ms of which 2 ms to minimize.
[2023-03-16 02:23:19] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 0 ms to minimize.
[2023-03-16 02:23:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1351 ms
[2023-03-16 02:23:19] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 105 ms.
[2023-03-16 02:23:20] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[3, 4]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:20] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:20] [INFO ] Invariant cache hit.
[2023-03-16 02:23:20] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-16 02:23:20] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:20] [INFO ] Invariant cache hit.
[2023-03-16 02:23:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:22] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-16 02:23:22] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-16 02:23:22] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:22] [INFO ] Invariant cache hit.
[2023-03-16 02:23:23] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2617 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:23] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 10003 steps, including 103 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-16 02:23:23] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:23] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 02:23:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:23] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-16 02:23:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:23] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-16 02:23:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 168 ms returned sat
[2023-03-16 02:23:24] [INFO ] Deduced a trap composed of 70 places in 255 ms of which 0 ms to minimize.
[2023-03-16 02:23:24] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 1 ms to minimize.
[2023-03-16 02:23:24] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2023-03-16 02:23:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 661 ms
[2023-03-16 02:23:24] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 117 ms.
[2023-03-16 02:23:24] [INFO ] Added : 0 causal constraints over 0 iterations in 197 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:25] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000002 steps, including 10161 resets, run finished after 1719 ms. (steps per millisecond=581 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1960 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 1) seen :2
[2023-03-16 02:23:27] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:27] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-16 02:23:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:28] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-16 02:23:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:28] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-16 02:23:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 169 ms returned sat
[2023-03-16 02:23:28] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 0 ms to minimize.
[2023-03-16 02:23:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-16 02:23:28] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-16 02:23:29] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:29] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:29] [INFO ] Invariant cache hit.
[2023-03-16 02:23:29] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-16 02:23:29] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:29] [INFO ] Invariant cache hit.
[2023-03-16 02:23:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:31] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2023-03-16 02:23:31] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-16 02:23:31] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:31] [INFO ] Invariant cache hit.
[2023-03-16 02:23:32] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2791 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:32] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 10177 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 1935 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 1) seen :2
[2023-03-16 02:23:34] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:34] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 02:23:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:35] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-16 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:35] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-03-16 02:23:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 168 ms returned sat
[2023-03-16 02:23:35] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 1 ms to minimize.
[2023-03-16 02:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-16 02:23:35] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 109 ms.
[2023-03-16 02:23:36] [INFO ] Added : 0 causal constraints over 0 iterations in 192 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:36] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:36] [INFO ] Invariant cache hit.
[2023-03-16 02:23:36] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-16 02:23:36] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:36] [INFO ] Invariant cache hit.
[2023-03-16 02:23:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:38] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2023-03-16 02:23:38] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-16 02:23:38] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:38] [INFO ] Invariant cache hit.
[2023-03-16 02:23:39] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2761 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 16186 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:39] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 104 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
[2023-03-16 02:23:39] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:39] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-16 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 02:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:39] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-16 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:40] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-16 02:23:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:40] [INFO ] [Nat]Added 116 Read/Feed constraints in 266 ms returned sat
[2023-03-16 02:23:40] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 1 ms to minimize.
[2023-03-16 02:23:40] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 0 ms to minimize.
[2023-03-16 02:23:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 671 ms
[2023-03-16 02:23:41] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 104 ms.
[2023-03-16 02:23:41] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:41] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000005 steps, including 10135 resets, run finished after 1726 ms. (steps per millisecond=579 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1938 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :3
[2023-03-16 02:23:44] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:44] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 02:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:44] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-16 02:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 02:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:44] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-16 02:23:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 362 ms returned sat
[2023-03-16 02:23:45] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 0 ms to minimize.
[2023-03-16 02:23:45] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 1 ms to minimize.
[2023-03-16 02:23:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 626 ms
[2023-03-16 02:23:45] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 102 ms.
[2023-03-16 02:23:45] [INFO ] Added : 0 causal constraints over 0 iterations in 185 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:46] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:46] [INFO ] Invariant cache hit.
[2023-03-16 02:23:46] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-16 02:23:46] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:46] [INFO ] Invariant cache hit.
[2023-03-16 02:23:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:47] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2023-03-16 02:23:48] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-16 02:23:48] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:48] [INFO ] Invariant cache hit.
[2023-03-16 02:23:48] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2592 ms. Remains : 143/143 places, 1704/1704 transitions.
Normalized transition count is 1161 out of 1704 initially.
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:48] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 10149 resets, run finished after 1701 ms. (steps per millisecond=587 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1944 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :3
[2023-03-16 02:23:51] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2023-03-16 02:23:51] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-16 02:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:51] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-16 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 02:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:23:51] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-16 02:23:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 358 ms returned sat
[2023-03-16 02:23:52] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 0 ms to minimize.
[2023-03-16 02:23:52] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 1 ms to minimize.
[2023-03-16 02:23:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 653 ms
[2023-03-16 02:23:53] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 103 ms.
[2023-03-16 02:23:53] [INFO ] Added : 0 causal constraints over 0 iterations in 184 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 37 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 02:23:53] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:53] [INFO ] Invariant cache hit.
[2023-03-16 02:23:54] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-16 02:23:54] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:54] [INFO ] Invariant cache hit.
[2023-03-16 02:23:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 02:23:55] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2023-03-16 02:23:55] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-16 02:23:55] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2023-03-16 02:23:55] [INFO ] Invariant cache hit.
[2023-03-16 02:23:56] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2749 ms. Remains : 143/143 places, 1704/1704 transitions.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 17138 ms.
[2023-03-16 02:23:56] [INFO ] Flatten gal took : 262 ms
[2023-03-16 02:23:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-16 02:23:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1704 transitions and 6880 arcs took 12 ms.
Total runtime 94983 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 --maxsum=/tmp/793/ub_0_ --maxsum=/tmp/793/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15441316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094224 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 UpperBounds -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="DoubleLock-PT-p2s2"
export BK_EXAMINATION="UpperBounds"
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 DoubleLock-PT-p2s2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418800541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;