MCC'2023- Execution of r295-tall-167873947700325

About the Execution of LoLa+red for PhilosophersDyn-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6940.035	635026.00	1124771.00	13603.50	4 2 4 4 10 2 4 2 1 1 1 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.r295-tall-167873947700325.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 PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678825456862

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=PhilosophersDyn-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 20:24:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 20:24:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:24:18] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-14 20:24:18] [INFO ] Transformed 170 places.
[2023-03-14 20:24:18] [INFO ] Transformed 2310 transitions.
[2023-03-14 20:24:18] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:24:18] [INFO ] Computed 39 place invariants in 85 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 15) seen :30
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :22
[2023-03-14 20:24:19] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:24:19] [INFO ] Computed 39 place invariants in 43 ms
[2023-03-14 20:24:19] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2023-03-14 20:24:19] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-14 20:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:19] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2023-03-14 20:24:21] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2023-03-14 20:24:21] [INFO ] [Real]Added 1030 Read/Feed constraints in 212 ms returned sat
[2023-03-14 20:24:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:24:22] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 33 ms returned sat
[2023-03-14 20:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:22] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-14 20:24:22] [INFO ] [Nat]Added 1030 Read/Feed constraints in 191 ms returned sat
[2023-03-14 20:24:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 291 ms.
[2023-03-14 20:24:23] [INFO ] Added : 0 causal constraints over 0 iterations in 474 ms. Result :sat
Minimization took 497 ms.
[2023-03-14 20:24:23] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:23] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-14 20:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:24] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-14 20:24:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-14 20:24:24] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:24] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-14 20:24:24] [INFO ] [Nat]Added 1030 Read/Feed constraints in 270 ms returned sat
[2023-03-14 20:24:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 178 ms.
[2023-03-14 20:24:25] [INFO ] Added : 0 causal constraints over 0 iterations in 329 ms. Result :sat
Minimization took 846 ms.
[2023-03-14 20:24:26] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:26] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:26] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-14 20:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:24:26] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:26] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-14 20:24:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 294 ms returned sat
[2023-03-14 20:24:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 176 ms.
[2023-03-14 20:24:27] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 433 ms.
[2023-03-14 20:24:27] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:27] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:28] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-14 20:24:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:28] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:28] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-14 20:24:28] [INFO ] [Nat]Added 1030 Read/Feed constraints in 222 ms returned sat
[2023-03-14 20:24:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 180 ms.
[2023-03-14 20:24:29] [INFO ] Added : 0 causal constraints over 0 iterations in 317 ms. Result :sat
Minimization took 309 ms.
[2023-03-14 20:24:29] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:24:29] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:29] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-14 20:24:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:30] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:30] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-14 20:24:30] [INFO ] [Nat]Added 1030 Read/Feed constraints in 257 ms returned sat
[2023-03-14 20:24:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 192 ms.
[2023-03-14 20:24:30] [INFO ] Added : 0 causal constraints over 0 iterations in 314 ms. Result :sat
Minimization took 833 ms.
[2023-03-14 20:24:31] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:31] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:32] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-14 20:24:32] [INFO ] [Real]Added 1030 Read/Feed constraints in 180 ms returned sat
[2023-03-14 20:24:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:32] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:32] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:32] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-14 20:24:32] [INFO ] [Nat]Added 1030 Read/Feed constraints in 173 ms returned sat
[2023-03-14 20:24:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 171 ms.
[2023-03-14 20:24:33] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 489 ms.
[2023-03-14 20:24:33] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:24:33] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:34] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-14 20:24:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:24:34] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:24:34] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:24:34] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-14 20:24:34] [INFO ] [Nat]Added 1030 Read/Feed constraints in 185 ms returned sat
[2023-03-14 20:24:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 195 ms.
[2023-03-14 20:24:35] [INFO ] Added : 0 causal constraints over 0 iterations in 327 ms. Result :sat
Minimization took 315 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, -1, 10] Max seen :[4, 2, 4, 4, 2, 4, 2]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 247 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 20:24:38] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2023-03-14 20:24:38] [INFO ] Invariant cache hit.
[2023-03-14 20:24:38] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1080 ms. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:24:39] [INFO ] Computed 39 place invariants in 43 ms
Incomplete random walk after 1000000 steps, including 119333 resets, run finished after 14210 ms. (steps per millisecond=70 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9042 resets, run finished after 2732 ms. (steps per millisecond=366 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9821 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9577 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 7069 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 1000001 steps, including 9822 resets, run finished after 1786 ms. (steps per millisecond=559 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9040 resets, run finished after 2784 ms. (steps per millisecond=359 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000000 steps, including 10005 resets, run finished after 1769 ms. (steps per millisecond=565 ) properties (out of 7) seen :22
[2023-03-14 20:25:07] [INFO ] Invariant cache hit.
[2023-03-14 20:25:07] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:07] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:07] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-14 20:25:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:09] [INFO ] [Real]Added 1010 Read/Feed constraints in 2087 ms returned sat
[2023-03-14 20:25:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 20:25:10] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:10] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-14 20:25:13] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2836 ms returned sat
[2023-03-14 20:25:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2023-03-14 20:25:13] [INFO ] Added : 0 causal constraints over 0 iterations in 279 ms. Result :sat
Minimization took 3002 ms.
[2023-03-14 20:25:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:16] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:16] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-14 20:25:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:17] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-14 20:25:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1792 ms returned sat
[2023-03-14 20:25:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2023-03-14 20:25:19] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Minimization took 3004 ms.
[2023-03-14 20:25:22] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:22] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:22] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-14 20:25:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:25:25] [INFO ] [Real]Added 1010 Read/Feed constraints in 3184 ms returned sat
[2023-03-14 20:25:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:26] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:26] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-14 20:25:27] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1260 ms returned sat
[2023-03-14 20:25:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2023-03-14 20:25:27] [INFO ] Added : 0 causal constraints over 0 iterations in 267 ms. Result :sat
Minimization took 3003 ms.
[2023-03-14 20:25:31] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-14 20:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:31] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-14 20:25:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:31] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-14 20:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:31] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2023-03-14 20:25:33] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1376 ms returned sat
[2023-03-14 20:25:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 152 ms.
[2023-03-14 20:25:33] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 3002 ms.
[2023-03-14 20:25:36] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:36] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-14 20:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:36] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-14 20:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:36] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-14 20:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:37] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-14 20:25:38] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1774 ms returned sat
[2023-03-14 20:25:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2023-03-14 20:25:39] [INFO ] Added : 0 causal constraints over 0 iterations in 269 ms. Result :sat
Minimization took 3003 ms.
[2023-03-14 20:25:42] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:42] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 5 ms returned sat
[2023-03-14 20:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:42] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-14 20:25:44] [INFO ] [Real]Added 1010 Read/Feed constraints in 2083 ms returned sat
[2023-03-14 20:25:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:44] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:45] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-14 20:25:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2821 ms returned sat
[2023-03-14 20:25:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2023-03-14 20:25:48] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 3003 ms.
[2023-03-14 20:25:51] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:51] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:51] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-14 20:25:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:25:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:25:51] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:25:51] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2023-03-14 20:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:25:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6086 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, -1, 10] Max seen :[4, 2, 4, 4, 2, 4, 2]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 139 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 120 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:58] [INFO ] Invariant cache hit.
[2023-03-14 20:25:58] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-14 20:25:58] [INFO ] Invariant cache hit.
[2023-03-14 20:25:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:00] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-03-14 20:26:00] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-14 20:26:00] [INFO ] Invariant cache hit.
[2023-03-14 20:26:00] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2882 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
[2023-03-14 20:26:01] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
[2023-03-14 20:26:01] [INFO ] Invariant cache hit.
[2023-03-14 20:26:01] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:26:01] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:01] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-14 20:26:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:03] [INFO ] [Real]Added 1010 Read/Feed constraints in 2065 ms returned sat
[2023-03-14 20:26:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:26:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:03] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:03] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-14 20:26:06] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2828 ms returned sat
[2023-03-14 20:26:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2023-03-14 20:26:07] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 1515 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 212 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:26:08] [INFO ] Computed 39 place invariants in 41 ms
[2023-03-14 20:26:09] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 890 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:26:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119332 resets, run finished after 12174 ms. (steps per millisecond=82 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9404 resets, run finished after 2589 ms. (steps per millisecond=386 ) properties (out of 1) seen :4
[2023-03-14 20:26:24] [INFO ] Invariant cache hit.
[2023-03-14 20:26:24] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-14 20:26:24] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-14 20:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:24] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-14 20:26:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:26:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 20:26:24] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-14 20:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:25] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-14 20:26:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:26:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6075 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 103 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:26:31] [INFO ] Invariant cache hit.
[2023-03-14 20:26:31] [INFO ] Implicit Places using invariants in 246 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 253 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 197 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:26:31] [INFO ] Computed 29 place invariants in 20 ms
[2023-03-14 20:26:32] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-14 20:26:32] [INFO ] Invariant cache hit.
[2023-03-14 20:26:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:34] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2452 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2997 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:26:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178938 resets, run finished after 16464 ms. (steps per millisecond=60 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2602 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
[2023-03-14 20:26:53] [INFO ] Invariant cache hit.
[2023-03-14 20:26:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 20:26:53] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-14 20:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:53] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-14 20:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:26:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:53] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 9 ms returned sat
[2023-03-14 20:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:26:54] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-14 20:26:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1425 ms returned sat
[2023-03-14 20:26:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 156 ms.
[2023-03-14 20:26:55] [INFO ] Added : 0 causal constraints over 0 iterations in 270 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 94 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 92 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 20:26:58] [INFO ] Invariant cache hit.
[2023-03-14 20:26:59] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-14 20:26:59] [INFO ] Invariant cache hit.
[2023-03-14 20:26:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:01] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2023-03-14 20:27:01] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-14 20:27:01] [INFO ] Invariant cache hit.
[2023-03-14 20:27:01] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3140 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 61007 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:27:02] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
[2023-03-14 20:27:02] [INFO ] Invariant cache hit.
[2023-03-14 20:27:02] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:27:02] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:02] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-14 20:27:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:27:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:27:02] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:02] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-14 20:27:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:04] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1771 ms returned sat
[2023-03-14 20:27:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2023-03-14 20:27:05] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 2553 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 227 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:27:07] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 20:27:08] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 830 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:27:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119274 resets, run finished after 10948 ms. (steps per millisecond=91 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10378 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 1) seen :2
[2023-03-14 20:27:20] [INFO ] Invariant cache hit.
[2023-03-14 20:27:20] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:27:20] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:21] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-14 20:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:27:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:27:21] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:21] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-14 20:27:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:23] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1891 ms returned sat
[2023-03-14 20:27:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 138 ms.
[2023-03-14 20:27:23] [INFO ] Added : 0 causal constraints over 0 iterations in 247 ms. Result :sat
Minimization took 2480 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:27:26] [INFO ] Invariant cache hit.
[2023-03-14 20:27:26] [INFO ] Implicit Places using invariants in 341 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 345 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 199 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:27:27] [INFO ] Computed 29 place invariants in 23 ms
[2023-03-14 20:27:27] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-14 20:27:27] [INFO ] Invariant cache hit.
[2023-03-14 20:27:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:33] [INFO ] Implicit Places using invariants and state equation in 5991 ms returned []
Implicit Place search using SMT with State Equation took 6352 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6991 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:27:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178919 resets, run finished after 15298 ms. (steps per millisecond=65 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1389 ms. (steps per millisecond=719 ) properties (out of 1) seen :2
[2023-03-14 20:27:50] [INFO ] Invariant cache hit.
[2023-03-14 20:27:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:50] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-14 20:27:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:27:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:27:50] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-14 20:27:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:53] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2384 ms returned sat
[2023-03-14 20:27:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 151 ms.
[2023-03-14 20:27:53] [INFO ] Added : 0 causal constraints over 0 iterations in 266 ms. Result :sat
Minimization took 3007 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 99 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 94 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 20:27:56] [INFO ] Invariant cache hit.
[2023-03-14 20:27:57] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-14 20:27:57] [INFO ] Invariant cache hit.
[2023-03-14 20:27:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:03] [INFO ] Implicit Places using invariants and state equation in 6002 ms returned []
Implicit Place search using SMT with State Equation took 6339 ms to find 0 implicit places.
[2023-03-14 20:28:03] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-14 20:28:03] [INFO ] Invariant cache hit.
[2023-03-14 20:28:03] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7071 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 61749 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:28:03] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
[2023-03-14 20:28:03] [INFO ] Invariant cache hit.
[2023-03-14 20:28:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:28:03] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:04] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-14 20:28:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:28:07] [INFO ] [Real]Added 1010 Read/Feed constraints in 3185 ms returned sat
[2023-03-14 20:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:28:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:28:07] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:07] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-14 20:28:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1272 ms returned sat
[2023-03-14 20:28:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 153 ms.
[2023-03-14 20:28:09] [INFO ] Added : 0 causal constraints over 0 iterations in 270 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 204 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:28:12] [INFO ] Computed 39 place invariants in 36 ms
[2023-03-14 20:28:13] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 828 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:28:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119363 resets, run finished after 11004 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1510 ms. (steps per millisecond=662 ) properties (out of 1) seen :4
[2023-03-14 20:28:25] [INFO ] Invariant cache hit.
[2023-03-14 20:28:25] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:28:25] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:26] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-14 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:28:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:28:26] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:26] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-14 20:28:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:28:32] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6081 ms returned unknown
Current structural bounds on expressions (after SMT) : [1294] Max seen :[4]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:28:32] [INFO ] Invariant cache hit.
[2023-03-14 20:28:33] [INFO ] Implicit Places using invariants in 358 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 363 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 91 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 547 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2023-03-14 20:28:33] [INFO ] Computed 29 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 119416 resets, run finished after 10616 ms. (steps per millisecond=94 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 1) seen :4
[2023-03-14 20:28:45] [INFO ] Invariant cache hit.
[2023-03-14 20:28:45] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:28:45] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-14 20:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:45] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-14 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:28:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:28:45] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-14 20:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:28:46] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-14 20:28:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:28:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6084 ms returned unknown
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:28:52] [INFO ] Invariant cache hit.
[2023-03-14 20:28:52] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-14 20:28:52] [INFO ] Invariant cache hit.
[2023-03-14 20:28:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:59] [INFO ] Implicit Places using invariants and state equation in 6424 ms returned []
Implicit Place search using SMT with State Equation took 6745 ms to find 0 implicit places.
[2023-03-14 20:28:59] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-14 20:28:59] [INFO ] Invariant cache hit.
[2023-03-14 20:28:59] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7447 ms. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 55946 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:28:59] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :4
[2023-03-14 20:28:59] [INFO ] Invariant cache hit.
[2023-03-14 20:28:59] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:28:59] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:00] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-14 20:29:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:29:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:29:00] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:00] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2023-03-14 20:29:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1392 ms returned sat
[2023-03-14 20:29:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2023-03-14 20:29:02] [INFO ] Added : 0 causal constraints over 0 iterations in 281 ms. Result :sat
Minimization took 2984 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:29:05] [INFO ] Invariant cache hit.
[2023-03-14 20:29:05] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-14 20:29:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119322 resets, run finished after 10748 ms. (steps per millisecond=93 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7083 resets, run finished after 1209 ms. (steps per millisecond=827 ) properties (out of 1) seen :4
[2023-03-14 20:29:17] [INFO ] Invariant cache hit.
[2023-03-14 20:29:17] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:29:17] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:18] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-14 20:29:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:29:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:29:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:18] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-14 20:29:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1364 ms returned sat
[2023-03-14 20:29:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 155 ms.
[2023-03-14 20:29:20] [INFO ] Added : 0 causal constraints over 0 iterations in 265 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:29:23] [INFO ] Invariant cache hit.
[2023-03-14 20:29:23] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-14 20:29:23] [INFO ] Invariant cache hit.
[2023-03-14 20:29:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:30] [INFO ] Implicit Places using invariants and state equation in 6804 ms returned []
Implicit Place search using SMT with State Equation took 7145 ms to find 0 implicit places.
[2023-03-14 20:29:30] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-14 20:29:30] [INFO ] Invariant cache hit.
[2023-03-14 20:29:31] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7862 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 31504 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
[2023-03-14 20:29:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
[2023-03-14 20:29:31] [INFO ] Invariant cache hit.
[2023-03-14 20:29:31] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:29:31] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:31] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-14 20:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:29:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:29:31] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:32] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-14 20:29:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:33] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1774 ms returned sat
[2023-03-14 20:29:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2023-03-14 20:29:34] [INFO ] Added : 0 causal constraints over 0 iterations in 279 ms. Result :sat
Minimization took 2524 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 200 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:29:36] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-14 20:29:37] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 805 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:29:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119272 resets, run finished after 10850 ms. (steps per millisecond=92 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10353 resets, run finished after 1417 ms. (steps per millisecond=705 ) properties (out of 1) seen :2
[2023-03-14 20:29:49] [INFO ] Invariant cache hit.
[2023-03-14 20:29:49] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:29:49] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:50] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-14 20:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:29:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:29:50] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:29:50] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-14 20:29:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1853 ms returned sat
[2023-03-14 20:29:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 150 ms.
[2023-03-14 20:29:52] [INFO ] Added : 0 causal constraints over 0 iterations in 261 ms. Result :sat
Minimization took 2459 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 92 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:29:55] [INFO ] Invariant cache hit.
[2023-03-14 20:29:55] [INFO ] Implicit Places using invariants in 349 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 352 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 187 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:29:56] [INFO ] Computed 29 place invariants in 26 ms
[2023-03-14 20:29:56] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-14 20:29:56] [INFO ] Invariant cache hit.
[2023-03-14 20:29:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:30:02] [INFO ] Implicit Places using invariants and state equation in 6021 ms returned []
Implicit Place search using SMT with State Equation took 6381 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7013 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:30:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178990 resets, run finished after 15214 ms. (steps per millisecond=65 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 1) seen :2
[2023-03-14 20:30:18] [INFO ] Invariant cache hit.
[2023-03-14 20:30:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:30:19] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-14 20:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:19] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-14 20:30:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:30:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:30:19] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-14 20:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:19] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-14 20:30:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:30:22] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2374 ms returned sat
[2023-03-14 20:30:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 143 ms.
[2023-03-14 20:30:22] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Minimization took 2993 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 92 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 91 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 20:30:25] [INFO ] Invariant cache hit.
[2023-03-14 20:30:26] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-14 20:30:26] [INFO ] Invariant cache hit.
[2023-03-14 20:30:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:30:32] [INFO ] Implicit Places using invariants and state equation in 5992 ms returned []
Implicit Place search using SMT with State Equation took 6336 ms to find 0 implicit places.
[2023-03-14 20:30:32] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-14 20:30:32] [INFO ] Invariant cache hit.
[2023-03-14 20:30:32] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7084 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 61551 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:30:32] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
[2023-03-14 20:30:32] [INFO ] Invariant cache hit.
[2023-03-14 20:30:32] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:30:32] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:33] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-14 20:30:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:30:35] [INFO ] [Real]Added 1010 Read/Feed constraints in 2073 ms returned sat
[2023-03-14 20:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:30:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:30:35] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:35] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-14 20:30:38] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2800 ms returned sat
[2023-03-14 20:30:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 157 ms.
[2023-03-14 20:30:38] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Minimization took 1548 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 189 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:30:40] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 20:30:41] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:30:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119362 resets, run finished after 12202 ms. (steps per millisecond=81 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9406 resets, run finished after 2571 ms. (steps per millisecond=388 ) properties (out of 1) seen :4
[2023-03-14 20:30:56] [INFO ] Invariant cache hit.
[2023-03-14 20:30:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:30:56] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-14 20:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:56] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-14 20:30:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:30:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:30:56] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:30:56] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-14 20:30:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:30:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:31:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6077 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 95 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 89 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:31:02] [INFO ] Invariant cache hit.
[2023-03-14 20:31:03] [INFO ] Implicit Places using invariants in 212 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 218 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 184 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:31:03] [INFO ] Computed 29 place invariants in 24 ms
[2023-03-14 20:31:03] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-14 20:31:03] [INFO ] Invariant cache hit.
[2023-03-14 20:31:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:31:05] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2931 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:31:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 179058 resets, run finished after 16592 ms. (steps per millisecond=60 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2624 ms. (steps per millisecond=381 ) properties (out of 1) seen :4
[2023-03-14 20:31:25] [INFO ] Invariant cache hit.
[2023-03-14 20:31:25] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 20:31:25] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-14 20:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:25] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-14 20:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:31:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:31:25] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 9 ms returned sat
[2023-03-14 20:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:25] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-14 20:31:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:31:27] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1453 ms returned sat
[2023-03-14 20:31:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 153 ms.
[2023-03-14 20:31:27] [INFO ] Added : 0 causal constraints over 0 iterations in 265 ms. Result :sat
Minimization took 3009 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 96 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 86 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 20:31:30] [INFO ] Invariant cache hit.
[2023-03-14 20:31:30] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-14 20:31:30] [INFO ] Invariant cache hit.
[2023-03-14 20:31:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:31:33] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2023-03-14 20:31:33] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-14 20:31:33] [INFO ] Invariant cache hit.
[2023-03-14 20:31:33] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3072 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 60951 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:31:33] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-14 20:31:33] [INFO ] Invariant cache hit.
[2023-03-14 20:31:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:31:33] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:34] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-14 20:31:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:31:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:31:34] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:34] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-14 20:31:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:31:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:31:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4628 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:31:39] [INFO ] Invariant cache hit.
[2023-03-14 20:31:39] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 664 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-14 20:31:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119370 resets, run finished after 11168 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10003 resets, run finished after 1505 ms. (steps per millisecond=664 ) properties (out of 1) seen :2
[2023-03-14 20:31:52] [INFO ] Invariant cache hit.
[2023-03-14 20:31:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:31:52] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:52] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-14 20:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:31:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:31:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:31:53] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-14 20:31:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:31:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:31:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6094 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:31:59] [INFO ] Invariant cache hit.
[2023-03-14 20:32:00] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-14 20:32:00] [INFO ] Invariant cache hit.
[2023-03-14 20:32:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:32:06] [INFO ] Implicit Places using invariants and state equation in 6785 ms returned []
Implicit Place search using SMT with State Equation took 7117 ms to find 0 implicit places.
[2023-03-14 20:32:06] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-14 20:32:06] [INFO ] Invariant cache hit.
[2023-03-14 20:32:07] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7845 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 33752 ms.
[2023-03-14 20:32:07] [INFO ] Flatten gal took : 244 ms
[2023-03-14 20:32:07] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-14 20:32:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 13 ms.
Total runtime 469532 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-PT-10
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
Upper Bounds

FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-01 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-00 4 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678826091888

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 23 (type EXCL) for 12 PhilosophersDyn-PT-10-UpperBounds-05
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 12 PhilosophersDyn-PT-10-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 12 PhilosophersDyn-PT-10-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/377/UpperBounds-22.sara.
lola: Structural Bound: 10
lola: LAUNCH task # 24 (type FNDP) for 3 PhilosophersDyn-PT-10-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 4/897 0/5 PhilosophersDyn-PT-10-UpperBounds-05 5562 t fired, 651 attempts, .
22 BOUND STEQ 4/897 0/5 PhilosophersDyn-PT-10-UpperBounds-05 --
23 BOUND EXCL 4/359 1/32 PhilosophersDyn-PT-10-UpperBounds-05 21617 m, 4323 m/sec, 56579 t fired, result in [2,10] .
24 BOUND FNDP 4/897 0/5 PhilosophersDyn-PT-10-UpperBounds-01 22473 t fired, 2595 attempts, .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 9/712 0/5 PhilosophersDyn-PT-10-UpperBounds-05 45366 t fired, 5245 attempts, .
22 BOUND STEQ 9/712 0/5 PhilosophersDyn-PT-10-UpperBounds-05 --
23 BOUND EXCL 9/359 1/32 PhilosophersDyn-PT-10-UpperBounds-05 63059 m, 8288 m/sec, 171859 t fired, result in [2,10] .
24 BOUND FNDP 9/892 0/5 PhilosophersDyn-PT-10-UpperBounds-01 61715 t fired, 7110 attempts, .

