fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814478100309
Last Updated
May 14, 2023

About the Execution of LoLa+red for DBSingleClientW-PT-d2m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1084.420 67332.00 116176.00 499.70 1 0 0 0 3 0 0 0 0 1 0 1 0 1 0 0 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.r103-tall-167814478100309.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 lolaxred
Input is DBSingleClientW-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478100309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678245699798

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:21:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 03:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:21:41] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-08 03:21:41] [INFO ] Transformed 4763 places.
[2023-03-08 03:21:41] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:21:41] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 03:21:41] [INFO ] Computed 6 place invariants in 154 ms
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 885 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
[2023-03-08 03:21:42] [INFO ] Invariant cache hit.
[2023-03-08 03:21:42] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-08 03:21:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 03:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:43] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2023-03-08 03:21:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:21:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:21:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-08 03:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:44] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-08 03:21:44] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 03:21:46] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1469 ms returned sat
[2023-03-08 03:21:46] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 648 ms.
[2023-03-08 03:21:47] [INFO ] Added : 12 causal constraints over 3 iterations in 1296 ms. Result :sat
Minimization took 925 ms.
[2023-03-08 03:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:21:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:49] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-08 03:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:21:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 03:21:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2023-03-08 03:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:50] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-08 03:21:50] [INFO ] [Nat]Added 1588 Read/Feed constraints in 695 ms returned sat
[2023-03-08 03:21:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 458 ms.
[2023-03-08 03:21:51] [INFO ] Added : 6 causal constraints over 2 iterations in 804 ms. Result :sat
Minimization took 1742 ms.
[2023-03-08 03:21:53] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 03:21:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:54] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2023-03-08 03:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:21:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:21:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 03:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:55] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2023-03-08 03:21:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1489 ms returned sat
[2023-03-08 03:21:57] [INFO ] Deduced a trap composed of 121 places in 612 ms of which 7 ms to minimize.
[2023-03-08 03:21:57] [INFO ] Deduced a trap composed of 128 places in 560 ms of which 2 ms to minimize.
[2023-03-08 03:21:58] [INFO ] Deduced a trap composed of 119 places in 590 ms of which 2 ms to minimize.
[2023-03-08 03:21:59] [INFO ] Deduced a trap composed of 129 places in 574 ms of which 3 ms to minimize.
[2023-03-08 03:21:59] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2710 ms
[2023-03-08 03:21:59] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 03:21:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 03:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:21:59] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-08 03:22:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:22:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 03:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:00] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2023-03-08 03:22:02] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1403 ms returned sat
[2023-03-08 03:22:02] [INFO ] Deduced a trap composed of 32 places in 643 ms of which 1 ms to minimize.
[2023-03-08 03:22:03] [INFO ] Deduced a trap composed of 48 places in 621 ms of which 1 ms to minimize.
[2023-03-08 03:22:04] [INFO ] Deduced a trap composed of 422 places in 553 ms of which 1 ms to minimize.
[2023-03-08 03:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2846 ms
[2023-03-08 03:22:05] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-08 03:22:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:05] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-08 03:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:22:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:06] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-08 03:22:07] [INFO ] [Nat]Added 1588 Read/Feed constraints in 837 ms returned sat
[2023-03-08 03:22:07] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 397 ms.
[2023-03-08 03:22:09] [INFO ] Deduced a trap composed of 32 places in 635 ms of which 1 ms to minimize.
[2023-03-08 03:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 861 ms
[2023-03-08 03:22:09] [INFO ] Added : 15 causal constraints over 4 iterations in 2381 ms. Result :sat
Minimization took 876 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.7 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 603 place count 749 transition count 1205
Iterating global reduction 1 with 388 rules applied. Total rules applied 991 place count 749 transition count 1205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1000 place count 749 transition count 1196
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1312 place count 437 transition count 884
Iterating global reduction 2 with 312 rules applied. Total rules applied 1624 place count 437 transition count 884
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1636 place count 437 transition count 872
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1874 place count 199 transition count 540
Iterating global reduction 3 with 238 rules applied. Total rules applied 2112 place count 199 transition count 540
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2323 place count 199 transition count 329
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2346 place count 176 transition count 291
Iterating global reduction 4 with 23 rules applied. Total rules applied 2369 place count 176 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2375 place count 176 transition count 285
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2390 place count 161 transition count 270
Iterating global reduction 5 with 15 rules applied. Total rules applied 2405 place count 161 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2408 place count 161 transition count 267
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2421 place count 148 transition count 254
Iterating global reduction 6 with 13 rules applied. Total rules applied 2434 place count 148 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2444 place count 148 transition count 244
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2448 place count 144 transition count 228
Iterating global reduction 7 with 4 rules applied. Total rules applied 2452 place count 144 transition count 228
Applied a total of 2452 rules in 226 ms. Remains 144 /1183 variables (removed 1039) and now considering 228/2478 (removed 2250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 144/1183 places, 228/2478 transitions.
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 03:22:11] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229629 resets, run finished after 1503 ms. (steps per millisecond=665 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95446 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95426 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95426 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95585 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95465 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 5) seen :0
[2023-03-08 03:22:16] [INFO ] Invariant cache hit.
[2023-03-08 03:22:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:22:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:16] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:22:16] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:16] [INFO ] [Nat]Added 89 Read/Feed constraints in 36 ms returned sat
[2023-03-08 03:22:16] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 17 ms.
[2023-03-08 03:22:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-08 03:22:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-08 03:22:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-08 03:22:16] [INFO ] Added : 21 causal constraints over 5 iterations in 293 ms. Result :sat
Minimization took 59 ms.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:17] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Nat]Added 89 Read/Feed constraints in 13 ms returned sat
[2023-03-08 03:22:17] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 03:22:17] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-08 03:22:17] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-08 03:22:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-08 03:22:17] [INFO ] Added : 11 causal constraints over 3 iterations in 269 ms. Result :sat
Minimization took 65 ms.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:17] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Nat]Added 89 Read/Feed constraints in 26 ms returned sat
[2023-03-08 03:22:17] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:22:17] [INFO ] Added : 14 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 43 ms.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:17] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:22:18] [INFO ] [Nat]Added 89 Read/Feed constraints in 19 ms returned sat
[2023-03-08 03:22:18] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 13 ms.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2023-03-08 03:22:18] [INFO ] Added : 21 causal constraints over 6 iterations in 284 ms. Result :sat
Minimization took 52 ms.
[2023-03-08 03:22:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:18] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:22:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:22:18] [INFO ] [Nat]Added 89 Read/Feed constraints in 16 ms returned sat
[2023-03-08 03:22:18] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-08 03:22:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2023-03-08 03:22:19] [INFO ] Added : 26 causal constraints over 6 iterations in 463 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 24 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 144/144 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-08 03:22:19] [INFO ] Invariant cache hit.
[2023-03-08 03:22:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 03:22:19] [INFO ] Invariant cache hit.
[2023-03-08 03:22:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:19] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-08 03:22:19] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 03:22:19] [INFO ] Invariant cache hit.
[2023-03-08 03:22:19] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 144/144 places, 228/228 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00
[2023-03-08 03:22:19] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 03:22:19] [INFO ] Invariant cache hit.
[2023-03-08 03:22:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:19] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:20] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:22:20] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:20] [INFO ] [Nat]Added 89 Read/Feed constraints in 44 ms returned sat
[2023-03-08 03:22:20] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 03:22:20] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-08 03:22:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-08 03:22:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-08 03:22:20] [INFO ] Added : 21 causal constraints over 5 iterations in 284 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 134 transition count 209
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 134 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 134 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 132 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 130 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 130 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 129 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 39 place count 126 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 42 place count 126 transition count 179
Applied a total of 42 rules in 31 ms. Remains 126 /144 variables (removed 18) and now considering 179/228 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 126/144 places, 179/228 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-08 03:22:20] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229704 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95948 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 1) seen :0
[2023-03-08 03:22:22] [INFO ] Invariant cache hit.
[2023-03-08 03:22:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:22] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:22:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 03:22:22] [INFO ] [Nat]Added 58 Read/Feed constraints in 17 ms returned sat
[2023-03-08 03:22:22] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 12 ms.
[2023-03-08 03:22:22] [INFO ] Added : 17 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 03:22:22] [INFO ] Invariant cache hit.
[2023-03-08 03:22:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 03:22:22] [INFO ] Invariant cache hit.
[2023-03-08 03:22:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 03:22:22] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-08 03:22:22] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 03:22:22] [INFO ] Invariant cache hit.
[2023-03-08 03:22:22] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00 in 3075 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 03:22:22] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 03:22:22] [INFO ] Invariant cache hit.
[2023-03-08 03:22:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:23] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-08 03:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:23] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:23] [INFO ] [Nat]Added 89 Read/Feed constraints in 14 ms returned sat
[2023-03-08 03:22:23] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 13 ms.
[2023-03-08 03:22:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2023-03-08 03:22:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-08 03:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-08 03:22:23] [INFO ] Added : 11 causal constraints over 3 iterations in 267 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 131 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 128 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 128 transition count 178
Applied a total of 38 rules in 25 ms. Remains 128 /144 variables (removed 16) and now considering 178/228 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 128/144 places, 178/228 transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 03:22:23] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229921 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95464 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties (out of 1) seen :0
[2023-03-08 03:22:25] [INFO ] Invariant cache hit.
[2023-03-08 03:22:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:22:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:22:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 03:22:25] [INFO ] [Nat]Added 51 Read/Feed constraints in 9 ms returned sat
[2023-03-08 03:22:25] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 11 ms.
[2023-03-08 03:22:25] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-08 03:22:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-08 03:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2023-03-08 03:22:25] [INFO ] Added : 21 causal constraints over 5 iterations in 252 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 17 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 03:22:25] [INFO ] Invariant cache hit.
[2023-03-08 03:22:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:22:25] [INFO ] Invariant cache hit.
[2023-03-08 03:22:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 03:22:25] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-08 03:22:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 03:22:26] [INFO ] Invariant cache hit.
[2023-03-08 03:22:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 3147 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 03:22:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2350 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 03:22:26] [INFO ] Invariant cache hit.
[2023-03-08 03:22:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:26] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:26] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 03:22:26] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:26] [INFO ] [Nat]Added 89 Read/Feed constraints in 26 ms returned sat
[2023-03-08 03:22:26] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:22:26] [INFO ] Added : 14 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 133 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 133 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 131 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 131 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 130 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 130 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 130 transition count 201
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 37 place count 127 transition count 181
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 127 transition count 181
Applied a total of 40 rules in 32 ms. Remains 127 /144 variables (removed 17) and now considering 181/228 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 127/144 places, 181/228 transitions.
// Phase 1: matrix 181 rows 127 cols
[2023-03-08 03:22:26] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229794 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96148 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 1) seen :0
[2023-03-08 03:22:28] [INFO ] Invariant cache hit.
[2023-03-08 03:22:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:28] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:22:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:22:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:22:28] [INFO ] [Nat]Added 59 Read/Feed constraints in 13 ms returned sat
[2023-03-08 03:22:28] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 13 ms.
[2023-03-08 03:22:28] [INFO ] Added : 15 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 03:22:28] [INFO ] Invariant cache hit.
[2023-03-08 03:22:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 03:22:28] [INFO ] Invariant cache hit.
[2023-03-08 03:22:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:22:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 03:22:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:22:28] [INFO ] Invariant cache hit.
[2023-03-08 03:22:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 127/127 places, 181/181 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09 in 2850 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 03:22:28] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 03:22:28] [INFO ] Invariant cache hit.
[2023-03-08 03:22:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:29] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:22:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:29] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:22:29] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:29] [INFO ] [Nat]Added 89 Read/Feed constraints in 27 ms returned sat
[2023-03-08 03:22:29] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 13 ms.
[2023-03-08 03:22:29] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-08 03:22:29] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-08 03:22:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-08 03:22:29] [INFO ] Added : 21 causal constraints over 6 iterations in 279 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 132 transition count 200
Applied a total of 28 rules in 17 ms. Remains 132 /144 variables (removed 12) and now considering 200/228 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 132/144 places, 200/228 transitions.
// Phase 1: matrix 200 rows 132 cols
[2023-03-08 03:22:29] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229663 resets, run finished after 1274 ms. (steps per millisecond=784 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96056 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
[2023-03-08 03:22:31] [INFO ] Invariant cache hit.
[2023-03-08 03:22:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 03:22:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:31] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:22:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 03:22:31] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2023-03-08 03:22:31] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 17 ms.
[2023-03-08 03:22:31] [INFO ] Added : 26 causal constraints over 6 iterations in 103 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-08 03:22:31] [INFO ] Invariant cache hit.
[2023-03-08 03:22:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 03:22:31] [INFO ] Invariant cache hit.
[2023-03-08 03:22:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 03:22:32] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 03:22:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 03:22:32] [INFO ] Invariant cache hit.
[2023-03-08 03:22:32] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 132/132 places, 200/200 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11 in 3319 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 03:22:32] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 03:22:32] [INFO ] Invariant cache hit.
[2023-03-08 03:22:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:32] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 03:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:32] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:22:32] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 03:22:32] [INFO ] [Nat]Added 89 Read/Feed constraints in 17 ms returned sat
[2023-03-08 03:22:32] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 03:22:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-08 03:22:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-08 03:22:32] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-08 03:22:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-08 03:22:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2023-03-08 03:22:32] [INFO ] Added : 26 causal constraints over 6 iterations in 450 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 140 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 140 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 136 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 136 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 136 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 133 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 133 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 133 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 130 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 130 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 128 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 128 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 127 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 126 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 126 transition count 185
Applied a total of 42 rules in 23 ms. Remains 126 /144 variables (removed 18) and now considering 185/228 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/144 places, 185/228 transitions.
// Phase 1: matrix 185 rows 126 cols
[2023-03-08 03:22:33] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229873 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95597 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 1) seen :0
[2023-03-08 03:22:34] [INFO ] Invariant cache hit.
[2023-03-08 03:22:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:34] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:22:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:22:34] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:22:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:22:34] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2023-03-08 03:22:34] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 135 transitions) in 12 ms.
[2023-03-08 03:22:34] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 03:22:35] [INFO ] Invariant cache hit.
[2023-03-08 03:22:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 03:22:35] [INFO ] Invariant cache hit.
[2023-03-08 03:22:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 03:22:35] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-08 03:22:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:22:35] [INFO ] Invariant cache hit.
[2023-03-08 03:22:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 126/126 places, 185/185 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13 in 3228 ms.
[2023-03-08 03:22:35] [INFO ] Flatten gal took : 41 ms
[2023-03-08 03:22:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 03:22:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 228 transitions and 900 arcs took 1 ms.
Total runtime 54427 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m06
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
Upper Bounds

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678245767130

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 17 (type EXCL) for 9 DBSingleClientW-PT-d2m06-UpperBounds-11
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 9 DBSingleClientW-PT-d2m06-UpperBounds-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 9 DBSingleClientW-PT-d2m06-UpperBounds-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type FNDP) for 6 DBSingleClientW-PT-d2m06-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 17 (type EXCL) for DBSingleClientW-PT-d2m06-UpperBounds-11
lola: markings : 2142
lola: fired transitions : 2277
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for DBSingleClientW-PT-d2m06-UpperBounds-11 (obsolete)
lola: CANCELED task # 16 (type EQUN) for DBSingleClientW-PT-d2m06-UpperBounds-11 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 12 DBSingleClientW-PT-d2m06-UpperBounds-13
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 3 DBSingleClientW-PT-d2m06-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 3 DBSingleClientW-PT-d2m06-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 29 (type EXCL) for DBSingleClientW-PT-d2m06-UpperBounds-13
lola: markings : 422
lola: fired transitions : 433
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 26 (type EXCL) for 0 DBSingleClientW-PT-d2m06-UpperBounds-00
lola: time limit : 1200 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/367/UpperBounds-16.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/367/UpperBounds-22.sara.
lola: Structural Bound: 1
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 26 (type EXCL) for DBSingleClientW-PT-d2m06-UpperBounds-00
lola: markings : 5398
lola: fired transitions : 5789
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 23 (type EXCL) for 3 DBSingleClientW-PT-d2m06-UpperBounds-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
sara: warning, failure of lp_solve (at job 4)
lola: Structural Bound: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m06-UpperBounds-00: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-11: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-13: BOUND 1 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m06-UpperBounds-04: BOUND 0 0 3 0 1 0 0 0
DBSingleClientW-PT-d2m06-UpperBounds-09: BOUND 0 2 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 BOUND FNDP 5/1800 0/5 DBSingleClientW-PT-d2m06-UpperBounds-09 1049384 t fired, 117126 attempts, .
21 BOUND FNDP 5/3600 0/5 DBSingleClientW-PT-d2m06-UpperBounds-04 967050 t fired, 108041 attempts, .
22 BOUND STEQ 5/3600 0/5 DBSingleClientW-PT-d2m06-UpperBounds-04 --
23 BOUND EXCL 5/1800 4/32 DBSingleClientW-PT-d2m06-UpperBounds-04 857510 m, 171502 m/sec, 1329476 t fired, result in [3,6] .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 4 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m06-UpperBounds-00: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-11: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-13: BOUND 1 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m06-UpperBounds-04: BOUND 0 0 3 0 1 0 0 0
DBSingleClientW-PT-d2m06-UpperBounds-09: BOUND 0 2 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 BOUND FNDP 10/1795 0/5 DBSingleClientW-PT-d2m06-UpperBounds-09 2041833 t fired, 227944 attempts, .
21 BOUND FNDP 10/3595 0/5 DBSingleClientW-PT-d2m06-UpperBounds-04 1995981 t fired, 222896 attempts, .
22 BOUND STEQ 10/3595 0/5 DBSingleClientW-PT-d2m06-UpperBounds-04 --
23 BOUND EXCL 10/1800 7/32 DBSingleClientW-PT-d2m06-UpperBounds-04 1673200 m, 163138 m/sec, 2709862 t fired, result in [3,6] .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 4 of 4 Visible: 5
lola: REPORT NUM
lola: FINISHED task # 23 (type EXCL) for DBSingleClientW-PT-d2m06-UpperBounds-04
lola: markings : 1718431
lola: fired transitions : 2779293
lola: time used : 10.000000
lola: memory pages used : 7
lola: CANCELED task # 21 (type FNDP) for DBSingleClientW-PT-d2m06-UpperBounds-04 (obsolete)
lola: CANCELED task # 22 (type EQUN) for DBSingleClientW-PT-d2m06-UpperBounds-04 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 6 DBSingleClientW-PT-d2m06-UpperBounds-09
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type EQUN) for 6 DBSingleClientW-PT-d2m06-UpperBounds-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/367/UpperBounds-19.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 20 (type EXCL) for DBSingleClientW-PT-d2m06-UpperBounds-09
lola: markings : 37229
lola: fired transitions : 42852
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for DBSingleClientW-PT-d2m06-UpperBounds-09 (obsolete)
lola: CANCELED task # 19 (type EQUN) for DBSingleClientW-PT-d2m06-UpperBounds-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m06-UpperBounds-00: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-04: BOUND 3 state space
DBSingleClientW-PT-d2m06-UpperBounds-09: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-11: BOUND 1 state space
DBSingleClientW-PT-d2m06-UpperBounds-13: BOUND 1 state space


Time elapsed: 11 secs. Pages in use: 7

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="DBSingleClientW-PT-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DBSingleClientW-PT-d2m06, 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 r103-tall-167814478100309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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