fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for Philosophers-PT-010000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13895.688 3227444.00 3511016.00 16599.00 10000 10000 10000 10000 5000 10000 10000 10000 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.r299-tall-167873952700269.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 smartxred
Input is Philosophers-PT-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873952700269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 321M
-rw-r--r-- 1 mcc users 11M Feb 26 03:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52M Feb 26 03:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Feb 25 19:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M Feb 25 19:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9M Feb 26 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47M Feb 26 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14M Feb 26 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79M Feb 26 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22M 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 Philosophers-PT-010000-UpperBounds-00
FORMULA_NAME Philosophers-PT-010000-UpperBounds-01
FORMULA_NAME Philosophers-PT-010000-UpperBounds-02
FORMULA_NAME Philosophers-PT-010000-UpperBounds-03
FORMULA_NAME Philosophers-PT-010000-UpperBounds-04
FORMULA_NAME Philosophers-PT-010000-UpperBounds-05
FORMULA_NAME Philosophers-PT-010000-UpperBounds-06
FORMULA_NAME Philosophers-PT-010000-UpperBounds-07
FORMULA_NAME Philosophers-PT-010000-UpperBounds-08
FORMULA_NAME Philosophers-PT-010000-UpperBounds-09
FORMULA_NAME Philosophers-PT-010000-UpperBounds-10
FORMULA_NAME Philosophers-PT-010000-UpperBounds-11
FORMULA_NAME Philosophers-PT-010000-UpperBounds-12
FORMULA_NAME Philosophers-PT-010000-UpperBounds-13
FORMULA_NAME Philosophers-PT-010000-UpperBounds-14
FORMULA_NAME Philosophers-PT-010000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679468629374

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-010000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 07:03:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 07:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:03:52] [INFO ] Load time of PNML (sax parser for PT used): 972 ms
[2023-03-22 07:03:52] [INFO ] Transformed 50000 places.
[2023-03-22 07:03:52] [INFO ] Transformed 50000 transitions.
[2023-03-22 07:03:52] [INFO ] Parsed PT model containing 50000 places and 50000 transitions and 160000 arcs in 1382 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18666 ms.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:04:12] [INFO ] Computed 20000 place invariants in 303 ms
FORMULA Philosophers-PT-010000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 4904 steps, including 1 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 7174
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5021 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5283 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5091 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5247 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5210 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5102 ms. (steps per millisecond=1 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2508 ms. (steps per millisecond=3 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2571 ms. (steps per millisecond=3 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2389 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
[2023-03-22 07:05:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[1399, 1358, 1399, 1358, 261, 1399, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 494 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:06:06] [INFO ] Invariant cache hit.
Interrupted random walk after 4719 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 9570
FORMULA Philosophers-PT-010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5315 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5234 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5204 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5236 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5268 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5282 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5213 ms. (steps per millisecond=4 ) properties seen 3
FORMULA Philosophers-PT-010000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 07:07:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000, 1] Max seen :[1822, 1816, 1822, 1816, 471, 1822, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 286 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:08:13] [INFO ] Invariant cache hit.
Interrupted random walk after 5118 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen 10062
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5060 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5283 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5274 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5247 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5123 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5409 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 22002 steps, including 0 resets, run timeout after 5189 ms. (steps per millisecond=4 ) properties seen 3
FORMULA Philosophers-PT-010000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 07:09:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1907, 1901, 1907, 1901, 539, 1907]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 249 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:10:10] [INFO ] Invariant cache hit.
Finished random walk after 5432 steps, including 0 resets, run visited all 6 properties in 30004 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5360 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5419 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5082 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5087 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5095 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5069 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-22 07:11:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1942, 1945, 1942, 1945, 636, 1942]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 261 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 230 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 07:12:03] [INFO ] Invariant cache hit.
[2023-03-22 07:12:07] [INFO ] Implicit Places using invariants in 3705 ms returned []
Implicit Place search using SMT only with invariants took 3706 ms to find 0 implicit places.
[2023-03-22 07:12:07] [INFO ] Invariant cache hit.
[2023-03-22 07:12:10] [INFO ] Dead Transitions using invariants and state equation in 3674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7615 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:12:10] [INFO ] Invariant cache hit.
Finished random walk after 5356 steps, including 0 resets, run visited all 6 properties in 30004 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5496 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5429 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5048 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5047 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5481 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-22 07:13:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[1975, 1945, 1975, 1945, 636, 1975]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 228 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 215 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 07:14:03] [INFO ] Invariant cache hit.
[2023-03-22 07:14:07] [INFO ] Implicit Places using invariants in 3680 ms returned []
Implicit Place search using SMT only with invariants took 3681 ms to find 0 implicit places.
[2023-03-22 07:14:07] [INFO ] Invariant cache hit.
[2023-03-22 07:14:11] [INFO ] Dead Transitions using invariants and state equation in 3631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7529 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:14:11] [INFO ] Invariant cache hit.
Finished random walk after 5306 steps, including 0 resets, run visited all 6 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5355 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5473 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5534 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5479 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5410 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5415 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-22 07:15:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[2021, 1945, 2021, 1945, 636, 2021]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 244 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 249 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 07:16:05] [INFO ] Invariant cache hit.
[2023-03-22 07:16:09] [INFO ] Implicit Places using invariants in 3671 ms returned []
Implicit Place search using SMT only with invariants took 3680 ms to find 0 implicit places.
[2023-03-22 07:16:09] [INFO ] Invariant cache hit.
[2023-03-22 07:16:12] [INFO ] Dead Transitions using invariants and state equation in 3698 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7629 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 07:16:12] [INFO ] Invariant cache hit.
Finished random walk after 4968 steps, including 0 resets, run visited all 6 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5487 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5565 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5533 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5072 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5057 ms. (steps per millisecond=1 ) properties seen 3
[2023-03-22 07:17:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[2021, 1945, 2021, 1945, 636, 2021]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 235 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 237 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 07:18:05] [INFO ] Invariant cache hit.
[2023-03-22 07:18:09] [INFO ] Implicit Places using invariants in 3638 ms returned []
Implicit Place search using SMT only with invariants took 3640 ms to find 0 implicit places.
[2023-03-22 07:18:09] [INFO ] Invariant cache hit.
[2023-03-22 07:18:13] [INFO ] Dead Transitions using invariants and state equation in 3699 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7578 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-00
[2023-03-22 07:18:13] [INFO ] Invariant cache hit.
Finished random walk after 7352 steps, including 2 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5532 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
[2023-03-22 07:18:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1372]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 18763 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18764 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:19:12] [INFO ] Computed 20000 place invariants in 58 ms
Finished random walk after 11610 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5020 ms. (steps per millisecond=1 )
[2023-03-22 07:19:47] [INFO ] Invariant cache hit.
[2023-03-22 07:20:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 41322 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6065]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 175 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 159 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:20:33] [INFO ] Invariant cache hit.
[2023-03-22 07:20:35] [INFO ] Implicit Places using invariants in 2635 ms returned []
Implicit Place search using SMT only with invariants took 2640 ms to find 0 implicit places.
[2023-03-22 07:20:35] [INFO ] Invariant cache hit.
[2023-03-22 07:20:38] [INFO ] Dead Transitions using invariants and state equation in 2539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5343 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:20:38] [INFO ] Invariant cache hit.
Finished random walk after 11455 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5075 ms. (steps per millisecond=1 )
[2023-03-22 07:21:13] [INFO ] Invariant cache hit.
[2023-03-22 07:21:58] [INFO ] [Real]Absence check using 20000 positive place invariants in 41219 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6065]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 145 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:21:59] [INFO ] Invariant cache hit.
[2023-03-22 07:22:01] [INFO ] Implicit Places using invariants in 2310 ms returned []
Implicit Place search using SMT only with invariants took 2311 ms to find 0 implicit places.
[2023-03-22 07:22:01] [INFO ] Invariant cache hit.
[2023-03-22 07:22:03] [INFO ] Dead Transitions using invariants and state equation in 2348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4799 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-00 in 230566 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:22:03] [INFO ] Computed 20000 place invariants in 150 ms
Finished random walk after 7835 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5109 ms. (steps per millisecond=1 )
[2023-03-22 07:22:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1432]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 6 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 17067 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17069 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:23:01] [INFO ] Computed 20000 place invariants in 51 ms
Finished random walk after 11939 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5241 ms. (steps per millisecond=1 )
[2023-03-22 07:23:36] [INFO ] Invariant cache hit.
[2023-03-22 07:24:21] [INFO ] [Real]Absence check using 20000 positive place invariants in 41208 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6260]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 155 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 134 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:24:21] [INFO ] Invariant cache hit.
[2023-03-22 07:24:24] [INFO ] Implicit Places using invariants in 2241 ms returned []
Implicit Place search using SMT only with invariants took 2247 ms to find 0 implicit places.
[2023-03-22 07:24:24] [INFO ] Invariant cache hit.
[2023-03-22 07:24:26] [INFO ] Dead Transitions using invariants and state equation in 2278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4663 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:24:26] [INFO ] Invariant cache hit.
Finished random walk after 11979 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5180 ms. (steps per millisecond=1 )
[2023-03-22 07:25:01] [INFO ] Invariant cache hit.
[2023-03-22 07:25:46] [INFO ] [Real]Absence check using 20000 positive place invariants in 41167 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6260]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 137 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:25:47] [INFO ] Invariant cache hit.
[2023-03-22 07:25:49] [INFO ] Implicit Places using invariants in 2276 ms returned []
Implicit Place search using SMT only with invariants took 2277 ms to find 0 implicit places.
[2023-03-22 07:25:49] [INFO ] Invariant cache hit.
[2023-03-22 07:25:51] [INFO ] Dead Transitions using invariants and state equation in 2270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4679 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-01 in 228016 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-02
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:25:51] [INFO ] Computed 20000 place invariants in 137 ms
Finished random walk after 7837 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5255 ms. (steps per millisecond=1 )
[2023-03-22 07:26:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1441]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 19609 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19614 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:26:51] [INFO ] Computed 20000 place invariants in 48 ms
Finished random walk after 12108 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5238 ms. (steps per millisecond=1 )
[2023-03-22 07:27:27] [INFO ] Invariant cache hit.
[2023-03-22 07:28:12] [INFO ] [Real]Absence check using 20000 positive place invariants in 41271 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6305]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 153 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:28:12] [INFO ] Invariant cache hit.
[2023-03-22 07:28:14] [INFO ] Implicit Places using invariants in 2262 ms returned []
Implicit Place search using SMT only with invariants took 2270 ms to find 0 implicit places.
[2023-03-22 07:28:14] [INFO ] Invariant cache hit.
[2023-03-22 07:28:17] [INFO ] Dead Transitions using invariants and state equation in 2215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4640 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:28:17] [INFO ] Invariant cache hit.
Finished random walk after 12083 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5149 ms. (steps per millisecond=1 )
[2023-03-22 07:28:52] [INFO ] Invariant cache hit.
[2023-03-22 07:29:37] [INFO ] [Real]Absence check using 20000 positive place invariants in 41352 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6392]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 156 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 143 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:29:37] [INFO ] Invariant cache hit.
[2023-03-22 07:29:40] [INFO ] Implicit Places using invariants in 2263 ms returned []
Implicit Place search using SMT only with invariants took 2266 ms to find 0 implicit places.
[2023-03-22 07:29:40] [INFO ] Invariant cache hit.
[2023-03-22 07:29:42] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4683 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:29:42] [INFO ] Invariant cache hit.
Finished random walk after 12034 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5209 ms. (steps per millisecond=1 )
[2023-03-22 07:30:17] [INFO ] Invariant cache hit.
[2023-03-22 07:31:02] [INFO ] [Real]Absence check using 20000 positive place invariants in 41319 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6427]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 157 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:31:03] [INFO ] Invariant cache hit.
[2023-03-22 07:31:05] [INFO ] Implicit Places using invariants in 2225 ms returned []
Implicit Place search using SMT only with invariants took 2226 ms to find 0 implicit places.
[2023-03-22 07:31:05] [INFO ] Invariant cache hit.
[2023-03-22 07:31:07] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4656 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:31:07] [INFO ] Invariant cache hit.
Finished random walk after 11961 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5173 ms. (steps per millisecond=1 )
[2023-03-22 07:31:42] [INFO ] Invariant cache hit.
[2023-03-22 07:32:27] [INFO ] [Real]Absence check using 20000 positive place invariants in 41294 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6427]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 155 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:32:28] [INFO ] Invariant cache hit.
[2023-03-22 07:32:30] [INFO ] Implicit Places using invariants in 2270 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
[2023-03-22 07:32:30] [INFO ] Invariant cache hit.
[2023-03-22 07:32:33] [INFO ] Dead Transitions using invariants and state equation in 2554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4955 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-02 in 401418 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:32:33] [INFO ] Computed 20000 place invariants in 131 ms
Finished random walk after 7571 steps, including 2 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5298 ms. (steps per millisecond=1 )
[2023-03-22 07:33:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1403]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 9 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 16837 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16838 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:33:30] [INFO ] Computed 20000 place invariants in 48 ms
Finished random walk after 11847 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5281 ms. (steps per millisecond=1 )
[2023-03-22 07:34:05] [INFO ] Invariant cache hit.
[2023-03-22 07:34:51] [INFO ] [Real]Absence check using 20000 positive place invariants in 41072 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6238]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 148 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 141 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:34:51] [INFO ] Invariant cache hit.
[2023-03-22 07:34:53] [INFO ] Implicit Places using invariants in 2319 ms returned []
Implicit Place search using SMT only with invariants took 2328 ms to find 0 implicit places.
[2023-03-22 07:34:53] [INFO ] Invariant cache hit.
[2023-03-22 07:34:55] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4729 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:34:56] [INFO ] Invariant cache hit.
Finished random walk after 11894 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5099 ms. (steps per millisecond=1 )
[2023-03-22 07:35:31] [INFO ] Invariant cache hit.
[2023-03-22 07:36:16] [INFO ] [Real]Absence check using 20000 positive place invariants in 41335 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6238]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 141 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 122 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:36:16] [INFO ] Invariant cache hit.
[2023-03-22 07:36:18] [INFO ] Implicit Places using invariants in 2234 ms returned []
Implicit Place search using SMT only with invariants took 2235 ms to find 0 implicit places.
[2023-03-22 07:36:18] [INFO ] Invariant cache hit.
[2023-03-22 07:36:21] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4582 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-03 in 227950 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:36:21] [INFO ] Computed 20000 place invariants in 160 ms
Finished random walk after 8153 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5173 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 07:36:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[265]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 24345 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24346 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:37:25] [INFO ] Computed 20000 place invariants in 64 ms
Finished random walk after 14626 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5114 ms. (steps per millisecond=1 )
[2023-03-22 07:38:01] [INFO ] Invariant cache hit.
[2023-03-22 07:38:42] [INFO ] [Real]Absence check using 20000 positive place invariants in 37485 ms returned sat
[2023-03-22 07:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:38:46] [INFO ] [Real]Absence check using state equation in 3867 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2821]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 124 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:38:46] [INFO ] Invariant cache hit.
[2023-03-22 07:38:48] [INFO ] Implicit Places using invariants in 2220 ms returned []
Implicit Place search using SMT only with invariants took 2221 ms to find 0 implicit places.
[2023-03-22 07:38:48] [INFO ] Invariant cache hit.
[2023-03-22 07:38:51] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4586 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:38:51] [INFO ] Invariant cache hit.
Finished random walk after 14727 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5194 ms. (steps per millisecond=1 )
[2023-03-22 07:39:26] [INFO ] Invariant cache hit.
[2023-03-22 07:40:08] [INFO ] [Real]Absence check using 20000 positive place invariants in 38718 ms returned sat
[2023-03-22 07:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:40:11] [INFO ] [Real]Absence check using state equation in 2626 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2821]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 152 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 127 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:40:11] [INFO ] Invariant cache hit.
[2023-03-22 07:40:14] [INFO ] Implicit Places using invariants in 2266 ms returned []
Implicit Place search using SMT only with invariants took 2266 ms to find 0 implicit places.
[2023-03-22 07:40:14] [INFO ] Invariant cache hit.
[2023-03-22 07:40:16] [INFO ] Dead Transitions using invariants and state equation in 2290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4685 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-04 in 235285 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 07:40:16] [INFO ] Computed 20000 place invariants in 128 ms
Finished random walk after 7876 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5094 ms. (steps per millisecond=1 )
[2023-03-22 07:40:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1367]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 5 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 17716 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17716 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 07:41:14] [INFO ] Computed 20000 place invariants in 42 ms
Finished random walk after 12000 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5107 ms. (steps per millisecond=1 )
[2023-03-22 07:41:49] [INFO ] Invariant cache hit.
[2023-03-22 07:42:34] [INFO ] [Real]Absence check using 20000 positive place invariants in 41318 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6226]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:42:35] [INFO ] Invariant cache hit.
[2023-03-22 07:42:37] [INFO ] Implicit Places using invariants in 2289 ms returned []
Implicit Place search using SMT only with invariants took 2290 ms to find 0 implicit places.
[2023-03-22 07:42:37] [INFO ] Invariant cache hit.
[2023-03-22 07:42:39] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4623 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:42:39] [INFO ] Invariant cache hit.
Finished random walk after 12112 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5146 ms. (steps per millisecond=1 )
[2023-03-22 07:43:14] [INFO ] Invariant cache hit.
[2023-03-22 07:43:59] [INFO ] [Real]Absence check using 20000 positive place invariants in 41332 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6275]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 138 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 116 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:44:00] [INFO ] Invariant cache hit.
[2023-03-22 07:44:02] [INFO ] Implicit Places using invariants in 2208 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
[2023-03-22 07:44:02] [INFO ] Invariant cache hit.
[2023-03-22 07:44:04] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4563 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:44:04] [INFO ] Invariant cache hit.
Finished random walk after 12177 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5084 ms. (steps per millisecond=1 )
[2023-03-22 07:44:39] [INFO ] Invariant cache hit.
[2023-03-22 07:45:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 41183 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6344]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 143 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:45:25] [INFO ] Invariant cache hit.
[2023-03-22 07:45:27] [INFO ] Implicit Places using invariants in 2229 ms returned []
Implicit Place search using SMT only with invariants took 2230 ms to find 0 implicit places.
[2023-03-22 07:45:27] [INFO ] Invariant cache hit.
[2023-03-22 07:45:29] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4603 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 07:45:29] [INFO ] Invariant cache hit.
Finished random walk after 11905 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5241 ms. (steps per millisecond=1 )
[2023-03-22 07:46:05] [INFO ] Invariant cache hit.
[2023-03-22 07:46:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 41303 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6344]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 132 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 07:46:50] [INFO ] Invariant cache hit.
[2023-03-22 07:46:52] [INFO ] Implicit Places using invariants in 2284 ms returned []
Implicit Place search using SMT only with invariants took 2290 ms to find 0 implicit places.
[2023-03-22 07:46:52] [INFO ] Invariant cache hit.
[2023-03-22 07:46:55] [INFO ] Dead Transitions using invariants and state equation in 2231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4672 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-07 in 398688 ms.
[2023-03-22 07:46:57] [INFO ] Flatten gal took : 1733 ms
[2023-03-22 07:46:57] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 27 ms.
[2023-03-22 07:46:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50000 places, 50000 transitions and 160000 arcs took 181 ms.
Total runtime 2586088 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Philosophers (PT), instance 010000
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 50000 places, 50000 transitions, 160000 arcs.
Final Score: 410410.98
Took : 427 seconds
Bounds file is: UpperBounds.xml
FORMULA Philosophers-PT-010000-UpperBounds-00 10000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Philosophers-PT-010000-UpperBounds-01 10000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Philosophers-PT-010000-UpperBounds-02 10000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Philosophers-PT-010000-UpperBounds-03 10000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Philosophers-PT-010000-UpperBounds-04 5000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Philosophers-PT-010000-UpperBounds-07 10000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679471856818

--------------------
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

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="Philosophers-PT-010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Philosophers-PT-010000, 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 r299-tall-167873952700269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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