Time elapsed: 10 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 14/710 0/5 PhilosophersDyn-PT-10-UpperBounds-05 90645 t fired, 10453 attempts, .
22 BOUND STEQ 14/710 0/5 PhilosophersDyn-PT-10-UpperBounds-05 --
23 BOUND EXCL 14/359 1/32 PhilosophersDyn-PT-10-UpperBounds-05 108570 m, 9102 m/sec, 306687 t fired, result in [2,10] .
24 BOUND FNDP 14/890 0/5 PhilosophersDyn-PT-10-UpperBounds-01 107769 t fired, 12425 attempts, .

Time elapsed: 15 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 19/705 0/5 PhilosophersDyn-PT-10-UpperBounds-05 136461 t fired, 15717 attempts, .
22 BOUND STEQ 19/705 0/5 PhilosophersDyn-PT-10-UpperBounds-05 --
23 BOUND EXCL 19/359 1/32 PhilosophersDyn-PT-10-UpperBounds-05 154456 m, 9177 m/sec, 442960 t fired, result in [2,10] .
24 BOUND FNDP 19/885 0/5 PhilosophersDyn-PT-10-UpperBounds-01 154211 t fired, 17796 attempts, .

Time elapsed: 20 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 23 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-05
lola: markings : 180883
lola: fired transitions : 521146
lola: time used : 22.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for PhilosophersDyn-PT-10-UpperBounds-05 (obsolete)
lola: CANCELED task # 22 (type EQUN) for PhilosophersDyn-PT-10-UpperBounds-05 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 18 PhilosophersDyn-PT-10-UpperBounds-07
lola: time limit : 397 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 15 PhilosophersDyn-PT-10-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 15 PhilosophersDyn-PT-10-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 10
sara: try reading problem file /home/mcc/execution/377/UpperBounds-28.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 24/877 0/5 PhilosophersDyn-PT-10-UpperBounds-01 196510 t fired, 22660 attempts, .
27 BOUND FNDP 2/894 0/5 PhilosophersDyn-PT-10-UpperBounds-06 15671 t fired, 2271 attempts, .
28 BOUND STEQ 2/894 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 2/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 15525 m, 3105 m/sec, 38137 t fired, result in [2,10] .

