About the Execution of ITS-Tools for Philosophers-PT-010000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016600365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r168-tall-165277016600365
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 170M
-rw-r--r-- 1 mcc users 8.4M Apr 30 01:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42M Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1M Apr 29 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48M Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5M May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 970K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.6M May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 22M May 10 09:34 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 1652833353559
Running Version 202205111006
[2022-05-18 00:22:34] [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]
[2022-05-18 00:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:22:36] [INFO ] Load time of PNML (sax parser for PT used): 1175 ms
[2022-05-18 00:22:36] [INFO ] Transformed 50000 places.
[2022-05-18 00:22:36] [INFO ] Transformed 50000 transitions.
[2022-05-18 00:22:36] [INFO ] Parsed PT model containing 50000 places and 50000 transitions in 1546 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12576 ms.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:22:49] [INFO ] Computed 20000 place invariants in 252 ms
FORMULA Philosophers-PT-010000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-11 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-04 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-02 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-010000-UpperBounds-00 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 5864 steps, including 1 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen 3292
FORMULA Philosophers-PT-010000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5098 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5310 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5142 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=1 ) properties seen 1
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2644 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2594 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2531 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2640 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:23:51] [INFO ] Computed 20000 place invariants in 178 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1, 1] Max seen :[1398, 272, 1349, 272, 0, 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 566 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
[2022-05-18 00:24:32] [INFO ] Computed 20000 place invariants in 148 ms
Interrupted random walk after 5875 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen 5475
FORMULA Philosophers-PT-010000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5573 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 10001 steps, including 0 resets, run timeout after 5539 ms. (steps per millisecond=1 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5170 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5162 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5049 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5066 ms. (steps per millisecond=3 ) properties seen 1
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:25:39] [INFO ] Computed 20000 place invariants in 244 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2070, 702, 2000, 702, 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 359 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
[2022-05-18 00:26:41] [INFO ] Computed 20000 place invariants in 157 ms
Interrupted random walk after 6207 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 5770
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5207 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5258 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5243 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5218 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5223 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5081 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5086 ms. (steps per millisecond=3 ) properties seen 1
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:27:48] [INFO ] Computed 20000 place invariants in 209 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2143, 740, 2147, 740, 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 354 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 362 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:28:51] [INFO ] Computed 20000 place invariants in 142 ms
[2022-05-18 00:28:55] [INFO ] Implicit Places using invariants in 4250 ms returned []
Implicit Place search using SMT only with invariants took 4252 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:28:55] [INFO ] Computed 20000 place invariants in 152 ms
[2022-05-18 00:28:59] [INFO ] Dead Transitions using invariants and state equation in 4354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:28:59] [INFO ] Computed 20000 place invariants in 154 ms
Interrupted random walk after 5464 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 5217
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5304 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5177 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5328 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 11001 steps, including 0 resets, run timeout after 5337 ms. (steps per millisecond=2 ) properties seen 1
Interrupted Best-First random walk after 19001 steps, including 0 resets, run timeout after 5090 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=3 ) properties seen 1
Interrupted Best-First random walk after 20001 steps, including 0 resets, run timeout after 5137 ms. (steps per millisecond=3 ) properties seen 1
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:30:06] [INFO ] Computed 20000 place invariants in 141 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 1, 1, 1] Max seen :[2143, 740, 2147, 740, 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 322 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 307 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:31:11] [INFO ] Computed 20000 place invariants in 197 ms
[2022-05-18 00:31:15] [INFO ] Implicit Places using invariants in 4460 ms returned []
Implicit Place search using SMT only with invariants took 4462 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:31:15] [INFO ] Computed 20000 place invariants in 162 ms
[2022-05-18 00:31:19] [INFO ] Dead Transitions using invariants and state equation in 4156 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-01
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:31:20] [INFO ] Computed 20000 place invariants in 179 ms
Finished random walk after 7027 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5359 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:31:55] [INFO ] Computed 20000 place invariants in 129 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1381]
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 24644 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
[2022-05-18 00:32:25] [INFO ] Computed 20000 place invariants in 42 ms
Finished random walk after 12092 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5388 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:33:00] [INFO ] Computed 20000 place invariants in 42 ms
[2022-05-18 00:33:45] [INFO ] [Real]Absence check using 20000 positive place invariants in 41162 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6237]
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 166 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:33:46] [INFO ] Computed 20000 place invariants in 38 ms
[2022-05-18 00:33:48] [INFO ] Implicit Places using invariants in 2431 ms returned []
Implicit Place search using SMT only with invariants took 2438 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:33:48] [INFO ] Computed 20000 place invariants in 49 ms
[2022-05-18 00:33:51] [INFO ] Dead Transitions using invariants and state equation in 2366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:33:51] [INFO ] Computed 20000 place invariants in 48 ms
Finished random walk after 11417 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 10001 steps, including 0 resets, run visited all 1 properties in 5389 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:34:26] [INFO ] Computed 20000 place invariants in 58 ms
[2022-05-18 00:35:11] [INFO ] [Real]Absence check using 20000 positive place invariants in 41043 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6237]
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 173 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
[2022-05-18 00:35:12] [INFO ] Computed 20000 place invariants in 66 ms
[2022-05-18 00:35:14] [INFO ] Implicit Places using invariants in 2411 ms returned []
Implicit Place search using SMT only with invariants took 2413 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:35:14] [INFO ] Computed 20000 place invariants in 47 ms
[2022-05-18 00:35:17] [INFO ] Dead Transitions using invariants and state equation in 2616 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 237330 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:35:17] [INFO ] Computed 20000 place invariants in 140 ms
Finished random walk after 7231 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 4789 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:35:52] [INFO ] Computed 20000 place invariants in 138 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[244]
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 40700 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
[2022-05-18 00:36:38] [INFO ] Computed 20000 place invariants in 63 ms
Finished random walk after 13447 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 11002 steps, including 0 resets, run visited all 1 properties in 5508 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:37:13] [INFO ] Computed 20000 place invariants in 81 ms
[2022-05-18 00:37:58] [INFO ] [Real]Absence check using 20000 positive place invariants in 40684 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2765]
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 186 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 150 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:37:59] [INFO ] Computed 20000 place invariants in 67 ms
[2022-05-18 00:38:01] [INFO ] Implicit Places using invariants in 2673 ms returned []
Implicit Place search using SMT only with invariants took 2676 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:38:01] [INFO ] Computed 20000 place invariants in 69 ms
[2022-05-18 00:38:04] [INFO ] Dead Transitions using invariants and state equation in 2441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:38:04] [INFO ] Computed 20000 place invariants in 51 ms
Finished random walk after 13561 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 5069 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:38:39] [INFO ] Computed 20000 place invariants in 84 ms
[2022-05-18 00:39:24] [INFO ] [Real]Absence check using 20000 positive place invariants in 40991 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2803]
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 224 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 186 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:39:25] [INFO ] Computed 20000 place invariants in 56 ms
[2022-05-18 00:39:27] [INFO ] Implicit Places using invariants in 2471 ms returned []
Implicit Place search using SMT only with invariants took 2491 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:39:27] [INFO ] Computed 20000 place invariants in 53 ms
[2022-05-18 00:39:30] [INFO ] Dead Transitions using invariants and state equation in 2479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:39:30] [INFO ] Computed 20000 place invariants in 53 ms
Finished random walk after 13494 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 5066 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:40:05] [INFO ] Computed 20000 place invariants in 99 ms
[2022-05-18 00:40:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 40761 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2803]
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 159 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 161 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:40:50] [INFO ] Computed 20000 place invariants in 56 ms
[2022-05-18 00:40:53] [INFO ] Implicit Places using invariants in 2450 ms returned []
Implicit Place search using SMT only with invariants took 2456 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:40:53] [INFO ] Computed 20000 place invariants in 53 ms
[2022-05-18 00:40:55] [INFO ] Dead Transitions using invariants and state equation in 2396 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 338584 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-05
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:40:55] [INFO ] Computed 20000 place invariants in 145 ms
Finished random walk after 6756 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 5224 ms. (steps per millisecond=1 )
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:41:31] [INFO ] Computed 20000 place invariants in 222 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1437]
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 7 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 32393 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
[2022-05-18 00:42:08] [INFO ] Computed 20000 place invariants in 44 ms
Finished random walk after 10625 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 11002 steps, including 0 resets, run visited all 1 properties in 5011 ms. (steps per millisecond=2 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:42:44] [INFO ] Computed 20000 place invariants in 52 ms
[2022-05-18 00:43:29] [INFO ] [Real]Absence check using 20000 positive place invariants in 40436 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[5824]
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 179 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:43:29] [INFO ] Computed 20000 place invariants in 72 ms
[2022-05-18 00:43:31] [INFO ] Implicit Places using invariants in 2470 ms returned []
Implicit Place search using SMT only with invariants took 2482 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:43:31] [INFO ] Computed 20000 place invariants in 71 ms
[2022-05-18 00:43:34] [INFO ] Dead Transitions using invariants and state equation in 2495 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:43:34] [INFO ] Computed 20000 place invariants in 50 ms
Finished random walk after 9991 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 11002 steps, including 0 resets, run visited all 1 properties in 5010 ms. (steps per millisecond=2 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:44:09] [INFO ] Computed 20000 place invariants in 74 ms
[2022-05-18 00:44:54] [INFO ] [Real]Absence check using 20000 positive place invariants in 40597 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[5824]
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 201 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 209 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:44:55] [INFO ] Computed 20000 place invariants in 50 ms
[2022-05-18 00:44:57] [INFO ] Implicit Places using invariants in 2488 ms returned []
Implicit Place search using SMT only with invariants took 2490 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:44:57] [INFO ] Computed 20000 place invariants in 48 ms
[2022-05-18 00:44:59] [INFO ] Dead Transitions using invariants and state equation in 2442 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-05 in 244288 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:45:00] [INFO ] Computed 20000 place invariants in 175 ms
Finished random walk after 6699 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 4493 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:45:34] [INFO ] Computed 20000 place invariants in 196 ms
Current structural bounds on expressions (after SMT) : [10000] Max seen :[275]
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 50448 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
[2022-05-18 00:46:30] [INFO ] Computed 20000 place invariants in 57 ms
Finished random walk after 14031 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 12002 steps, including 0 resets, run visited all 1 properties in 5413 ms. (steps per millisecond=2 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:47:06] [INFO ] Computed 20000 place invariants in 116 ms
[2022-05-18 00:47:51] [INFO ] [Real]Absence check using 20000 positive place invariants in 41225 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2806]
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 153 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 181 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:47:51] [INFO ] Computed 20000 place invariants in 58 ms
[2022-05-18 00:47:53] [INFO ] Implicit Places using invariants in 2363 ms returned []
Implicit Place search using SMT only with invariants took 2375 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:47:54] [INFO ] Computed 20000 place invariants in 57 ms
[2022-05-18 00:47:56] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30000/30000 places, 20000/20000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:47:56] [INFO ] Computed 20000 place invariants in 58 ms
Finished random walk after 14253 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 11002 steps, including 0 resets, run visited all 1 properties in 5051 ms. (steps per millisecond=2 )
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:48:31] [INFO ] Computed 20000 place invariants in 49 ms
[2022-05-18 00:49:16] [INFO ] [Real]Absence check using 20000 positive place invariants in 41127 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2806]
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 144 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 158 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:49:17] [INFO ] Computed 20000 place invariants in 55 ms
[2022-05-18 00:49:19] [INFO ] Implicit Places using invariants in 2343 ms returned []
Implicit Place search using SMT only with invariants took 2353 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 30000 cols
[2022-05-18 00:49:19] [INFO ] Computed 20000 place invariants in 52 ms
[2022-05-18 00:49:21] [INFO ] Dead Transitions using invariants and state equation in 2436 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 261776 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-09
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:49:21] [INFO ] Computed 20000 place invariants in 140 ms
Interrupted random walk after 7175 steps, including 2 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2597 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:49:54] [INFO ] Computed 20000 place invariants in 182 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 10 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 71826 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:51:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-09 in 110096 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-12
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:51:12] [INFO ] Computed 20000 place invariants in 229 ms
Interrupted random walk after 8454 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2653 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:51:44] [INFO ] Computed 20000 place invariants in 118 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 10 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 32530 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:52:22] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=4098 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-12 in 70902 ms.
Starting property specific reduction for Philosophers-PT-010000-UpperBounds-13
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:52:22] [INFO ] Computed 20000 place invariants in 118 ms
Interrupted random walk after 8714 steps, including 2 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2543 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:52:55] [INFO ] Computed 20000 place invariants in 116 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 13 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 0 with 19998 rules applied. Total rules applied 19998 place count 40001 transition count 40001
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 39998 place count 40001 transition count 20001
Reduce places removed 39997 places and 0 transitions.
Drop transitions removed 19998 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19999 transitions.
Iterating post reduction 0 with 59996 rules applied. Total rules applied 99994 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 99996 place count 2 transition count 2
Applied a total of 99996 rules in 38955 ms. Remains 2 /50000 variables (removed 49998) and now considering 2/50000 (removed 49998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/50000 places, 2/50000 transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-18 00:53:39] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=4444 ) properties (out of 1) seen :1
FORMULA Philosophers-PT-010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-010000-UpperBounds-13 in 77063 ms.
[2022-05-18 00:53:42] [INFO ] Flatten gal took : 2137 ms
[2022-05-18 00:53:44] [INFO ] Applying decomposition
[2022-05-18 00:53:46] [INFO ] Flatten gal took : 2069 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/graph3604533324673043192.txt' '-o' '/tmp/graph3604533324673043192.bin' '-w' '/tmp/graph3604533324673043192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3604533324673043192.bin' '-l' '-1' '-v' '-w' '/tmp/graph3604533324673043192.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:53:52] [INFO ] Decomposing Gal with order
[2022-05-18 00:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:07:57] [INFO ] Removed a total of 9909 redundant transitions.
[2022-05-18 01:07:58] [INFO ] Flatten gal took : 2602 ms
[2022-05-18 01:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 33886 labels/synchronizations in 834 ms.
[2022-05-18 01:15:39] [INFO ] Time to serialize gal into /tmp/UpperBounds10569472410789952210.gal : 682 ms
[2022-05-18 01:15:39] [INFO ] Time to serialize properties into /tmp/UpperBounds1782115934162179828.prop : 37 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10569472410789952210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1782115934162179828.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds1782115934162179828.prop.
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r168-tall-165277016600365"
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 '
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 ;