fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for Philosophers-COL-010000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8736.955 3600000.00 3836698.00 37307.30 ? ? ? ? ? 10000 10000 ? 10000 10000 10000 10000 ? ? ? 10000 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950100165.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-COL-010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.0K Feb 26 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 11:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 447K 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-COL-010000-UpperBounds-00
FORMULA_NAME Philosophers-COL-010000-UpperBounds-01
FORMULA_NAME Philosophers-COL-010000-UpperBounds-02
FORMULA_NAME Philosophers-COL-010000-UpperBounds-03
FORMULA_NAME Philosophers-COL-010000-UpperBounds-04
FORMULA_NAME Philosophers-COL-010000-UpperBounds-05
FORMULA_NAME Philosophers-COL-010000-UpperBounds-06
FORMULA_NAME Philosophers-COL-010000-UpperBounds-07
FORMULA_NAME Philosophers-COL-010000-UpperBounds-08
FORMULA_NAME Philosophers-COL-010000-UpperBounds-09
FORMULA_NAME Philosophers-COL-010000-UpperBounds-10
FORMULA_NAME Philosophers-COL-010000-UpperBounds-11
FORMULA_NAME Philosophers-COL-010000-UpperBounds-12
FORMULA_NAME Philosophers-COL-010000-UpperBounds-13
FORMULA_NAME Philosophers-COL-010000-UpperBounds-14
FORMULA_NAME Philosophers-COL-010000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679459111901

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-COL-010000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 04:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:25:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 04:25:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 04:25:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 805 ms
[2023-03-22 04:25:14] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50000 PT places and 50000.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 04:25:14] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 04:25:14] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 04:25:14] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-010000-UpperBounds-15 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-11 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-10 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-08 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-06 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-010000-UpperBounds-05 10000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 04:25:14] [INFO ] Invariant cache hit.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 04:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 04:25:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 04:25:14] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 04:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 04:25:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 04:25:14] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 04:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:25:14] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 04:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 04:25:15] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 04:25:15] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 04:25:15] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 04:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 04:25:15] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 04:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 04:25:15] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 04:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 04:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:25:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 04:25:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 04:25:15] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10000) 10000) 10000)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 04:25:15] [INFO ] Unfolded HLPN to a Petri net with 50000 places and 50000 transitions 160000 arcs in 285 ms.
[2023-03-22 04:25:15] [INFO ] Unfolded 9 HLPN properties in 8 ms.
Finished random walk after 3973 steps, including 1 resets, run visited all 9 properties in 30006 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 7001 steps, including 0 resets, run timeout after 5186 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5542 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5453 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5536 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5408 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5403 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5635 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5548 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5527 ms. (steps per millisecond=1 ) properties seen 2
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 04:26:36] [INFO ] Computed 20000 place invariants in 244 ms
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1379, 1374, 1379, 1374, 268, 1379, 268, 1379, 268]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 466 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 04:27:22] [INFO ] Invariant cache hit.
Finished random walk after 4096 steps, including 0 resets, run visited all 9 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5386 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5372 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5411 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5291 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5365 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5395 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5266 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5292 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5317 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-22 04:28:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1552, 1609, 1552, 1609, 404, 1552, 404, 1552, 404]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 277 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 240 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 04:30:04] [INFO ] Invariant cache hit.
[2023-03-22 04:30:17] [INFO ] Implicit Places using invariants in 13558 ms returned []
Implicit Place search using SMT only with invariants took 13561 ms to find 0 implicit places.
[2023-03-22 04:30:18] [INFO ] Invariant cache hit.
[2023-03-22 04:30:22] [INFO ] Dead Transitions using invariants and state equation in 4647 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18452 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 04:30:22] [INFO ] Invariant cache hit.
Finished random walk after 4800 steps, including 0 resets, run visited all 9 properties in 30007 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5395 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5612 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5502 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5436 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5348 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5492 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5228 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5333 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5223 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-22 04:31:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1866, 1758, 1866, 1758, 488, 1866, 488, 1866, 488]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 237 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 264 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 04:33:04] [INFO ] Invariant cache hit.
[2023-03-22 04:33:09] [INFO ] Implicit Places using invariants in 5114 ms returned []
Implicit Place search using SMT only with invariants took 5117 ms to find 0 implicit places.
[2023-03-22 04:33:09] [INFO ] Invariant cache hit.
[2023-03-22 04:33:13] [INFO ] Dead Transitions using invariants and state equation in 4603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9985 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 04:33:13] [INFO ] Invariant cache hit.
Finished random walk after 4898 steps, including 0 resets, run visited all 9 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5298 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5351 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5367 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5395 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5546 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5301 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5374 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5457 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5366 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-22 04:34:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1866, 1799, 1866, 1799, 530, 1866, 530, 1866, 530]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 193 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 186 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 04:35:56] [INFO ] Invariant cache hit.
[2023-03-22 04:36:01] [INFO ] Implicit Places using invariants in 4899 ms returned []
Implicit Place search using SMT only with invariants took 4907 ms to find 0 implicit places.
[2023-03-22 04:36:01] [INFO ] Invariant cache hit.
[2023-03-22 04:36:06] [INFO ] Dead Transitions using invariants and state equation in 4618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9727 ms. Remains : 50000/50000 places, 50000/50000 transitions.
[2023-03-22 04:36:06] [INFO ] Invariant cache hit.
Finished random walk after 4638 steps, including 0 resets, run visited all 9 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5217 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5302 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5299 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5242 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5317 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5374 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5358 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5371 ms. (steps per millisecond=1 ) properties seen 2
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5312 ms. (steps per millisecond=1 ) properties seen 2
[2023-03-22 04:37:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000, 10000, 10000, 10000, 5000, 10000, 5000, 10000, 5000] Max seen :[1866, 1799, 1866, 1799, 530, 1866, 530, 1866, 530]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 226 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 237 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-22 04:38:49] [INFO ] Invariant cache hit.
[2023-03-22 04:38:53] [INFO ] Implicit Places using invariants in 4779 ms returned []
Implicit Place search using SMT only with invariants took 4781 ms to find 0 implicit places.
[2023-03-22 04:38:53] [INFO ] Invariant cache hit.
[2023-03-22 04:38:58] [INFO ] Dead Transitions using invariants and state equation in 4635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9656 ms. Remains : 50000/50000 places, 50000/50000 transitions.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-00
[2023-03-22 04:38:58] [INFO ] Invariant cache hit.
Finished random walk after 7799 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5463 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 04:39:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1410]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 18802 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18803 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 04:39:58] [INFO ] Computed 20000 place invariants in 66 ms
Finished random walk after 11993 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5448 ms. (steps per millisecond=1 )
[2023-03-22 04:40:33] [INFO ] Invariant cache hit.
[2023-03-22 04:41:12] [INFO ] [Real]Absence check using 20000 positive place invariants in 34278 ms returned sat
[2023-03-22 04:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:41:18] [INFO ] [Real]Absence check using state equation in 6407 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6291]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 140 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 136 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:41:18] [INFO ] Invariant cache hit.
[2023-03-22 04:41:21] [INFO ] Implicit Places using invariants in 2807 ms returned []
Implicit Place search using SMT only with invariants took 2813 ms to find 0 implicit places.
[2023-03-22 04:41:21] [INFO ] Invariant cache hit.
[2023-03-22 04:41:24] [INFO ] Dead Transitions using invariants and state equation in 2813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5767 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:41:24] [INFO ] Invariant cache hit.
Finished random walk after 12076 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5454 ms. (steps per millisecond=1 )
[2023-03-22 04:42:00] [INFO ] Invariant cache hit.
[2023-03-22 04:42:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 34666 ms returned sat
[2023-03-22 04:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:42:45] [INFO ] [Real]Absence check using state equation in 6085 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6291]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 167 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 124 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:42:45] [INFO ] Invariant cache hit.
[2023-03-22 04:42:48] [INFO ] Implicit Places using invariants in 2821 ms returned []
Implicit Place search using SMT only with invariants took 2823 ms to find 0 implicit places.
[2023-03-22 04:42:48] [INFO ] Invariant cache hit.
[2023-03-22 04:42:51] [INFO ] Dead Transitions using invariants and state equation in 3161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6110 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-00 in 233022 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-01
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 04:42:51] [INFO ] Computed 20000 place invariants in 181 ms
Finished random walk after 8068 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5121 ms. (steps per millisecond=1 )
[2023-03-22 04:43:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1448]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 17288 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17289 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 04:43:49] [INFO ] Computed 20000 place invariants in 49 ms
Finished random walk after 12340 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5250 ms. (steps per millisecond=1 )
[2023-03-22 04:44:24] [INFO ] Invariant cache hit.
[2023-03-22 04:45:05] [INFO ] [Real]Absence check using 20000 positive place invariants in 35628 ms returned sat
[2023-03-22 04:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:45:09] [INFO ] [Real]Absence check using state equation in 4742 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6300]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 124 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:45:10] [INFO ] Invariant cache hit.
[2023-03-22 04:45:13] [INFO ] Implicit Places using invariants in 2991 ms returned []
Implicit Place search using SMT only with invariants took 2992 ms to find 0 implicit places.
[2023-03-22 04:45:13] [INFO ] Invariant cache hit.
[2023-03-22 04:45:16] [INFO ] Dead Transitions using invariants and state equation in 3000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6121 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:45:16] [INFO ] Invariant cache hit.
Finished random walk after 12473 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5615 ms. (steps per millisecond=1 )
[2023-03-22 04:45:51] [INFO ] Invariant cache hit.
[2023-03-22 04:46:30] [INFO ] [Real]Absence check using 20000 positive place invariants in 34312 ms returned sat
[2023-03-22 04:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:46:36] [INFO ] [Real]Absence check using state equation in 6324 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6329]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 131 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 127 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:46:37] [INFO ] Invariant cache hit.
[2023-03-22 04:46:40] [INFO ] Implicit Places using invariants in 2900 ms returned []
Implicit Place search using SMT only with invariants took 2901 ms to find 0 implicit places.
[2023-03-22 04:46:40] [INFO ] Invariant cache hit.
[2023-03-22 04:46:42] [INFO ] Dead Transitions using invariants and state equation in 2887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5919 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:46:43] [INFO ] Invariant cache hit.
Finished random walk after 12545 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5119 ms. (steps per millisecond=1 )
[2023-03-22 04:47:18] [INFO ] Invariant cache hit.
[2023-03-22 04:47:58] [INFO ] [Real]Absence check using 20000 positive place invariants in 35902 ms returned sat
[2023-03-22 04:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:48:03] [INFO ] [Real]Absence check using state equation in 4754 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6480]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 126 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:48:03] [INFO ] Invariant cache hit.
[2023-03-22 04:48:06] [INFO ] Implicit Places using invariants in 2809 ms returned []
Implicit Place search using SMT only with invariants took 2811 ms to find 0 implicit places.
[2023-03-22 04:48:06] [INFO ] Invariant cache hit.
[2023-03-22 04:48:09] [INFO ] Dead Transitions using invariants and state equation in 2798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5732 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:48:09] [INFO ] Invariant cache hit.
Finished random walk after 12538 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5616 ms. (steps per millisecond=1 )
[2023-03-22 04:48:44] [INFO ] Invariant cache hit.
[2023-03-22 04:49:25] [INFO ] [Real]Absence check using 20000 positive place invariants in 35839 ms returned sat
[2023-03-22 04:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:49:30] [INFO ] [Real]Absence check using state equation in 5001 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6480]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 202 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 191 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:49:30] [INFO ] Invariant cache hit.
[2023-03-22 04:49:33] [INFO ] Implicit Places using invariants in 3211 ms returned []
Implicit Place search using SMT only with invariants took 3215 ms to find 0 implicit places.
[2023-03-22 04:49:33] [INFO ] Invariant cache hit.
[2023-03-22 04:49:36] [INFO ] Dead Transitions using invariants and state equation in 2788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6197 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-01 in 404922 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-02
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 04:49:36] [INFO ] Computed 20000 place invariants in 162 ms
Finished random walk after 8026 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 04:50:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1401]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 7 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 19328 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19328 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 04:50:36] [INFO ] Computed 20000 place invariants in 41 ms
Finished random walk after 12469 steps, including 0 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5075 ms. (steps per millisecond=1 )
[2023-03-22 04:51:11] [INFO ] Invariant cache hit.
[2023-03-22 04:51:50] [INFO ] [Real]Absence check using 20000 positive place invariants in 34449 ms returned sat
[2023-03-22 04:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:51:56] [INFO ] [Real]Absence check using state equation in 6415 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6297]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 146 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 125 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:51:56] [INFO ] Invariant cache hit.
[2023-03-22 04:51:59] [INFO ] Implicit Places using invariants in 2894 ms returned []
Implicit Place search using SMT only with invariants took 2895 ms to find 0 implicit places.
[2023-03-22 04:51:59] [INFO ] Invariant cache hit.
[2023-03-22 04:52:02] [INFO ] Dead Transitions using invariants and state equation in 2791 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5814 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:52:02] [INFO ] Invariant cache hit.
Finished random walk after 12523 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5045 ms. (steps per millisecond=1 )
[2023-03-22 04:52:37] [INFO ] Invariant cache hit.
[2023-03-22 04:53:19] [INFO ] [Real]Absence check using 20000 positive place invariants in 37202 ms returned sat
[2023-03-22 04:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:53:22] [INFO ] [Real]Absence check using state equation in 3586 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6588]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 169 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 134 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:53:23] [INFO ] Invariant cache hit.
[2023-03-22 04:53:26] [INFO ] Implicit Places using invariants in 3012 ms returned []
Implicit Place search using SMT only with invariants took 3013 ms to find 0 implicit places.
[2023-03-22 04:53:26] [INFO ] Invariant cache hit.
[2023-03-22 04:53:28] [INFO ] Dead Transitions using invariants and state equation in 2978 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6127 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:53:29] [INFO ] Invariant cache hit.
Finished random walk after 12531 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5153 ms. (steps per millisecond=1 )
[2023-03-22 04:54:04] [INFO ] Invariant cache hit.
[2023-03-22 04:54:45] [INFO ] [Real]Absence check using 20000 positive place invariants in 36305 ms returned sat
[2023-03-22 04:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:54:49] [INFO ] [Real]Absence check using state equation in 4356 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6588]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 118 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:54:49] [INFO ] Invariant cache hit.
[2023-03-22 04:54:52] [INFO ] Implicit Places using invariants in 2976 ms returned []
Implicit Place search using SMT only with invariants took 2977 ms to find 0 implicit places.
[2023-03-22 04:54:52] [INFO ] Invariant cache hit.
[2023-03-22 04:54:55] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5836 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-02 in 318920 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-03
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 04:54:55] [INFO ] Computed 20000 place invariants in 133 ms
Finished random walk after 7793 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5593 ms. (steps per millisecond=1 )
[2023-03-22 04:55:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1442]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 10 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 16463 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16464 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 04:55:52] [INFO ] Computed 20000 place invariants in 50 ms
Finished random walk after 12618 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5098 ms. (steps per millisecond=1 )
[2023-03-22 04:56:27] [INFO ] Invariant cache hit.
[2023-03-22 04:57:07] [INFO ] [Real]Absence check using 20000 positive place invariants in 34973 ms returned sat
[2023-03-22 04:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:57:13] [INFO ] [Real]Absence check using state equation in 5676 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6521]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 145 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:57:13] [INFO ] Invariant cache hit.
[2023-03-22 04:57:16] [INFO ] Implicit Places using invariants in 2770 ms returned []
Implicit Place search using SMT only with invariants took 2775 ms to find 0 implicit places.
[2023-03-22 04:57:16] [INFO ] Invariant cache hit.
[2023-03-22 04:57:18] [INFO ] Dead Transitions using invariants and state equation in 2750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5649 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 04:57:18] [INFO ] Invariant cache hit.
Finished random walk after 12513 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5087 ms. (steps per millisecond=1 )
[2023-03-22 04:57:54] [INFO ] Invariant cache hit.
[2023-03-22 04:58:33] [INFO ] [Real]Absence check using 20000 positive place invariants in 35280 ms returned sat
[2023-03-22 04:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:58:39] [INFO ] [Real]Absence check using state equation in 5446 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6521]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 149 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 04:58:39] [INFO ] Invariant cache hit.
[2023-03-22 04:58:42] [INFO ] Implicit Places using invariants in 2849 ms returned []
Implicit Place search using SMT only with invariants took 2851 ms to find 0 implicit places.
[2023-03-22 04:58:42] [INFO ] Invariant cache hit.
[2023-03-22 04:58:45] [INFO ] Dead Transitions using invariants and state equation in 2965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5941 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-03 in 229917 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-04
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 04:58:45] [INFO ] Computed 20000 place invariants in 133 ms
Finished random walk after 8266 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 04:59:20] [INFO ] Invariant cache hit.
[2023-03-22 04:59:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [10000] Max seen :[266]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 24236 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24237 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 04:59:49] [INFO ] Computed 20000 place invariants in 69 ms
Finished random walk after 15773 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5626 ms. (steps per millisecond=1 )
[2023-03-22 05:00:25] [INFO ] Invariant cache hit.
[2023-03-22 05:01:10] [INFO ] [Real]Absence check using 20000 positive place invariants in 40847 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2794]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 120 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 125 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:01:11] [INFO ] Invariant cache hit.
[2023-03-22 05:01:13] [INFO ] Implicit Places using invariants in 2812 ms returned []
Implicit Place search using SMT only with invariants took 2813 ms to find 0 implicit places.
[2023-03-22 05:01:13] [INFO ] Invariant cache hit.
[2023-03-22 05:01:16] [INFO ] Dead Transitions using invariants and state equation in 2832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5771 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:01:16] [INFO ] Invariant cache hit.
Finished random walk after 15604 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5168 ms. (steps per millisecond=1 )
[2023-03-22 05:01:51] [INFO ] Invariant cache hit.
[2023-03-22 05:02:37] [INFO ] [Real]Absence check using 20000 positive place invariants in 40291 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2794]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 139 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:02:37] [INFO ] Invariant cache hit.
[2023-03-22 05:02:40] [INFO ] Implicit Places using invariants in 2764 ms returned []
Implicit Place search using SMT only with invariants took 2769 ms to find 0 implicit places.
[2023-03-22 05:02:40] [INFO ] Invariant cache hit.
[2023-03-22 05:02:42] [INFO ] Dead Transitions using invariants and state equation in 2883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5797 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-04 in 237700 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-07
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 05:02:43] [INFO ] Computed 20000 place invariants in 126 ms
Finished random walk after 7699 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5163 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 05:03:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1421]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 8 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 20589 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20590 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 05:03:44] [INFO ] Computed 20000 place invariants in 52 ms
Finished random walk after 12537 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5027 ms. (steps per millisecond=1 )
[2023-03-22 05:04:19] [INFO ] Invariant cache hit.
[2023-03-22 05:04:57] [INFO ] [Real]Absence check using 20000 positive place invariants in 33868 ms returned sat
[2023-03-22 05:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:05:04] [INFO ] [Real]Absence check using state equation in 6887 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6457]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 141 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 116 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:05:04] [INFO ] Invariant cache hit.
[2023-03-22 05:05:07] [INFO ] Implicit Places using invariants in 2755 ms returned []
Implicit Place search using SMT only with invariants took 2757 ms to find 0 implicit places.
[2023-03-22 05:05:07] [INFO ] Invariant cache hit.
[2023-03-22 05:05:10] [INFO ] Dead Transitions using invariants and state equation in 2840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5719 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:05:10] [INFO ] Invariant cache hit.
Finished random walk after 12580 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5089 ms. (steps per millisecond=1 )
[2023-03-22 05:05:45] [INFO ] Invariant cache hit.
[2023-03-22 05:06:24] [INFO ] [Real]Absence check using 20000 positive place invariants in 34271 ms returned sat
[2023-03-22 05:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:06:30] [INFO ] [Real]Absence check using state equation in 6312 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6472]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 145 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 117 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:06:30] [INFO ] Invariant cache hit.
[2023-03-22 05:06:33] [INFO ] Implicit Places using invariants in 2963 ms returned []
Implicit Place search using SMT only with invariants took 2964 ms to find 0 implicit places.
[2023-03-22 05:06:33] [INFO ] Invariant cache hit.
[2023-03-22 05:06:36] [INFO ] Dead Transitions using invariants and state equation in 2674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5760 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:06:36] [INFO ] Invariant cache hit.
Finished random walk after 12544 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 9001 steps, including 0 resets, run visited all 1 properties in 5642 ms. (steps per millisecond=1 )
[2023-03-22 05:07:12] [INFO ] Invariant cache hit.
[2023-03-22 05:07:49] [INFO ] [Real]Absence check using 20000 positive place invariants in 33115 ms returned sat
[2023-03-22 05:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:07:57] [INFO ] [Real]Absence check using state equation in 7685 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6472]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 184 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 135 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:07:57] [INFO ] Invariant cache hit.
[2023-03-22 05:08:00] [INFO ] Implicit Places using invariants in 2799 ms returned []
Implicit Place search using SMT only with invariants took 2800 ms to find 0 implicit places.
[2023-03-22 05:08:00] [INFO ] Invariant cache hit.
[2023-03-22 05:08:03] [INFO ] Dead Transitions using invariants and state equation in 2820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5760 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-07 in 320265 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-12
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 05:08:03] [INFO ] Computed 20000 place invariants in 123 ms
Finished random walk after 8215 steps, including 2 resets, run visited all 1 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5066 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 05:08:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[243]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 23490 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23491 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 05:09:07] [INFO ] Computed 20000 place invariants in 71 ms
Finished random walk after 15585 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5129 ms. (steps per millisecond=1 )
[2023-03-22 05:09:42] [INFO ] Invariant cache hit.
[2023-03-22 05:10:23] [INFO ] [Real]Absence check using 20000 positive place invariants in 36216 ms returned sat
[2023-03-22 05:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:10:27] [INFO ] [Real]Absence check using state equation in 4485 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2814]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 126 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 143 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:10:27] [INFO ] Invariant cache hit.
[2023-03-22 05:10:30] [INFO ] Implicit Places using invariants in 2823 ms returned []
Implicit Place search using SMT only with invariants took 2824 ms to find 0 implicit places.
[2023-03-22 05:10:30] [INFO ] Invariant cache hit.
[2023-03-22 05:10:33] [INFO ] Dead Transitions using invariants and state equation in 3135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6104 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:10:33] [INFO ] Invariant cache hit.
Finished random walk after 15544 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5063 ms. (steps per millisecond=1 )
[2023-03-22 05:11:08] [INFO ] Invariant cache hit.
[2023-03-22 05:11:53] [INFO ] [Real]Absence check using 20000 positive place invariants in 39599 ms returned sat
[2023-03-22 05:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:11:54] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [10000] Max seen :[2826]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 144 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 137 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:11:54] [INFO ] Invariant cache hit.
[2023-03-22 05:11:57] [INFO ] Implicit Places using invariants in 3095 ms returned []
Implicit Place search using SMT only with invariants took 3096 ms to find 0 implicit places.
[2023-03-22 05:11:57] [INFO ] Invariant cache hit.
[2023-03-22 05:12:00] [INFO ] Dead Transitions using invariants and state equation in 2975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6209 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:12:00] [INFO ] Invariant cache hit.
Finished random walk after 15505 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5119 ms. (steps per millisecond=1 )
[2023-03-22 05:12:35] [INFO ] Invariant cache hit.
[2023-03-22 05:13:17] [INFO ] [Real]Absence check using 20000 positive place invariants in 37280 ms returned sat
[2023-03-22 05:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:13:20] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [10000] Max seen :[2826]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 124 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 119 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:13:21] [INFO ] Invariant cache hit.
[2023-03-22 05:13:24] [INFO ] Implicit Places using invariants in 2947 ms returned []
Implicit Place search using SMT only with invariants took 2948 ms to find 0 implicit places.
[2023-03-22 05:13:24] [INFO ] Invariant cache hit.
[2023-03-22 05:13:26] [INFO ] Dead Transitions using invariants and state equation in 2963 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6032 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-12 in 323723 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-13
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 05:13:27] [INFO ] Computed 20000 place invariants in 128 ms
Finished random walk after 8168 steps, including 2 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 9001 steps, including 0 resets, run timeout after 5624 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 05:14:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[1379]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 9 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 30000 place count 40000 transition count 30000
Reduce places removed 10000 places and 0 transitions.
Drop transitions removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 20000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 17755 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17755 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 05:14:25] [INFO ] Computed 20000 place invariants in 43 ms
Finished random walk after 12548 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5072 ms. (steps per millisecond=1 )
[2023-03-22 05:15:00] [INFO ] Invariant cache hit.
[2023-03-22 05:15:39] [INFO ] [Real]Absence check using 20000 positive place invariants in 34558 ms returned sat
[2023-03-22 05:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:15:45] [INFO ] [Real]Absence check using state equation in 6173 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6527]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 121 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 113 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:15:46] [INFO ] Invariant cache hit.
[2023-03-22 05:15:49] [INFO ] Implicit Places using invariants in 2824 ms returned []
Implicit Place search using SMT only with invariants took 2826 ms to find 0 implicit places.
[2023-03-22 05:15:49] [INFO ] Invariant cache hit.
[2023-03-22 05:15:51] [INFO ] Dead Transitions using invariants and state equation in 2812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5753 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:15:51] [INFO ] Invariant cache hit.
Finished random walk after 12598 steps, including 0 resets, run visited all 1 properties in 30002 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5102 ms. (steps per millisecond=1 )
[2023-03-22 05:16:26] [INFO ] Invariant cache hit.
[2023-03-22 05:17:09] [INFO ] [Real]Absence check using 20000 positive place invariants in 38014 ms returned sat
[2023-03-22 05:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:17:12] [INFO ] [Real]Absence check using state equation in 2659 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[6527]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 115 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 122 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:17:12] [INFO ] Invariant cache hit.
[2023-03-22 05:17:15] [INFO ] Implicit Places using invariants in 2799 ms returned []
Implicit Place search using SMT only with invariants took 2801 ms to find 0 implicit places.
[2023-03-22 05:17:15] [INFO ] Invariant cache hit.
[2023-03-22 05:17:18] [INFO ] Dead Transitions using invariants and state equation in 2880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5803 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-13 in 231171 ms.
Starting property specific reduction for Philosophers-COL-010000-UpperBounds-14
// Phase 1: matrix 50000 rows 50000 cols
[2023-03-22 05:17:18] [INFO ] Computed 20000 place invariants in 123 ms
Finished random walk after 8169 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 8001 steps, including 0 resets, run timeout after 5188 ms. (steps per millisecond=1 ) properties seen 0
[2023-03-22 05:17:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [10000] Max seen :[248]
Support contains 10000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Free-agglomeration rule (complex) applied 20000 times.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 50000 transition count 30000
Reduce places removed 20000 places and 0 transitions.
Ensure Unique test removed 10000 transitions
Reduce isomorphic transitions removed 10000 transitions.
Iterating post reduction 0 with 30000 rules applied. Total rules applied 50000 place count 30000 transition count 20000
Applied a total of 50000 rules in 24246 ms. Remains 30000 /50000 variables (removed 20000) and now considering 20000/50000 (removed 30000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24247 ms. Remains : 30000/50000 places, 20000/50000 transitions.
// Phase 1: matrix 20000 rows 30000 cols
[2023-03-22 05:18:22] [INFO ] Computed 20000 place invariants in 52 ms
Finished random walk after 15436 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5129 ms. (steps per millisecond=1 )
[2023-03-22 05:18:58] [INFO ] Invariant cache hit.
[2023-03-22 05:19:41] [INFO ] [Real]Absence check using 20000 positive place invariants in 39196 ms returned sat
[2023-03-22 05:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:19:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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) : [10000] Max seen :[2806]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 151 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 115 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:19:43] [INFO ] Invariant cache hit.
[2023-03-22 05:19:46] [INFO ] Implicit Places using invariants in 2728 ms returned []
Implicit Place search using SMT only with invariants took 2730 ms to find 0 implicit places.
[2023-03-22 05:19:46] [INFO ] Invariant cache hit.
[2023-03-22 05:19:49] [INFO ] Dead Transitions using invariants and state equation in 2728 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5577 ms. Remains : 30000/30000 places, 20000/20000 transitions.
[2023-03-22 05:19:49] [INFO ] Invariant cache hit.
Finished random walk after 15170 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 8001 steps, including 0 resets, run visited all 1 properties in 5174 ms. (steps per millisecond=1 )
[2023-03-22 05:20:24] [INFO ] Invariant cache hit.
[2023-03-22 05:21:09] [INFO ] [Real]Absence check using 20000 positive place invariants in 40416 ms returned unknown
Current structural bounds on expressions (after SMT) : [10000] Max seen :[2806]
Support contains 10000 out of 30000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 133 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30000/30000 places, 20000/20000 transitions.
Applied a total of 0 rules in 128 ms. Remains 30000 /30000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2023-03-22 05:21:09] [INFO ] Invariant cache hit.
[2023-03-22 05:21:12] [INFO ] Implicit Places using invariants in 2822 ms returned []
Implicit Place search using SMT only with invariants took 2829 ms to find 0 implicit places.
[2023-03-22 05:21:12] [INFO ] Invariant cache hit.
[2023-03-22 05:21:15] [INFO ] Dead Transitions using invariants and state equation in 2655 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5616 ms. Remains : 30000/30000 places, 20000/20000 transitions.
Ending property specific reduction for Philosophers-COL-010000-UpperBounds-14 in 237082 ms.
[2023-03-22 05:21:17] [INFO ] Flatten gal took : 1809 ms
[2023-03-22 05:21:17] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 38 ms.
[2023-03-22 05:21:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50000 places, 50000 transitions and 160000 arcs took 145 ms.
Total runtime 3364135 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1240/ub_0_ --maxsum=/tmp/1240/ub_1_ --maxsum=/tmp/1240/ub_2_ --maxsum=/tmp/1240/ub_3_ --maxsum=/tmp/1240/ub_4_ --maxsum=/tmp/1240/ub_5_ --maxsum=/tmp/1240/ub_6_ --maxsum=/tmp/1240/ub_7_ --maxsum=/tmp/1240/ub_8_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11289380 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16055824 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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-COL-010000"
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-COL-010000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950100165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-010000.tgz
mv Philosophers-COL-010000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;