Time elapsed: 25 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 29/875 0/5 PhilosophersDyn-PT-10-UpperBounds-01 232941 t fired, 26840 attempts, .
27 BOUND FNDP 7/892 0/5 PhilosophersDyn-PT-10-UpperBounds-06 51354 t fired, 7178 attempts, .
28 BOUND STEQ 7/892 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 7/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 51653 m, 7225 m/sec, 133296 t fired, result in [2,10] .

Time elapsed: 30 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 34/870 0/5 PhilosophersDyn-PT-10-UpperBounds-01 270002 t fired, 31120 attempts, .
27 BOUND FNDP 12/887 0/5 PhilosophersDyn-PT-10-UpperBounds-06 88110 t fired, 12225 attempts, .
28 BOUND STEQ 12/887 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 12/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 87570 m, 7183 m/sec, 234420 t fired, result in [2,10] .

Time elapsed: 35 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 39/865 0/5 PhilosophersDyn-PT-10-UpperBounds-01 305047 t fired, 35162 attempts, .
27 BOUND FNDP 17/882 0/5 PhilosophersDyn-PT-10-UpperBounds-06 125345 t fired, 17251 attempts, .
28 BOUND STEQ 17/882 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 17/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 123837 m, 7253 m/sec, 337689 t fired, result in [2,10] .

