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

About the Execution of 2022-gold for Philosophers-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10119.668 3600000.00 3891184.00 34590.10 ? ? ? ? ? 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.r319-tall-167873969900034.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 gold2022
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 r319-tall-167873969900034
=====================================================================

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

Running Version 202205111006
[2023-03-15 08:46:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 08:46:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:46:55] [INFO ] Load time of PNML (sax parser for PT used): 1503 ms
[2023-03-15 08:46:55] [INFO ] Transformed 50000 places.
[2023-03-15 08:46:55] [INFO ] Transformed 50000 transitions.
[2023-03-15 08:46:55] [INFO ] Parsed PT model containing 50000 places and 50000 transitions in 1885 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15654 ms.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:47:11] [INFO ] Computed 20000 place invariants in 306 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 5397 steps, including 1 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen 7191
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5096 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5379 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5332 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5048 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5092 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5119 ms. (steps per millisecond=1 ) properties seen 3
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2709 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 2486 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2425 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:48:20] [INFO ] Computed 20000 place invariants in 212 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[1409, 1359, 1409, 1359, 246, 1409, 0, 0, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 551 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:49:06] [INFO ] Computed 20000 place invariants in 116 ms
Interrupted random walk after 5381 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen 10604
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5101 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5181 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5299 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5089 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5089 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5273 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5171 ms. (steps per millisecond=4 ) properties seen 3
FORMULA Philosophers-PT-010000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 21002 steps, including 0 resets, run timeout after 5113 ms. (steps per millisecond=4 ) properties seen 3
FORMULA Philosophers-PT-010000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:50:18] [INFO ] Computed 20000 place invariants in 173 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000, 1] Max seen :[2027, 1980, 2027, 1980, 563, 2027, 0]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 334 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:51:20] [INFO ] Computed 20000 place invariants in 173 ms
Interrupted random walk after 5440 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 10396
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5539 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5173 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5065 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5052 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5115 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5272 ms. (steps per millisecond=1 ) properties seen 3
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=3 ) properties seen 3
FORMULA Philosophers-PT-010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:52:27] [INFO ] Computed 20000 place invariants in 163 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[2027, 1980, 2027, 1980, 621, 2027]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 255 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:53:20] [INFO ] Computed 20000 place invariants in 174 ms
Finished random walk after 5134 steps, including 0 resets, run visited all 6 properties in 30005 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 12001 steps, including 0 resets, run timeout after 5379 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5169 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5202 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5185 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5264 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5111 ms. (steps per millisecond=2 ) properties seen 3
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:54:21] [INFO ] Computed 20000 place invariants in 138 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 10000, 10000] Max seen :[2027, 1980, 2027, 1980, 621, 2027]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 341 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 321 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:55:14] [INFO ] Computed 20000 place invariants in 117 ms
[2023-03-15 08:55:18] [INFO ] Implicit Places using invariants in 4195 ms returned []
Implicit Place search using SMT only with invariants took 4196 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:55:19] [INFO ] Computed 20000 place invariants in 149 ms
[2023-03-15 08:55:23] [INFO ] Dead Transitions using invariants and state equation in 4089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-00
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:55:23] [INFO ] Computed 20000 place invariants in 116 ms
Finished random walk after 7679 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5390 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 08:55:58] [INFO ] Computed 20000 place invariants in 134 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1468]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 12 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 24095 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:56:28] [INFO ] Computed 20000 place invariants in 39 ms
Finished random walk after 11736 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 5156 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:57:03] [INFO ] Computed 20000 place invariants in 51 ms
[2023-03-15 08:57:48] [INFO ] [Real]Absence check using 20000 positive place invariants in 41061 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6076]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:57:48] [INFO ] Computed 20000 place invariants in 33 ms
[2023-03-15 08:57:51] [INFO ] Implicit Places using invariants in 2322 ms returned []
Implicit Place search using SMT only with invariants took 2329 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:57:51] [INFO ] Computed 20000 place invariants in 33 ms
[2023-03-15 08:57:53] [INFO ] Dead Transitions using invariants and state equation in 2621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:57:53] [INFO ] Computed 20000 place invariants in 47 ms
Finished random walk after 11874 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 5190 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:58:29] [INFO ] Computed 20000 place invariants in 58 ms
[2023-03-15 08:59:14] [INFO ] [Real]Absence check using 20000 positive place invariants in 41167 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6165]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:59:14] [INFO ] Computed 20000 place invariants in 45 ms
[2023-03-15 08:59:16] [INFO ] Implicit Places using invariants in 2355 ms returned []
Implicit Place search using SMT only with invariants took 2363 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:59:16] [INFO ] Computed 20000 place invariants in 34 ms
[2023-03-15 08:59:19] [INFO ] Dead Transitions using invariants and state equation in 2468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:59:19] [INFO ] Computed 20000 place invariants in 39 ms
Finished random walk after 11793 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 5543 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 08:59:55] [INFO ] Computed 20000 place invariants in 40 ms
[2023-03-15 09:00:40] [INFO ] [Real]Absence check using 20000 positive place invariants in 40884 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6184]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 129 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:00:40] [INFO ] Computed 20000 place invariants in 39 ms
[2023-03-15 09:00:42] [INFO ] Implicit Places using invariants in 2303 ms returned []
Implicit Place search using SMT only with invariants took 2332 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:00:42] [INFO ] Computed 20000 place invariants in 42 ms
[2023-03-15 09:00:45] [INFO ] Dead Transitions using invariants and state equation in 2313 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:00:45] [INFO ] Computed 20000 place invariants in 34 ms
Finished random walk after 11905 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 5569 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:01:20] [INFO ] Computed 20000 place invariants in 39 ms
[2023-03-15 09:02:05] [INFO ] [Real]Absence check using 20000 positive place invariants in 41055 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6335]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 216 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 189 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:02:06] [INFO ] Computed 20000 place invariants in 61 ms
[2023-03-15 09:02:09] [INFO ] Implicit Places using invariants in 2714 ms returned []
Implicit Place search using SMT only with invariants took 2715 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:02:09] [INFO ] Computed 20000 place invariants in 59 ms
[2023-03-15 09:02:11] [INFO ] Dead Transitions using invariants and state equation in 2511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:02:11] [INFO ] Computed 20000 place invariants in 63 ms
Finished random walk after 11528 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 5665 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:02:47] [INFO ] Computed 20000 place invariants in 36 ms
[2023-03-15 09:03:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 40868 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6335]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 154 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 125 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:03:32] [INFO ] Computed 20000 place invariants in 58 ms
[2023-03-15 09:03:35] [INFO ] Implicit Places using invariants in 2707 ms returned []
Implicit Place search using SMT only with invariants took 2711 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:03:35] [INFO ] Computed 20000 place invariants in 53 ms
[2023-03-15 09:03:38] [INFO ] Dead Transitions using invariants and state equation in 2638 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-00 in 495136 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:03:38] [INFO ] Computed 20000 place invariants in 130 ms
Finished random walk after 7242 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 5568 ms. (steps per millisecond=1 )
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:04:14] [INFO ] Computed 20000 place invariants in 145 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1373]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 19159 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:04:38] [INFO ] Computed 20000 place invariants in 51 ms
Finished random walk after 11708 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 5460 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:05:14] [INFO ] Computed 20000 place invariants in 60 ms
[2023-03-15 09:05:59] [INFO ] [Real]Absence check using 20000 positive place invariants in 41122 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6169]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 230 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 198 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:05:59] [INFO ] Computed 20000 place invariants in 37 ms
[2023-03-15 09:06:02] [INFO ] Implicit Places using invariants in 2537 ms returned []
Implicit Place search using SMT only with invariants took 2539 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:06:02] [INFO ] Computed 20000 place invariants in 59 ms
[2023-03-15 09:06:04] [INFO ] Dead Transitions using invariants and state equation in 2508 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:06:04] [INFO ] Computed 20000 place invariants in 62 ms
Finished random walk after 11670 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 5524 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:06:40] [INFO ] Computed 20000 place invariants in 44 ms
[2023-03-15 09:07:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 40800 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6169]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 151 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 172 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:07:25] [INFO ] Computed 20000 place invariants in 46 ms
[2023-03-15 09:07:28] [INFO ] Implicit Places using invariants in 2330 ms returned []
Implicit Place search using SMT only with invariants took 2332 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:07:28] [INFO ] Computed 20000 place invariants in 53 ms
[2023-03-15 09:07:30] [INFO ] Dead Transitions using invariants and state equation in 2375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-01 in 232343 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-02
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:07:30] [INFO ] Computed 20000 place invariants in 161 ms
Finished random walk after 7653 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 5452 ms. (steps per millisecond=1 )
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:08:06] [INFO ] Computed 20000 place invariants in 159 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1402]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 10 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 19255 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:08:30] [INFO ] Computed 20000 place invariants in 43 ms
Finished random walk after 11876 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 5556 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:09:06] [INFO ] Computed 20000 place invariants in 56 ms
[2023-03-15 09:09:51] [INFO ] [Real]Absence check using 20000 positive place invariants in 41025 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6268]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 174 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 165 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:09:52] [INFO ] Computed 20000 place invariants in 42 ms
[2023-03-15 09:09:54] [INFO ] Implicit Places using invariants in 2606 ms returned []
Implicit Place search using SMT only with invariants took 2608 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:09:54] [INFO ] Computed 20000 place invariants in 40 ms
[2023-03-15 09:09:57] [INFO ] Dead Transitions using invariants and state equation in 2453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:09:57] [INFO ] Computed 20000 place invariants in 44 ms
Finished random walk after 11673 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5044 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:10:32] [INFO ] Computed 20000 place invariants in 46 ms
[2023-03-15 09:11:17] [INFO ] [Real]Absence check using 20000 positive place invariants in 41147 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6268]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 162 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:11:17] [INFO ] Computed 20000 place invariants in 33 ms
[2023-03-15 09:11:20] [INFO ] Implicit Places using invariants in 2632 ms returned []
Implicit Place search using SMT only with invariants took 2641 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:11:20] [INFO ] Computed 20000 place invariants in 36 ms
[2023-03-15 09:11:22] [INFO ] Dead Transitions using invariants and state equation in 2484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-02 in 232297 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:11:23] [INFO ] Computed 20000 place invariants in 179 ms
Finished random walk after 7695 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 5448 ms. (steps per millisecond=1 )
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:11:58] [INFO ] Computed 20000 place invariants in 130 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1371]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 10 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 21970 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:12:25] [INFO ] Computed 20000 place invariants in 37 ms
Finished random walk after 11781 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 5479 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:13:01] [INFO ] Computed 20000 place invariants in 38 ms
[2023-03-15 09:13:46] [INFO ] [Real]Absence check using 20000 positive place invariants in 40881 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6070]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 151 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 142 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:13:46] [INFO ] Computed 20000 place invariants in 52 ms
[2023-03-15 09:13:49] [INFO ] Implicit Places using invariants in 2321 ms returned []
Implicit Place search using SMT only with invariants took 2322 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:13:49] [INFO ] Computed 20000 place invariants in 61 ms
[2023-03-15 09:13:51] [INFO ] Dead Transitions using invariants and state equation in 2639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:13:51] [INFO ] Computed 20000 place invariants in 43 ms
Finished random walk after 11899 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 5419 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:14:27] [INFO ] Computed 20000 place invariants in 37 ms
[2023-03-15 09:15:12] [INFO ] [Real]Absence check using 20000 positive place invariants in 40969 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6338]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 142 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:15:12] [INFO ] Computed 20000 place invariants in 35 ms
[2023-03-15 09:15:15] [INFO ] Implicit Places using invariants in 2355 ms returned []
Implicit Place search using SMT only with invariants took 2373 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:15:15] [INFO ] Computed 20000 place invariants in 35 ms
[2023-03-15 09:15:17] [INFO ] Dead Transitions using invariants and state equation in 2319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:15:17] [INFO ] Computed 20000 place invariants in 44 ms
Finished random walk after 11850 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 5399 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:15:53] [INFO ] Computed 20000 place invariants in 41 ms
[2023-03-15 09:16:38] [INFO ] [Real]Absence check using 20000 positive place invariants in 41256 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6338]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 174 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 160 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:16:38] [INFO ] Computed 20000 place invariants in 54 ms
[2023-03-15 09:16:41] [INFO ] Implicit Places using invariants in 2702 ms returned []
Implicit Place search using SMT only with invariants took 2703 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:16:41] [INFO ] Computed 20000 place invariants in 45 ms
[2023-03-15 09:16:43] [INFO ] Dead Transitions using invariants and state equation in 2418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-03 in 320842 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:16:43] [INFO ] Computed 20000 place invariants in 133 ms
Finished random walk after 7595 steps, including 2 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5346 ms. (steps per millisecond=1 ) properties seen 0
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:17:19] [INFO ] Computed 20000 place invariants in 164 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[256]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 27671 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:17:52] [INFO ] Computed 20000 place invariants in 56 ms
Finished random walk after 14575 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 5458 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:18:27] [INFO ] Computed 20000 place invariants in 63 ms
[2023-03-15 09:19:13] [INFO ] [Real]Absence check using 20000 positive place invariants in 41114 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2805]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 161 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:19:13] [INFO ] Computed 20000 place invariants in 53 ms
[2023-03-15 09:19:15] [INFO ] Implicit Places using invariants in 2643 ms returned []
Implicit Place search using SMT only with invariants took 2645 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:19:16] [INFO ] Computed 20000 place invariants in 55 ms
[2023-03-15 09:19:18] [INFO ] Dead Transitions using invariants and state equation in 2480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:19:18] [INFO ] Computed 20000 place invariants in 77 ms
Finished random walk after 14682 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 5527 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:19:54] [INFO ] Computed 20000 place invariants in 48 ms
[2023-03-15 09:20:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 41001 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2805]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:20:39] [INFO ] Computed 20000 place invariants in 56 ms
[2023-03-15 09:20:42] [INFO ] Implicit Places using invariants in 2645 ms returned []
Implicit Place search using SMT only with invariants took 2660 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:20:42] [INFO ] Computed 20000 place invariants in 49 ms
[2023-03-15 09:20:44] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-04 in 241040 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:20:45] [INFO ] Computed 20000 place invariants in 221 ms
Finished random walk after 7494 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5020 ms. (steps per millisecond=1 )
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-15 09:21:20] [INFO ] Computed 20000 place invariants in 127 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1359]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 10 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 22777 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:21:48] [INFO ] Computed 20000 place invariants in 39 ms
Finished random walk after 11875 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 5470 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:22:23] [INFO ] Computed 20000 place invariants in 49 ms
[2023-03-15 09:23:08] [INFO ] [Real]Absence check using 20000 positive place invariants in 41194 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6318]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:23:09] [INFO ] Computed 20000 place invariants in 59 ms
[2023-03-15 09:23:11] [INFO ] Implicit Places using invariants in 2362 ms returned []
Implicit Place search using SMT only with invariants took 2363 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:23:11] [INFO ] Computed 20000 place invariants in 40 ms
[2023-03-15 09:23:14] [INFO ] Dead Transitions using invariants and state equation in 2649 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:23:14] [INFO ] Computed 20000 place invariants in 43 ms
Finished random walk after 11791 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 5521 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:23:49] [INFO ] Computed 20000 place invariants in 88 ms
[2023-03-15 09:24:35] [INFO ] [Real]Absence check using 20000 positive place invariants in 40992 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6318]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 154 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:24:35] [INFO ] Computed 20000 place invariants in 34 ms
[2023-03-15 09:24:38] [INFO ] Implicit Places using invariants in 2691 ms returned []
Implicit Place search using SMT only with invariants took 2693 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-15 09:24:38] [INFO ] Computed 20000 place invariants in 35 ms
[2023-03-15 09:24:40] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-07 in 235755 ms.
[2023-03-15 09:24:43] [INFO ] Flatten gal took : 2013 ms
[2023-03-15 09:24:44] [INFO ] Applying decomposition
[2023-03-15 09:24:46] [INFO ] Flatten gal took : 2017 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15592071937538337330.txt' '-o' '/tmp/graph15592071937538337330.bin' '-w' '/tmp/graph15592071937538337330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15592071937538337330.bin' '-l' '-1' '-v' '-w' '/tmp/graph15592071937538337330.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:24:51] [INFO ] Decomposing Gal with order
[2023-03-15 09:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:41:21] [INFO ] Removed a total of 9901 redundant transitions.
[2023-03-15 09:41:22] [INFO ] Flatten gal took : 2640 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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 gold2022"
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 r319-tall-167873969900034"
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 ;