About the Execution of LTSMin+red for Philosophers-PT-005000
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.r297-tall-167873950200261.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 ltsminxred
Input is Philosophers-PT-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950200261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 226M
-rw-r--r-- 1 mcc users 8.4M Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43M Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2M Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1M Feb 26 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41M Feb 26 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9M Feb 26 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46M Feb 26 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 477K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M 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 11M 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-005000-UpperBounds-00
FORMULA_NAME Philosophers-PT-005000-UpperBounds-01
FORMULA_NAME Philosophers-PT-005000-UpperBounds-02
FORMULA_NAME Philosophers-PT-005000-UpperBounds-03
FORMULA_NAME Philosophers-PT-005000-UpperBounds-04
FORMULA_NAME Philosophers-PT-005000-UpperBounds-05
FORMULA_NAME Philosophers-PT-005000-UpperBounds-06
FORMULA_NAME Philosophers-PT-005000-UpperBounds-07
FORMULA_NAME Philosophers-PT-005000-UpperBounds-08
FORMULA_NAME Philosophers-PT-005000-UpperBounds-09
FORMULA_NAME Philosophers-PT-005000-UpperBounds-10
FORMULA_NAME Philosophers-PT-005000-UpperBounds-11
FORMULA_NAME Philosophers-PT-005000-UpperBounds-12
FORMULA_NAME Philosophers-PT-005000-UpperBounds-13
FORMULA_NAME Philosophers-PT-005000-UpperBounds-14
FORMULA_NAME Philosophers-PT-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679475103616
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-005000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 08:51:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 08:51:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:51:45] [INFO ] Load time of PNML (sax parser for PT used): 581 ms
[2023-03-22 08:51:46] [INFO ] Transformed 25000 places.
[2023-03-22 08:51:46] [INFO ] Transformed 25000 transitions.
[2023-03-22 08:51:46] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 776 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4294 ms.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 08:51:50] [INFO ] Computed 10000 place invariants in 148 ms
FORMULA Philosophers-PT-005000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24904 ms. (steps per millisecond=0 ) properties (out of 10) seen :3625
FORMULA Philosophers-PT-005000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2793 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2801 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2643 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2683 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2755 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
[2023-03-22 08:52:29] [INFO ] Invariant cache hit.
[2023-03-22 08:52:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 1298 ms returned unknown
[2023-03-22 08:52:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 1432 ms returned unknown
[2023-03-22 08:52:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 1757 ms returned unknown
[2023-03-22 08:52:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 1519 ms returned unknown
[2023-03-22 08:52:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 1462 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[1120, 460, 1120, 460, 460]
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 25000 transition count 20000
Reduce places removed 5000 places and 0 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 9105 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9109 ms. Remains : 20000/25000 places, 20000/25000 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-22 08:53:04] [INFO ] Computed 10000 place invariants in 75 ms
Finished random walk after 15111 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5172 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 19998 steps, including 0 resets, run timeout after 5138 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5240 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 19998 steps, including 0 resets, run timeout after 5244 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5145 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-22 08:54:00] [INFO ] Invariant cache hit.
[2023-03-22 08:54:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 18464 ms returned sat
[2023-03-22 08:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:54:45] [INFO ] [Real]Absence check using state equation in 24192 ms returned unknown
[2023-03-22 08:54:56] [INFO ] [Real]Absence check using 10000 positive place invariants in 8696 ms returned sat
[2023-03-22 08:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:55:30] [INFO ] [Real]Absence check using state equation in 33871 ms returned unknown
[2023-03-22 08:55:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 18664 ms returned sat
[2023-03-22 08:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:56:15] [INFO ] [Real]Absence check using state equation in 24025 ms returned unknown
[2023-03-22 08:56:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 8889 ms returned sat
[2023-03-22 08:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:57:00] [INFO ] [Real]Absence check using state equation in 33761 ms returned unknown
[2023-03-22 08:57:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 8155 ms returned sat
[2023-03-22 08:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:57:45] [INFO ] [Real]Absence check using state equation in 34462 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[3816, 1049, 3816, 1049, 1049]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 2257 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2257 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1706 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 08:57:49] [INFO ] Invariant cache hit.
[2023-03-22 08:57:51] [INFO ] Implicit Places using invariants in 2095 ms returned []
Implicit Place search using SMT only with invariants took 2105 ms to find 0 implicit places.
[2023-03-22 08:57:51] [INFO ] Invariant cache hit.
[2023-03-22 08:57:53] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5937 ms. Remains : 20000/20000 places, 20000/20000 transitions.
[2023-03-22 08:57:53] [INFO ] Invariant cache hit.
Finished random walk after 17214 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5234 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5058 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5043 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5186 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5254 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-22 08:58:49] [INFO ] Invariant cache hit.
[2023-03-22 08:59:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 21570 ms returned sat
[2023-03-22 08:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:59:34] [INFO ] [Real]Absence check using state equation in 20945 ms returned unknown
[2023-03-22 08:59:45] [INFO ] [Real]Absence check using 10000 positive place invariants in 8415 ms returned sat
[2023-03-22 08:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:00:19] [INFO ] [Real]Absence check using state equation in 33996 ms returned unknown
[2023-03-22 09:00:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 21755 ms returned sat
[2023-03-22 09:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:01:04] [INFO ] [Real]Absence check using state equation in 20834 ms returned unknown
[2023-03-22 09:01:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9542 ms returned sat
[2023-03-22 09:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:01:49] [INFO ] [Real]Absence check using state equation in 32941 ms returned unknown
[2023-03-22 09:02:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 8765 ms returned sat
[2023-03-22 09:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:02:35] [INFO ] [Real]Absence check using state equation in 33769 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4182, 1049, 4182, 1049, 1049]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1653 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1654 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1621 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 09:02:38] [INFO ] Invariant cache hit.
[2023-03-22 09:02:40] [INFO ] Implicit Places using invariants in 1975 ms returned []
Implicit Place search using SMT only with invariants took 1978 ms to find 0 implicit places.
[2023-03-22 09:02:40] [INFO ] Invariant cache hit.
[2023-03-22 09:02:42] [INFO ] Dead Transitions using invariants and state equation in 1898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5500 ms. Remains : 20000/20000 places, 20000/20000 transitions.
[2023-03-22 09:02:42] [INFO ] Invariant cache hit.
Finished random walk after 17199 steps, including 0 resets, run visited all 5 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5242 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5119 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5328 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5093 ms. (steps per millisecond=3 ) properties seen 3
[2023-03-22 09:03:38] [INFO ] Invariant cache hit.
[2023-03-22 09:04:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 20395 ms returned sat
[2023-03-22 09:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:04:23] [INFO ] [Real]Absence check using state equation in 22047 ms returned unknown
[2023-03-22 09:04:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 8483 ms returned sat
[2023-03-22 09:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:05:08] [INFO ] [Real]Absence check using state equation in 33876 ms returned unknown
[2023-03-22 09:05:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 21786 ms returned sat
[2023-03-22 09:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:05:53] [INFO ] [Real]Absence check using state equation in 20871 ms returned unknown
[2023-03-22 09:06:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 9191 ms returned sat
[2023-03-22 09:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:38] [INFO ] [Real]Absence check using state equation in 33273 ms returned unknown
[2023-03-22 09:06:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 9303 ms returned sat
[2023-03-22 09:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:23] [INFO ] [Real]Absence check using state equation in 33186 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000] Max seen :[4182, 1049, 4182, 1049, 1049]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1645 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1645 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1631 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 09:07:26] [INFO ] Invariant cache hit.
[2023-03-22 09:07:28] [INFO ] Implicit Places using invariants in 1864 ms returned []
Implicit Place search using SMT only with invariants took 1865 ms to find 0 implicit places.
[2023-03-22 09:07:28] [INFO ] Invariant cache hit.
[2023-03-22 09:07:30] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5426 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-00
[2023-03-22 09:07:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15916 ms. (steps per millisecond=0 ) properties (out of 1) seen :1368
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2956 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-22 09:07:49] [INFO ] Invariant cache hit.
[2023-03-22 09:07:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 2418 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1368]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 3 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 15000 transition count 15000
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 5951 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5953 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-22 09:08:00] [INFO ] Computed 10000 place invariants in 33 ms
Finished random walk after 30262 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
FORMULA Philosophers-PT-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-00 in 59966 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-01
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-22 09:08:30] [INFO ] Computed 10000 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16143 ms. (steps per millisecond=0 ) properties (out of 1) seen :1009
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2580 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-22 09:08:49] [INFO ] Invariant cache hit.
[2023-03-22 09:08:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 2309 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1009]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6462 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6465 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-22 09:09:00] [INFO ] Computed 10000 place invariants in 26 ms
Finished random walk after 32329 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5218 ms. (steps per millisecond=3 )
[2023-03-22 09:09:36] [INFO ] Invariant cache hit.
[2023-03-22 09:09:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 12495 ms returned sat
[2023-03-22 09:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:10:13] [INFO ] [Real]Absence check using state equation in 23119 ms returned sat
[2023-03-22 09:10:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:10:27] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11628 ms returned sat
[2023-03-22 09:10:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:10:55] [INFO ] [Nat]Absence check using state equation in 28136 ms returned sat
[2023-03-22 09:10:57] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 540 ms.
[2023-03-22 09:10:58] [INFO ] Added : 0 causal constraints over 0 iterations in 1894 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1440]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1109 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1077 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:11:31] [INFO ] Invariant cache hit.
[2023-03-22 09:11:32] [INFO ] Implicit Places using invariants in 1652 ms returned []
Implicit Place search using SMT only with invariants took 1655 ms to find 0 implicit places.
[2023-03-22 09:11:32] [INFO ] Invariant cache hit.
[2023-03-22 09:11:34] [INFO ] Dead Transitions using invariants and state equation in 1634 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4370 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:11:34] [INFO ] Invariant cache hit.
Finished random walk after 33994 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=3 )
[2023-03-22 09:12:09] [INFO ] Invariant cache hit.
[2023-03-22 09:12:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 9557 ms returned sat
[2023-03-22 09:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:12:42] [INFO ] [Real]Absence check using state equation in 21777 ms returned sat
[2023-03-22 09:12:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:12:54] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9590 ms returned sat
[2023-03-22 09:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:13:15] [INFO ] [Nat]Absence check using state equation in 20803 ms returned sat
[2023-03-22 09:13:16] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 468 ms.
[2023-03-22 09:13:17] [INFO ] Added : 0 causal constraints over 0 iterations in 1733 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1441]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1067 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1049 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:13:50] [INFO ] Invariant cache hit.
[2023-03-22 09:13:51] [INFO ] Implicit Places using invariants in 1425 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2023-03-22 09:13:51] [INFO ] Invariant cache hit.
[2023-03-22 09:13:53] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4042 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:13:53] [INFO ] Invariant cache hit.
Finished random walk after 33465 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5251 ms. (steps per millisecond=3 )
[2023-03-22 09:14:28] [INFO ] Invariant cache hit.
[2023-03-22 09:14:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 9753 ms returned sat
[2023-03-22 09:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:15:07] [INFO ] [Real]Absence check using state equation in 27210 ms returned sat
[2023-03-22 09:15:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:15:19] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10457 ms returned sat
[2023-03-22 09:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:15:47] [INFO ] [Nat]Absence check using state equation in 27517 ms returned sat
[2023-03-22 09:15:48] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 545 ms.
[2023-03-22 09:15:50] [INFO ] Added : 0 causal constraints over 0 iterations in 1824 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1442]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1092 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1093 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1069 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:16:22] [INFO ] Invariant cache hit.
[2023-03-22 09:16:24] [INFO ] Implicit Places using invariants in 1577 ms returned []
Implicit Place search using SMT only with invariants took 1585 ms to find 0 implicit places.
[2023-03-22 09:16:24] [INFO ] Invariant cache hit.
[2023-03-22 09:16:25] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4186 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:16:25] [INFO ] Invariant cache hit.
Finished random walk after 33687 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5219 ms. (steps per millisecond=4 )
[2023-03-22 09:17:01] [INFO ] Invariant cache hit.
[2023-03-22 09:17:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 10256 ms returned sat
[2023-03-22 09:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:17:35] [INFO ] [Real]Absence check using state equation in 22319 ms returned sat
[2023-03-22 09:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:17:47] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10103 ms returned sat
[2023-03-22 09:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:18:09] [INFO ] [Nat]Absence check using state equation in 21781 ms returned sat
[2023-03-22 09:18:11] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 496 ms.
[2023-03-22 09:18:12] [INFO ] Added : 0 causal constraints over 0 iterations in 1788 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1448]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1073 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1054 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:18:45] [INFO ] Invariant cache hit.
[2023-03-22 09:18:46] [INFO ] Implicit Places using invariants in 1552 ms returned []
Implicit Place search using SMT only with invariants took 1554 ms to find 0 implicit places.
[2023-03-22 09:18:46] [INFO ] Invariant cache hit.
[2023-03-22 09:18:48] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4141 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:18:48] [INFO ] Invariant cache hit.
Finished random walk after 34213 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5112 ms. (steps per millisecond=4 )
[2023-03-22 09:19:23] [INFO ] Invariant cache hit.
[2023-03-22 09:19:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 9412 ms returned sat
[2023-03-22 09:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:19:55] [INFO ] [Real]Absence check using state equation in 21427 ms returned sat
[2023-03-22 09:19:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:20:07] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9877 ms returned sat
[2023-03-22 09:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:20:32] [INFO ] [Nat]Absence check using state equation in 24599 ms returned sat
[2023-03-22 09:20:33] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 535 ms.
[2023-03-22 09:20:35] [INFO ] Added : 0 causal constraints over 0 iterations in 1782 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1449]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1096 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1097 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1096 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:21:07] [INFO ] Invariant cache hit.
[2023-03-22 09:21:09] [INFO ] Implicit Places using invariants in 1712 ms returned []
Implicit Place search using SMT only with invariants took 1713 ms to find 0 implicit places.
[2023-03-22 09:21:09] [INFO ] Invariant cache hit.
[2023-03-22 09:21:11] [INFO ] Dead Transitions using invariants and state equation in 1652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4465 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:21:11] [INFO ] Invariant cache hit.
Finished random walk after 33421 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5019 ms. (steps per millisecond=3 )
[2023-03-22 09:21:46] [INFO ] Invariant cache hit.
[2023-03-22 09:21:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 10019 ms returned sat
[2023-03-22 09:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:22:25] [INFO ] [Real]Absence check using state equation in 27499 ms returned sat
[2023-03-22 09:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:22:38] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11005 ms returned sat
[2023-03-22 09:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:23:09] [INFO ] [Nat]Absence check using state equation in 30287 ms returned sat
[2023-03-22 09:23:10] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 541 ms.
[2023-03-22 09:24:21] [INFO ] Deduced a trap composed of 2 places in 70026 ms of which 14 ms to minimize.
[2023-03-22 09:24:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1450]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1070 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1070 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:24:23] [INFO ] Invariant cache hit.
[2023-03-22 09:24:25] [INFO ] Implicit Places using invariants in 1611 ms returned []
Implicit Place search using SMT only with invariants took 1616 ms to find 0 implicit places.
[2023-03-22 09:24:25] [INFO ] Invariant cache hit.
[2023-03-22 09:24:26] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4329 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-01 in 956138 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-02
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-22 09:24:26] [INFO ] Computed 10000 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15651 ms. (steps per millisecond=0 ) properties (out of 1) seen :1385
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2624 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-22 09:24:45] [INFO ] Invariant cache hit.
[2023-03-22 09:24:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 2241 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1385]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 4 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 15000 transition count 15000
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 5000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 5890 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5891 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-22 09:24:56] [INFO ] Computed 10000 place invariants in 31 ms
Finished random walk after 30268 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
FORMULA Philosophers-PT-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-02 in 59330 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-04
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-22 09:25:26] [INFO ] Computed 10000 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15754 ms. (steps per millisecond=0 ) properties (out of 1) seen :981
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2499 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
[2023-03-22 09:25:44] [INFO ] Invariant cache hit.
[2023-03-22 09:25:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 2359 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[981]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6217 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6218 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-22 09:25:55] [INFO ] Computed 10000 place invariants in 30 ms
Finished random walk after 33925 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5302 ms. (steps per millisecond=4 )
[2023-03-22 09:26:30] [INFO ] Invariant cache hit.
[2023-03-22 09:26:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 9661 ms returned sat
[2023-03-22 09:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:27:08] [INFO ] [Real]Absence check using state equation in 26631 ms returned sat
[2023-03-22 09:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:27:21] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10169 ms returned sat
[2023-03-22 09:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:27:47] [INFO ] [Nat]Absence check using state equation in 26399 ms returned sat
[2023-03-22 09:27:49] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 559 ms.
[2023-03-22 09:27:50] [INFO ] Added : 0 causal constraints over 0 iterations in 1791 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1423]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1064 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1065 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1086 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:28:22] [INFO ] Invariant cache hit.
[2023-03-22 09:28:24] [INFO ] Implicit Places using invariants in 1601 ms returned []
Implicit Place search using SMT only with invariants took 1624 ms to find 0 implicit places.
[2023-03-22 09:28:24] [INFO ] Invariant cache hit.
[2023-03-22 09:28:26] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4224 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:28:26] [INFO ] Invariant cache hit.
Finished random walk after 34077 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5072 ms. (steps per millisecond=4 )
[2023-03-22 09:29:01] [INFO ] Invariant cache hit.
[2023-03-22 09:29:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 9027 ms returned sat
[2023-03-22 09:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:29:34] [INFO ] [Real]Absence check using state equation in 22170 ms returned sat
[2023-03-22 09:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:29:45] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9379 ms returned sat
[2023-03-22 09:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:30:08] [INFO ] [Nat]Absence check using state equation in 22728 ms returned sat
[2023-03-22 09:30:09] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 479 ms.
[2023-03-22 09:30:10] [INFO ] Added : 0 causal constraints over 0 iterations in 1684 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1455]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1045 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1046 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1027 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:30:43] [INFO ] Invariant cache hit.
[2023-03-22 09:30:44] [INFO ] Implicit Places using invariants in 1477 ms returned []
Implicit Place search using SMT only with invariants took 1489 ms to find 0 implicit places.
[2023-03-22 09:30:44] [INFO ] Invariant cache hit.
[2023-03-22 09:30:46] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4041 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:30:46] [INFO ] Invariant cache hit.
Finished random walk after 34066 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 20993 steps, including 0 resets, run visited all 1 properties in 5006 ms. (steps per millisecond=4 )
[2023-03-22 09:31:21] [INFO ] Invariant cache hit.
[2023-03-22 09:31:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 9743 ms returned sat
[2023-03-22 09:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:31:56] [INFO ] [Real]Absence check using state equation in 23341 ms returned sat
[2023-03-22 09:31:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:32:07] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9394 ms returned sat
[2023-03-22 09:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:34] [INFO ] [Nat]Absence check using state equation in 26449 ms returned sat
[2023-03-22 09:32:35] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 528 ms.
[2023-03-22 09:32:37] [INFO ] Added : 0 causal constraints over 0 iterations in 1877 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1456]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1046 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1046 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1036 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:33:09] [INFO ] Invariant cache hit.
[2023-03-22 09:33:11] [INFO ] Implicit Places using invariants in 1502 ms returned []
Implicit Place search using SMT only with invariants took 1503 ms to find 0 implicit places.
[2023-03-22 09:33:11] [INFO ] Invariant cache hit.
[2023-03-22 09:33:12] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3973 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:33:12] [INFO ] Invariant cache hit.
Finished random walk after 33683 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5048 ms. (steps per millisecond=4 )
[2023-03-22 09:33:47] [INFO ] Invariant cache hit.
[2023-03-22 09:33:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 9989 ms returned sat
[2023-03-22 09:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:34:29] [INFO ] [Real]Absence check using state equation in 30224 ms returned sat
[2023-03-22 09:34:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:34:43] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11645 ms returned sat
[2023-03-22 09:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:35:08] [INFO ] [Nat]Absence check using state equation in 25457 ms returned sat
[2023-03-22 09:35:10] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 463 ms.
[2023-03-22 09:35:11] [INFO ] Added : 0 causal constraints over 0 iterations in 1661 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1457]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1081 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1051 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:35:44] [INFO ] Invariant cache hit.
[2023-03-22 09:35:45] [INFO ] Implicit Places using invariants in 1601 ms returned []
Implicit Place search using SMT only with invariants took 1605 ms to find 0 implicit places.
[2023-03-22 09:35:45] [INFO ] Invariant cache hit.
[2023-03-22 09:35:47] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4126 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:35:47] [INFO ] Invariant cache hit.
Finished random walk after 32706 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 21993 steps, including 0 resets, run visited all 1 properties in 5136 ms. (steps per millisecond=4 )
[2023-03-22 09:36:22] [INFO ] Invariant cache hit.
[2023-03-22 09:36:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 12687 ms returned sat
[2023-03-22 09:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:37:07] [INFO ] [Real]Absence check using state equation in 30585 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1458]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1171 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1171 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1109 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:37:09] [INFO ] Invariant cache hit.
[2023-03-22 09:37:11] [INFO ] Implicit Places using invariants in 1613 ms returned []
Implicit Place search using SMT only with invariants took 1615 ms to find 0 implicit places.
[2023-03-22 09:37:11] [INFO ] Invariant cache hit.
[2023-03-22 09:37:12] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4249 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-04 in 706796 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-06
// Phase 1: matrix 20000 rows 20000 cols
[2023-03-22 09:37:12] [INFO ] Computed 10000 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16257 ms. (steps per millisecond=0 ) properties (out of 1) seen :994
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2537 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-22 09:37:31] [INFO ] Invariant cache hit.
[2023-03-22 09:37:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 2492 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[994]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6455 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6457 ms. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-22 09:37:43] [INFO ] Computed 10000 place invariants in 21 ms
Finished random walk after 33911 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5238 ms. (steps per millisecond=3 )
[2023-03-22 09:38:18] [INFO ] Invariant cache hit.
[2023-03-22 09:38:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 9656 ms returned sat
[2023-03-22 09:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:38:54] [INFO ] [Real]Absence check using state equation in 24622 ms returned sat
[2023-03-22 09:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:39:06] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10235 ms returned sat
[2023-03-22 09:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:39:32] [INFO ] [Nat]Absence check using state equation in 25304 ms returned sat
[2023-03-22 09:39:33] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 538 ms.
[2023-03-22 09:39:34] [INFO ] Added : 0 causal constraints over 0 iterations in 1840 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1449]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1103 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1077 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:40:07] [INFO ] Invariant cache hit.
[2023-03-22 09:40:09] [INFO ] Implicit Places using invariants in 1555 ms returned []
Implicit Place search using SMT only with invariants took 1559 ms to find 0 implicit places.
[2023-03-22 09:40:09] [INFO ] Invariant cache hit.
[2023-03-22 09:40:10] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3983 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:40:10] [INFO ] Invariant cache hit.
Finished random walk after 33488 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5274 ms. (steps per millisecond=3 )
[2023-03-22 09:40:45] [INFO ] Invariant cache hit.
[2023-03-22 09:40:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 9520 ms returned sat
[2023-03-22 09:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:41:21] [INFO ] [Real]Absence check using state equation in 24469 ms returned sat
[2023-03-22 09:41:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:41:33] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9849 ms returned sat
[2023-03-22 09:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:41:58] [INFO ] [Nat]Absence check using state equation in 25042 ms returned sat
[2023-03-22 09:42:00] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 489 ms.
[2023-03-22 09:42:01] [INFO ] Added : 0 causal constraints over 0 iterations in 1801 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1450]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1054 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1054 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1058 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:42:34] [INFO ] Invariant cache hit.
[2023-03-22 09:42:35] [INFO ] Implicit Places using invariants in 1646 ms returned []
Implicit Place search using SMT only with invariants took 1647 ms to find 0 implicit places.
[2023-03-22 09:42:35] [INFO ] Invariant cache hit.
[2023-03-22 09:42:37] [INFO ] Dead Transitions using invariants and state equation in 1500 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4209 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:42:37] [INFO ] Invariant cache hit.
Finished random walk after 34170 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5225 ms. (steps per millisecond=3 )
[2023-03-22 09:43:12] [INFO ] Invariant cache hit.
[2023-03-22 09:43:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 9538 ms returned sat
[2023-03-22 09:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:43:48] [INFO ] [Real]Absence check using state equation in 24517 ms returned sat
[2023-03-22 09:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:44:00] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9559 ms returned sat
[2023-03-22 09:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:44:22] [INFO ] [Nat]Absence check using state equation in 22658 ms returned sat
[2023-03-22 09:44:24] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 455 ms.
[2023-03-22 09:44:25] [INFO ] Added : 0 causal constraints over 0 iterations in 1667 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1451]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1065 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1065 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1060 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:44:57] [INFO ] Invariant cache hit.
[2023-03-22 09:44:59] [INFO ] Implicit Places using invariants in 1530 ms returned []
Implicit Place search using SMT only with invariants took 1551 ms to find 0 implicit places.
[2023-03-22 09:44:59] [INFO ] Invariant cache hit.
[2023-03-22 09:45:00] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4084 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:45:00] [INFO ] Invariant cache hit.
Finished random walk after 34041 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5205 ms. (steps per millisecond=3 )
[2023-03-22 09:45:36] [INFO ] Invariant cache hit.
[2023-03-22 09:45:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 9600 ms returned sat
[2023-03-22 09:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:46:10] [INFO ] [Real]Absence check using state equation in 22921 ms returned sat
[2023-03-22 09:46:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:46:22] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9693 ms returned sat
[2023-03-22 09:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:46:47] [INFO ] [Nat]Absence check using state equation in 25162 ms returned sat
[2023-03-22 09:46:48] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 478 ms.
[2023-03-22 09:46:49] [INFO ] Added : 0 causal constraints over 0 iterations in 1691 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1452]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1036 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1037 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:47:22] [INFO ] Invariant cache hit.
[2023-03-22 09:47:23] [INFO ] Implicit Places using invariants in 1526 ms returned []
Implicit Place search using SMT only with invariants took 1546 ms to find 0 implicit places.
[2023-03-22 09:47:23] [INFO ] Invariant cache hit.
[2023-03-22 09:47:25] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4038 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:47:25] [INFO ] Invariant cache hit.
Finished random walk after 34283 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5164 ms. (steps per millisecond=3 )
[2023-03-22 09:48:00] [INFO ] Invariant cache hit.
[2023-03-22 09:48:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 10066 ms returned sat
[2023-03-22 09:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:48:34] [INFO ] [Real]Absence check using state equation in 22381 ms returned sat
[2023-03-22 09:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:48:46] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10116 ms returned sat
[2023-03-22 09:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:49:10] [INFO ] [Nat]Absence check using state equation in 23734 ms returned sat
[2023-03-22 09:49:11] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 519 ms.
[2023-03-22 09:49:13] [INFO ] Added : 0 causal constraints over 0 iterations in 1759 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1453]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1078 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1078 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1057 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 09:49:45] [INFO ] Invariant cache hit.
[2023-03-22 09:49:47] [INFO ] Implicit Places using invariants in 1640 ms returned []
Implicit Place search using SMT only with invariants took 1643 ms to find 0 implicit places.
[2023-03-22 09:49:47] [INFO ] Invariant cache hit.
[2023-03-22 09:49:49] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4411 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-22 09:49:49] [INFO ] Invariant cache hit.
Finished random walk after 34374 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5169 ms. (steps per millisecond=3 )
[2023-03-22 09:50:24] [INFO ] Invariant cache hit.
[2023-03-22 09:50:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 9895 ms returned sat
[2023-03-22 09:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:51:02] [INFO ] [Real]Absence check using state equation in 26127 ms returned sat
[2023-03-22 09:51:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:51:14] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9787 ms returned sat
[2023-03-22 09:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:51:33] [INFO ] [Nat]Absence check using state equation in 19752 ms returned sat
[2023-03-22 09:51:35] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 521 ms.
[2023-03-22 09:51:36] [INFO ] Added : 0 causal constraints over 0 iterations in 1780 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1454]
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 13353312 kB
After kill :
MemTotal: 16393232 kB
MemFree: 13348744 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Philosophers-PT-005000, 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 r297-tall-167873950200261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-005000.tgz
mv Philosophers-PT-005000 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 ;