Time elapsed: 40 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 44/860 0/5 PhilosophersDyn-PT-10-UpperBounds-01 341557 t fired, 39374 attempts, .
27 BOUND FNDP 22/877 0/5 PhilosophersDyn-PT-10-UpperBounds-06 161237 t fired, 22085 attempts, .
28 BOUND STEQ 22/877 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 22/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 160011 m, 7234 m/sec, 442417 t fired, result in [2,10] .

Time elapsed: 45 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 3 0 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 49/855 0/5 PhilosophersDyn-PT-10-UpperBounds-01 378128 t fired, 43623 attempts, .
27 BOUND FNDP 27/872 0/5 PhilosophersDyn-PT-10-UpperBounds-06 197362 t fired, 26925 attempts, .
28 BOUND STEQ 27/872 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
41 BOUND EXCL 27/397 1/32 PhilosophersDyn-PT-10-UpperBounds-07 197586 m, 7515 m/sec, 554101 t fired, result in [2,10] .

Time elapsed: 50 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 41 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-07
lola: markings : 199051
lola: fired transitions : 559892
lola: time used : 27.000000
lola: memory pages used : 1
lola: LAUNCH task # 38 (type EXCL) for 6 PhilosophersDyn-PT-10-UpperBounds-02
lola: time limit : 507 sec
lola: memory limit: 32 pages
lola: Structural Bound: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 2 1 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 54/1150 0/5 PhilosophersDyn-PT-10-UpperBounds-01 412926 t fired, 47629 attempts, .
27 BOUND FNDP 32/1165 0/5 PhilosophersDyn-PT-10-UpperBounds-06 229908 t fired, 31241 attempts, .
28 BOUND STEQ 32/867 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
38 BOUND EXCL 5/507 1/32 PhilosophersDyn-PT-10-UpperBounds-02 37156 m, 7431 m/sec, 84014 t fired, result in [4,10] .

Time elapsed: 55 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 2 1 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 59/1145 0/5 PhilosophersDyn-PT-10-UpperBounds-01 443693 t fired, 51177 attempts, .
27 BOUND FNDP 37/1160 0/5 PhilosophersDyn-PT-10-UpperBounds-06 263942 t fired, 35776 attempts, .
28 BOUND STEQ 37/862 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
38 BOUND EXCL 10/507 1/32 PhilosophersDyn-PT-10-UpperBounds-02 66348 m, 5838 m/sec, 157431 t fired, result in [4,10] .

Time elapsed: 60 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 2 1 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 64/1140 0/5 PhilosophersDyn-PT-10-UpperBounds-01 482530 t fired, 55702 attempts, .
27 BOUND FNDP 42/1155 0/5 PhilosophersDyn-PT-10-UpperBounds-06 301884 t fired, 40853 attempts, .
28 BOUND STEQ 42/857 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
38 BOUND EXCL 15/507 1/32 PhilosophersDyn-PT-10-UpperBounds-02 104241 m, 7578 m/sec, 255996 t fired, result in [4,10] .

Time elapsed: 65 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 0 2 1 0 0 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 69/1135 0/5 PhilosophersDyn-PT-10-UpperBounds-01 519983 t fired, 60047 attempts, .
27 BOUND FNDP 47/1150 0/5 PhilosophersDyn-PT-10-UpperBounds-06 336324 t fired, 45429 attempts, .
28 BOUND STEQ 47/852 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
38 BOUND EXCL 20/507 1/32 PhilosophersDyn-PT-10-UpperBounds-02 142675 m, 7686 m/sec, 359504 t fired, result in [4,10] .

Time elapsed: 70 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 38 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-02
lola: markings : 157396
lola: fired transitions : 398527
lola: time used : 22.000000
lola: memory pages used : 1
lola: LAUNCH task # 32 (type EXCL) for 9 PhilosophersDyn-PT-10-UpperBounds-03
lola: time limit : 705 sec
lola: memory limit: 32 pages
lola: Structural Bound: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 74/1728 0/5 PhilosophersDyn-PT-10-UpperBounds-01 556744 t fired, 64298 attempts, .
27 BOUND FNDP 52/1143 0/5 PhilosophersDyn-PT-10-UpperBounds-06 376134 t fired, 50720 attempts, .
28 BOUND STEQ 52/1143 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
32 BOUND EXCL 3/705 1/32 PhilosophersDyn-PT-10-UpperBounds-03 22232 m, 4446 m/sec, 62922 t fired, result in [4,10] .

Time elapsed: 75 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 79/1725 0/5 PhilosophersDyn-PT-10-UpperBounds-01 594128 t fired, 68642 attempts, .
27 BOUND FNDP 57/1140 0/5 PhilosophersDyn-PT-10-UpperBounds-06 413948 t fired, 55727 attempts, .
28 BOUND STEQ 57/1140 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
32 BOUND EXCL 8/705 1/32 PhilosophersDyn-PT-10-UpperBounds-03 58569 m, 7267 m/sec, 170137 t fired, result in [4,10] .

Time elapsed: 80 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 84/1720 0/5 PhilosophersDyn-PT-10-UpperBounds-01 630893 t fired, 72936 attempts, .
27 BOUND FNDP 62/1135 0/5 PhilosophersDyn-PT-10-UpperBounds-06 450764 t fired, 60620 attempts, .
28 BOUND STEQ 62/1135 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
32 BOUND EXCL 13/705 1/32 PhilosophersDyn-PT-10-UpperBounds-03 93687 m, 7023 m/sec, 278234 t fired, result in [4,10] .

Time elapsed: 85 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 89/1715 0/5 PhilosophersDyn-PT-10-UpperBounds-01 668022 t fired, 77278 attempts, .
27 BOUND FNDP 67/1130 0/5 PhilosophersDyn-PT-10-UpperBounds-06 487654 t fired, 65492 attempts, .
28 BOUND STEQ 67/1130 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
32 BOUND EXCL 18/705 1/32 PhilosophersDyn-PT-10-UpperBounds-03 130914 m, 7445 m/sec, 394092 t fired, result in [4,10] .

Time elapsed: 90 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 0 2 1 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 94/1710 0/5 PhilosophersDyn-PT-10-UpperBounds-01 705648 t fired, 81704 attempts, .
27 BOUND FNDP 72/1125 0/5 PhilosophersDyn-PT-10-UpperBounds-06 524212 t fired, 70327 attempts, .
28 BOUND STEQ 72/1125 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
32 BOUND EXCL 23/705 1/32 PhilosophersDyn-PT-10-UpperBounds-03 164961 m, 6809 m/sec, 499576 t fired, result in [4,10] .

Time elapsed: 95 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 32 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-03
lola: markings : 169831
lola: fired transitions : 516097
lola: time used : 24.000000
lola: memory pages used : 1
lola: LAUNCH task # 26 (type EXCL) for 3 PhilosophersDyn-PT-10-UpperBounds-01
lola: time limit : 876 sec
lola: memory limit: 32 pages
lola: Structural Bound: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 99/1704 0/5 PhilosophersDyn-PT-10-UpperBounds-01 740899 t fired, 85832 attempts, .
26 BOUND EXCL 4/876 1/32 PhilosophersDyn-PT-10-UpperBounds-01 31486 m, 6297 m/sec, 83604 t fired, result in [2,10] .
27 BOUND FNDP 77/1715 0/5 PhilosophersDyn-PT-10-UpperBounds-06 562381 t fired, 75378 attempts, .
28 BOUND STEQ 77/1715 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --

Time elapsed: 100 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 104/1700 0/5 PhilosophersDyn-PT-10-UpperBounds-01 778137 t fired, 90234 attempts, .
26 BOUND EXCL 9/876 1/32 PhilosophersDyn-PT-10-UpperBounds-01 66391 m, 6981 m/sec, 182025 t fired, result in [2,10] .
27 BOUND FNDP 82/1711 0/5 PhilosophersDyn-PT-10-UpperBounds-06 599999 t fired, 80383 attempts, .
28 BOUND STEQ 82/1711 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --

Time elapsed: 105 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 109/1695 0/5 PhilosophersDyn-PT-10-UpperBounds-01 814934 t fired, 94549 attempts, .
26 BOUND EXCL 14/876 1/32 PhilosophersDyn-PT-10-UpperBounds-01 103148 m, 7351 m/sec, 290563 t fired, result in [2,10] .
27 BOUND FNDP 87/1706 0/5 PhilosophersDyn-PT-10-UpperBounds-06 636527 t fired, 85257 attempts, .
28 BOUND STEQ 87/1706 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --

Time elapsed: 110 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 114/1690 0/5 PhilosophersDyn-PT-10-UpperBounds-01 852040 t fired, 98905 attempts, .
26 BOUND EXCL 19/876 1/32 PhilosophersDyn-PT-10-UpperBounds-01 140357 m, 7441 m/sec, 401098 t fired, result in [2,10] .
27 BOUND FNDP 92/1701 0/5 PhilosophersDyn-PT-10-UpperBounds-06 672830 t fired, 90075 attempts, .
28 BOUND STEQ 92/1701 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --

Time elapsed: 115 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
24 BOUND FNDP 119/1685 0/5 PhilosophersDyn-PT-10-UpperBounds-01 887983 t fired, 103142 attempts, .
26 BOUND EXCL 24/876 1/32 PhilosophersDyn-PT-10-UpperBounds-01 177143 m, 7357 m/sec, 509966 t fired, result in [2,10] .
27 BOUND FNDP 97/1696 0/5 PhilosophersDyn-PT-10-UpperBounds-06 709911 t fired, 94999 attempts, .
28 BOUND STEQ 97/1696 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --

Time elapsed: 120 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 26 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-01
lola: markings : 180883
lola: fired transitions : 521146
lola: time used : 25.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for PhilosophersDyn-PT-10-UpperBounds-01 (obsolete)
lola: LAUNCH task # 35 (type EXCL) for 0 PhilosophersDyn-PT-10-UpperBounds-00
lola: time limit : 1159 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 0 PhilosophersDyn-PT-10-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 102/3479 0/5 PhilosophersDyn-PT-10-UpperBounds-06 748823 t fired, 100178 attempts, .
28 BOUND STEQ 102/3479 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
33 BOUND FNDP 4/1739 0/5 PhilosophersDyn-PT-10-UpperBounds-00 32854 t fired, 4650 attempts, .
35 BOUND EXCL 4/1159 1/32 PhilosophersDyn-PT-10-UpperBounds-00 32767 m, 6553 m/sec, 74967 t fired, result in [4,10] .

Time elapsed: 125 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 107/3475 0/5 PhilosophersDyn-PT-10-UpperBounds-06 786284 t fired, 105141 attempts, .
28 BOUND STEQ 107/3475 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
33 BOUND FNDP 9/1735 0/5 PhilosophersDyn-PT-10-UpperBounds-00 69509 t fired, 9685 attempts, .
35 BOUND EXCL 9/1159 1/32 PhilosophersDyn-PT-10-UpperBounds-00 70896 m, 7625 m/sec, 172391 t fired, result in [4,10] .

Time elapsed: 130 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 112/3470 0/5 PhilosophersDyn-PT-10-UpperBounds-06 824074 t fired, 110194 attempts, .
28 BOUND STEQ 112/3470 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
33 BOUND FNDP 14/1730 0/5 PhilosophersDyn-PT-10-UpperBounds-00 105083 t fired, 14542 attempts, .
35 BOUND EXCL 14/1159 1/32 PhilosophersDyn-PT-10-UpperBounds-00 109057 m, 7632 m/sec, 273526 t fired, result in [4,10] .

Time elapsed: 135 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 0 1 2 0 1 0 0 0
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 1 2 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 117/3465 0/5 PhilosophersDyn-PT-10-UpperBounds-06 861486 t fired, 115211 attempts, .
28 BOUND STEQ 117/3465 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
33 BOUND FNDP 19/1725 0/5 PhilosophersDyn-PT-10-UpperBounds-00 143530 t fired, 19724 attempts, .
35 BOUND EXCL 19/1159 1/32 PhilosophersDyn-PT-10-UpperBounds-00 146962 m, 7581 m/sec, 376186 t fired, result in [4,10] .

Time elapsed: 140 secs. Pages in use: 1
# running tasks: 4 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 35 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-00
lola: markings : 158206
lola: fired transitions : 406413
lola: time used : 20.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for PhilosophersDyn-PT-10-UpperBounds-00 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 15 PhilosophersDyn-PT-10-UpperBounds-06
lola: time limit : 1729 sec
lola: memory limit: 32 pages
lola: Structural Bound: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 0 3 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 122/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 906938 t fired, 121282 attempts, .
28 BOUND STEQ 122/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
29 BOUND EXCL 4/1729 1/32 PhilosophersDyn-PT-10-UpperBounds-06 36800 m, 7360 m/sec, 84727 t fired, result in [4,10] .

Time elapsed: 145 secs. Pages in use: 1
# running tasks: 3 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 0 3 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 127/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 954042 t fired, 127592 attempts, .
28 BOUND STEQ 127/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
29 BOUND EXCL 9/1729 1/32 PhilosophersDyn-PT-10-UpperBounds-06 86615 m, 9963 m/sec, 213861 t fired, result in [4,10] .

Time elapsed: 150 secs. Pages in use: 1
# running tasks: 3 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 0 0 3 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 132/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 1001191 t fired, 133921 attempts, .
28 BOUND STEQ 132/3577 0/5 PhilosophersDyn-PT-10-UpperBounds-06 --
29 BOUND EXCL 14/1729 1/32 PhilosophersDyn-PT-10-UpperBounds-06 135885 m, 9854 m/sec, 346468 t fired, result in [4,10] .

Time elapsed: 155 secs. Pages in use: 1
# running tasks: 3 of 4 Visible: 7
lola: REPORT NUM
lola: FINISHED task # 29 (type EXCL) for PhilosophersDyn-PT-10-UpperBounds-06
lola: markings : 158206
lola: fired transitions : 406413
lola: time used : 16.000000
lola: memory pages used : 1
lola: CANCELED task # 27 (type FNDP) for PhilosophersDyn-PT-10-UpperBounds-06 (obsolete)
lola: CANCELED task # 28 (type EQUN) for PhilosophersDyn-PT-10-UpperBounds-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-UpperBounds-00: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-01: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-02: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-03: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-05: BOUND 2 state space
PhilosophersDyn-PT-10-UpperBounds-06: BOUND 4 state space
PhilosophersDyn-PT-10-UpperBounds-07: BOUND 2 state space

Time elapsed: 157 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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 r295-tall-167873947700325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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