About the Execution of LTSMin+red for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1425.292 | 3600000.00 | 13246642.00 | 1623.70 | ? 7 7 7 8 7 8 8 8 8 8 7 8 8 8 8 | 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.r265-smll-167863540300597.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 Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.1K Feb 25 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 47K 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 Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679125494942
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=Peterson-COL-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 07:44:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 07:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 07:44:57] [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-18 07:44:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 07:44:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 866 ms
[2023-03-18 07:44:58] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-18 07:44:58] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 14 ms.
[2023-03-18 07:44:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-18 07:44:58] [INFO ] Computed 1 place invariants in 5 ms
FORMULA Peterson-COL-7-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 07:44:58] [INFO ] Invariant cache hit.
[2023-03-18 07:44:58] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-18 07:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-18 07:44:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-18 07:44:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-18 07:44:58] [INFO ] Added : 12 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 17 ms.
[2023-03-18 07:44:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-18 07:44:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 13 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 7 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-18 07:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 07:44:59] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 7 ms.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:44:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 07:44:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 07:44:59] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-18 07:45:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-18 07:45:00] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 07:45:00] [INFO ] Added : 11 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 07:45:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-18 07:45:00] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 07:45:00] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-18 07:45:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 07:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 07:45:00] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 07:45:00] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-18 07:45:00] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 100 ms.
[2023-03-18 07:45:00] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 56 places in 34 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 13) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :57
FORMULA Peterson-COL-7-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :22
FORMULA Peterson-COL-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :37
FORMULA Peterson-COL-7-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :11
FORMULA Peterson-COL-7-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :26
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-18 07:45:01] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 07:45:01] [INFO ] Computed 31 place invariants in 48 ms
[2023-03-18 07:45:02] [INFO ] [Real]Absence check using 23 positive place invariants in 55 ms returned sat
[2023-03-18 07:45:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:03] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2023-03-18 07:45:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 54 ms returned sat
[2023-03-18 07:45:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-18 07:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:05] [INFO ] [Nat]Absence check using state equation in 1328 ms returned sat
[2023-03-18 07:45:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:45:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 383 ms returned sat
[2023-03-18 07:45:07] [INFO ] Deduced a trap composed of 13 places in 1603 ms of which 8 ms to minimize.
[2023-03-18 07:45:09] [INFO ] Deduced a trap composed of 17 places in 1560 ms of which 3 ms to minimize.
[2023-03-18 07:45:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
[2023-03-18 07:45:09] [INFO ] [Real]Absence check using 23 positive place invariants in 55 ms returned sat
[2023-03-18 07:45:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-18 07:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:11] [INFO ] [Real]Absence check using state equation in 1308 ms returned sat
[2023-03-18 07:45:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 54 ms returned sat
[2023-03-18 07:45:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:13] [INFO ] [Nat]Absence check using state equation in 1458 ms returned sat
[2023-03-18 07:45:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 381 ms returned sat
[2023-03-18 07:45:15] [INFO ] Deduced a trap composed of 32 places in 1689 ms of which 3 ms to minimize.
[2023-03-18 07:45:17] [INFO ] Deduced a trap composed of 33 places in 1735 ms of which 3 ms to minimize.
[2023-03-18 07:45:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
[2023-03-18 07:45:17] [INFO ] [Real]Absence check using 23 positive place invariants in 54 ms returned sat
[2023-03-18 07:45:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-18 07:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:18] [INFO ] [Real]Absence check using state equation in 1400 ms returned sat
[2023-03-18 07:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 55 ms returned sat
[2023-03-18 07:45:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:20] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2023-03-18 07:45:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 369 ms returned sat
[2023-03-18 07:45:23] [INFO ] Deduced a trap composed of 32 places in 1887 ms of which 2 ms to minimize.
[2023-03-18 07:45:25] [INFO ] Deduced a trap composed of 33 places in 1940 ms of which 4 ms to minimize.
[2023-03-18 07:45:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
[2023-03-18 07:45:25] [INFO ] [Real]Absence check using 23 positive place invariants in 51 ms returned sat
[2023-03-18 07:45:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-18 07:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:26] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2023-03-18 07:45:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 52 ms returned sat
[2023-03-18 07:45:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:28] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2023-03-18 07:45:28] [INFO ] [Nat]Added 497 Read/Feed constraints in 371 ms returned sat
[2023-03-18 07:45:31] [INFO ] Deduced a trap composed of 42 places in 2046 ms of which 2 ms to minimize.
[2023-03-18 07:45:33] [INFO ] Deduced a trap composed of 96 places in 1978 ms of which 2 ms to minimize.
[2023-03-18 07:45:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
[2023-03-18 07:45:33] [INFO ] [Real]Absence check using 23 positive place invariants in 55 ms returned sat
[2023-03-18 07:45:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:34] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2023-03-18 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 58 ms returned sat
[2023-03-18 07:45:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-18 07:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:36] [INFO ] [Nat]Absence check using state equation in 1356 ms returned sat
[2023-03-18 07:45:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 364 ms returned sat
[2023-03-18 07:45:39] [INFO ] Deduced a trap composed of 32 places in 1855 ms of which 3 ms to minimize.
[2023-03-18 07:45:41] [INFO ] Deduced a trap composed of 33 places in 1852 ms of which 2 ms to minimize.
[2023-03-18 07:45:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
[2023-03-18 07:45:41] [INFO ] [Real]Absence check using 23 positive place invariants in 54 ms returned sat
[2023-03-18 07:45:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-18 07:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:42] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2023-03-18 07:45:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:45:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 52 ms returned sat
[2023-03-18 07:45:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 07:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:45:44] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2023-03-18 07:45:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 388 ms returned sat
[2023-03-18 07:45:46] [INFO ] Deduced a trap composed of 42 places in 1991 ms of which 2 ms to minimize.
[2023-03-18 07:45:48] [INFO ] Deduced a trap composed of 96 places in 1895 ms of which 2 ms to minimize.
[2023-03-18 07:45:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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) : [8, 8, 8, 8, 8, 8] Max seen :[1, 7, 7, 4, 7, 4]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 486 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 1152/1992 places, 2256/3096 transitions.
Normalized transition count is 1920 out of 2256 initially.
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-18 07:45:49] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20154 ms. (steps per millisecond=49 ) properties (out of 6) seen :25
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3006 ms. (steps per millisecond=332 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3927 ms. (steps per millisecond=254 ) properties (out of 6) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3918 ms. (steps per millisecond=255 ) properties (out of 6) seen :23
Interrupted Best-First random walk after 494605 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3857 ms. (steps per millisecond=259 ) properties (out of 6) seen :23
Finished Best-First random walk after 510580 steps, including 1 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=102 )
[2023-03-18 07:46:34] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-18 07:46:34] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-18 07:46:34] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-18 07:46:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 07:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:46:35] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-18 07:46:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:46:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 07:46:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-18 07:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:46:36] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2023-03-18 07:46:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:46:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 273 ms returned sat
[2023-03-18 07:46:37] [INFO ] Deduced a trap composed of 32 places in 753 ms of which 1 ms to minimize.
[2023-03-18 07:46:38] [INFO ] Deduced a trap composed of 28 places in 834 ms of which 2 ms to minimize.
[2023-03-18 07:46:39] [INFO ] Deduced a trap composed of 49 places in 822 ms of which 1 ms to minimize.
[2023-03-18 07:46:40] [INFO ] Deduced a trap composed of 15 places in 912 ms of which 2 ms to minimize.
[2023-03-18 07:46:41] [INFO ] Deduced a trap composed of 13 places in 815 ms of which 1 ms to minimize.
[2023-03-18 07:46:42] [INFO ] Deduced a trap composed of 105 places in 909 ms of which 2 ms to minimize.
[2023-03-18 07:46:43] [INFO ] Deduced a trap composed of 57 places in 904 ms of which 2 ms to minimize.
[2023-03-18 07:46:44] [INFO ] Deduced a trap composed of 13 places in 837 ms of which 1 ms to minimize.
[2023-03-18 07:46:45] [INFO ] Deduced a trap composed of 57 places in 863 ms of which 1 ms to minimize.
[2023-03-18 07:46:46] [INFO ] Deduced a trap composed of 58 places in 859 ms of which 1 ms to minimize.
[2023-03-18 07:46:47] [INFO ] Deduced a trap composed of 13 places in 899 ms of which 2 ms to minimize.
[2023-03-18 07:46:48] [INFO ] Deduced a trap composed of 75 places in 885 ms of which 2 ms to minimize.
[2023-03-18 07:46:49] [INFO ] Deduced a trap composed of 72 places in 820 ms of which 1 ms to minimize.
[2023-03-18 07:46:50] [INFO ] Deduced a trap composed of 53 places in 887 ms of which 2 ms to minimize.
[2023-03-18 07:46:51] [INFO ] Deduced a trap composed of 45 places in 879 ms of which 1 ms to minimize.
[2023-03-18 07:46:52] [INFO ] Deduced a trap composed of 34 places in 870 ms of which 2 ms to minimize.
[2023-03-18 07:46:53] [INFO ] Deduced a trap composed of 52 places in 912 ms of which 1 ms to minimize.
[2023-03-18 07:46:54] [INFO ] Deduced a trap composed of 25 places in 952 ms of which 2 ms to minimize.
[2023-03-18 07:46:55] [INFO ] Deduced a trap composed of 69 places in 926 ms of which 1 ms to minimize.
[2023-03-18 07:46:56] [INFO ] Deduced a trap composed of 76 places in 846 ms of which 1 ms to minimize.
[2023-03-18 07:46:57] [INFO ] Deduced a trap composed of 34 places in 842 ms of which 1 ms to minimize.
[2023-03-18 07:46:58] [INFO ] Deduced a trap composed of 82 places in 933 ms of which 2 ms to minimize.
[2023-03-18 07:46:59] [INFO ] Deduced a trap composed of 28 places in 868 ms of which 4 ms to minimize.
[2023-03-18 07:47:00] [INFO ] Deduced a trap composed of 76 places in 912 ms of which 1 ms to minimize.
[2023-03-18 07:47:01] [INFO ] Deduced a trap composed of 15 places in 855 ms of which 1 ms to minimize.
[2023-03-18 07:47:02] [INFO ] Deduced a trap composed of 15 places in 905 ms of which 1 ms to minimize.
[2023-03-18 07:47:03] [INFO ] Deduced a trap composed of 86 places in 941 ms of which 1 ms to minimize.
[2023-03-18 07:47:04] [INFO ] Deduced a trap composed of 63 places in 825 ms of which 1 ms to minimize.
[2023-03-18 07:47:05] [INFO ] Deduced a trap composed of 93 places in 847 ms of which 2 ms to minimize.
[2023-03-18 07:47:06] [INFO ] Deduced a trap composed of 51 places in 922 ms of which 1 ms to minimize.
[2023-03-18 07:47:07] [INFO ] Deduced a trap composed of 44 places in 933 ms of which 2 ms to minimize.
[2023-03-18 07:47:08] [INFO ] Deduced a trap composed of 51 places in 900 ms of which 2 ms to minimize.
[2023-03-18 07:47:09] [INFO ] Deduced a trap composed of 43 places in 890 ms of which 2 ms to minimize.
[2023-03-18 07:47:10] [INFO ] Deduced a trap composed of 32 places in 719 ms of which 1 ms to minimize.
[2023-03-18 07:47:11] [INFO ] Deduced a trap composed of 45 places in 760 ms of which 1 ms to minimize.
[2023-03-18 07:47:12] [INFO ] Deduced a trap composed of 86 places in 779 ms of which 1 ms to minimize.
[2023-03-18 07:47:13] [INFO ] Deduced a trap composed of 79 places in 842 ms of which 1 ms to minimize.
[2023-03-18 07:47:14] [INFO ] Deduced a trap composed of 44 places in 833 ms of which 2 ms to minimize.
[2023-03-18 07:47:15] [INFO ] Deduced a trap composed of 53 places in 864 ms of which 2 ms to minimize.
[2023-03-18 07:47:16] [INFO ] Deduced a trap composed of 34 places in 815 ms of which 2 ms to minimize.
[2023-03-18 07:47:19] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 42615 ms
[2023-03-18 07:47:19] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 07:47:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 07:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:20] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2023-03-18 07:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:47:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-18 07:47:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 07:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:21] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-18 07:47:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 188 ms returned sat
[2023-03-18 07:47:22] [INFO ] Deduced a trap composed of 25 places in 686 ms of which 1 ms to minimize.
[2023-03-18 07:47:23] [INFO ] Deduced a trap composed of 21 places in 948 ms of which 1 ms to minimize.
[2023-03-18 07:47:24] [INFO ] Deduced a trap composed of 25 places in 899 ms of which 1 ms to minimize.
[2023-03-18 07:47:25] [INFO ] Deduced a trap composed of 25 places in 943 ms of which 2 ms to minimize.
[2023-03-18 07:47:26] [INFO ] Deduced a trap composed of 25 places in 979 ms of which 7 ms to minimize.
[2023-03-18 07:47:27] [INFO ] Deduced a trap composed of 25 places in 929 ms of which 2 ms to minimize.
[2023-03-18 07:47:28] [INFO ] Deduced a trap composed of 22 places in 871 ms of which 1 ms to minimize.
[2023-03-18 07:47:29] [INFO ] Deduced a trap composed of 21 places in 913 ms of which 1 ms to minimize.
[2023-03-18 07:47:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7871 ms
[2023-03-18 07:47:29] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-18 07:47:29] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 07:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:30] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2023-03-18 07:47:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:47:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-18 07:47:30] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 07:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:31] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-18 07:47:31] [INFO ] [Nat]Added 497 Read/Feed constraints in 194 ms returned sat
[2023-03-18 07:47:32] [INFO ] Deduced a trap composed of 25 places in 984 ms of which 1 ms to minimize.
[2023-03-18 07:47:33] [INFO ] Deduced a trap composed of 21 places in 829 ms of which 1 ms to minimize.
[2023-03-18 07:47:34] [INFO ] Deduced a trap composed of 25 places in 970 ms of which 2 ms to minimize.
[2023-03-18 07:47:35] [INFO ] Deduced a trap composed of 25 places in 894 ms of which 1 ms to minimize.
[2023-03-18 07:47:36] [INFO ] Deduced a trap composed of 25 places in 881 ms of which 1 ms to minimize.
[2023-03-18 07:47:37] [INFO ] Deduced a trap composed of 25 places in 877 ms of which 1 ms to minimize.
[2023-03-18 07:47:38] [INFO ] Deduced a trap composed of 22 places in 945 ms of which 3 ms to minimize.
[2023-03-18 07:47:39] [INFO ] Deduced a trap composed of 21 places in 846 ms of which 5 ms to minimize.
[2023-03-18 07:47:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7863 ms
[2023-03-18 07:47:39] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-18 07:47:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-18 07:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:40] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2023-03-18 07:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:47:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-18 07:47:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 07:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:47:41] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2023-03-18 07:47:41] [INFO ] [Nat]Added 497 Read/Feed constraints in 255 ms returned sat
[2023-03-18 07:47:42] [INFO ] Deduced a trap composed of 134 places in 1029 ms of which 3 ms to minimize.
[2023-03-18 07:47:43] [INFO ] Deduced a trap composed of 91 places in 1145 ms of which 2 ms to minimize.
[2023-03-18 07:47:44] [INFO ] Deduced a trap composed of 130 places in 1038 ms of which 2 ms to minimize.
[2023-03-18 07:47:46] [INFO ] Deduced a trap composed of 97 places in 1218 ms of which 2 ms to minimize.
[2023-03-18 07:47:47] [INFO ] Deduced a trap composed of 70 places in 986 ms of which 2 ms to minimize.
[2023-03-18 07:47:48] [INFO ] Deduced a trap composed of 147 places in 1030 ms of which 1 ms to minimize.
[2023-03-18 07:47:49] [INFO ] Deduced a trap composed of 167 places in 894 ms of which 1 ms to minimize.
[2023-03-18 07:47:50] [INFO ] Deduced a trap composed of 145 places in 921 ms of which 2 ms to minimize.
[2023-03-18 07:47:51] [INFO ] Deduced a trap composed of 151 places in 932 ms of which 2 ms to minimize.
[2023-03-18 07:47:52] [INFO ] Deduced a trap composed of 106 places in 934 ms of which 2 ms to minimize.
[2023-03-18 07:47:53] [INFO ] Deduced a trap composed of 128 places in 939 ms of which 2 ms to minimize.
[2023-03-18 07:47:54] [INFO ] Deduced a trap composed of 93 places in 916 ms of which 1 ms to minimize.
[2023-03-18 07:47:55] [INFO ] Deduced a trap composed of 143 places in 796 ms of which 1 ms to minimize.
[2023-03-18 07:47:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14241 ms
[2023-03-18 07:47:55] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 178 ms.
[2023-03-18 07:48:00] [INFO ] Deduced a trap composed of 36 places in 893 ms of which 1 ms to minimize.
[2023-03-18 07:48:01] [INFO ] Deduced a trap composed of 58 places in 1000 ms of which 1 ms to minimize.
[2023-03-18 07:48:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2340 ms
[2023-03-18 07:48:02] [INFO ] Added : 128 causal constraints over 26 iterations in 6772 ms. Result :sat
Minimization took 969 ms.
[2023-03-18 07:48:03] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-18 07:48:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 07:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:04] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2023-03-18 07:48:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:48:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-18 07:48:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 07:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:05] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2023-03-18 07:48:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 189 ms returned sat
[2023-03-18 07:48:06] [INFO ] Deduced a trap composed of 25 places in 918 ms of which 2 ms to minimize.
[2023-03-18 07:48:07] [INFO ] Deduced a trap composed of 21 places in 984 ms of which 1 ms to minimize.
[2023-03-18 07:48:08] [INFO ] Deduced a trap composed of 25 places in 956 ms of which 1 ms to minimize.
[2023-03-18 07:48:09] [INFO ] Deduced a trap composed of 25 places in 747 ms of which 2 ms to minimize.
[2023-03-18 07:48:10] [INFO ] Deduced a trap composed of 25 places in 918 ms of which 1 ms to minimize.
[2023-03-18 07:48:11] [INFO ] Deduced a trap composed of 25 places in 818 ms of which 1 ms to minimize.
[2023-03-18 07:48:12] [INFO ] Deduced a trap composed of 22 places in 905 ms of which 1 ms to minimize.
[2023-03-18 07:48:13] [INFO ] Deduced a trap composed of 21 places in 998 ms of which 1 ms to minimize.
[2023-03-18 07:48:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7979 ms
[2023-03-18 07:48:13] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-18 07:48:13] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 07:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:14] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2023-03-18 07:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:48:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-18 07:48:14] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 07:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:15] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2023-03-18 07:48:15] [INFO ] [Nat]Added 497 Read/Feed constraints in 246 ms returned sat
[2023-03-18 07:48:16] [INFO ] Deduced a trap composed of 134 places in 1040 ms of which 2 ms to minimize.
[2023-03-18 07:48:18] [INFO ] Deduced a trap composed of 91 places in 1142 ms of which 2 ms to minimize.
[2023-03-18 07:48:19] [INFO ] Deduced a trap composed of 130 places in 1003 ms of which 2 ms to minimize.
[2023-03-18 07:48:20] [INFO ] Deduced a trap composed of 97 places in 1177 ms of which 2 ms to minimize.
[2023-03-18 07:48:21] [INFO ] Deduced a trap composed of 70 places in 1011 ms of which 1 ms to minimize.
[2023-03-18 07:48:22] [INFO ] Deduced a trap composed of 147 places in 1057 ms of which 1 ms to minimize.
[2023-03-18 07:48:24] [INFO ] Deduced a trap composed of 167 places in 1046 ms of which 2 ms to minimize.
[2023-03-18 07:48:25] [INFO ] Deduced a trap composed of 145 places in 1041 ms of which 2 ms to minimize.
[2023-03-18 07:48:26] [INFO ] Deduced a trap composed of 151 places in 884 ms of which 2 ms to minimize.
[2023-03-18 07:48:27] [INFO ] Deduced a trap composed of 106 places in 946 ms of which 1 ms to minimize.
[2023-03-18 07:48:28] [INFO ] Deduced a trap composed of 128 places in 969 ms of which 2 ms to minimize.
[2023-03-18 07:48:29] [INFO ] Deduced a trap composed of 93 places in 920 ms of which 2 ms to minimize.
[2023-03-18 07:48:30] [INFO ] Deduced a trap composed of 143 places in 902 ms of which 1 ms to minimize.
[2023-03-18 07:48:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14695 ms
[2023-03-18 07:48:30] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 259 ms.
[2023-03-18 07:48:35] [INFO ] Deduced a trap composed of 36 places in 945 ms of which 2 ms to minimize.
[2023-03-18 07:48:36] [INFO ] Deduced a trap composed of 58 places in 889 ms of which 1 ms to minimize.
[2023-03-18 07:48:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2263 ms
[2023-03-18 07:48:37] [INFO ] Added : 128 causal constraints over 26 iterations in 6742 ms. Result :sat
Minimization took 968 ms.
Current structural bounds on expressions (after SMT) : [8, 7, 7, 8, 7, 8] Max seen :[1, 7, 7, 6, 7, 6]
FORMULA Peterson-COL-7-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-7-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1152 transition count 2151
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 1047 transition count 2151
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 391 Pre rules applied. Total rules applied 210 place count 1047 transition count 1760
Deduced a syphon composed of 391 places in 4 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 992 place count 656 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1104 place count 600 transition count 1704
Applied a total of 1104 rules in 298 ms. Remains 600 /1152 variables (removed 552) and now considering 1704/2256 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 600/1152 places, 1704/2256 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 600 cols
[2023-03-18 07:48:47] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2618 ms. (steps per millisecond=381 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :1
[2023-03-18 07:48:50] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2023-03-18 07:48:50] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-18 07:48:51] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-18 07:48:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-18 07:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:51] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-18 07:48:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:48:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-18 07:48:51] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-18 07:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:48:52] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-18 07:48:52] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:48:52] [INFO ] [Nat]Added 497 Read/Feed constraints in 96 ms returned sat
[2023-03-18 07:48:52] [INFO ] Deduced a trap composed of 20 places in 386 ms of which 1 ms to minimize.
[2023-03-18 07:48:53] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 1 ms to minimize.
[2023-03-18 07:48:53] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 1 ms to minimize.
[2023-03-18 07:48:53] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2023-03-18 07:48:54] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2023-03-18 07:48:55] [INFO ] Deduced a trap composed of 42 places in 470 ms of which 1 ms to minimize.
[2023-03-18 07:48:55] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 1 ms to minimize.
[2023-03-18 07:48:55] [INFO ] Deduced a trap composed of 30 places in 399 ms of which 1 ms to minimize.
[2023-03-18 07:48:56] [INFO ] Deduced a trap composed of 51 places in 427 ms of which 1 ms to minimize.
[2023-03-18 07:48:56] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 1 ms to minimize.
[2023-03-18 07:48:57] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2023-03-18 07:48:57] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 1 ms to minimize.
[2023-03-18 07:48:58] [INFO ] Deduced a trap composed of 51 places in 392 ms of which 2 ms to minimize.
[2023-03-18 07:48:58] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 1 ms to minimize.
[2023-03-18 07:48:59] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 1 ms to minimize.
[2023-03-18 07:48:59] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 1 ms to minimize.
[2023-03-18 07:49:00] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 1 ms to minimize.
[2023-03-18 07:49:00] [INFO ] Deduced a trap composed of 74 places in 401 ms of which 0 ms to minimize.
[2023-03-18 07:49:01] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 1 ms to minimize.
[2023-03-18 07:49:01] [INFO ] Deduced a trap composed of 68 places in 411 ms of which 0 ms to minimize.
[2023-03-18 07:49:02] [INFO ] Deduced a trap composed of 28 places in 375 ms of which 1 ms to minimize.
[2023-03-18 07:49:02] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 0 ms to minimize.
[2023-03-18 07:49:02] [INFO ] Deduced a trap composed of 36 places in 391 ms of which 1 ms to minimize.
[2023-03-18 07:49:03] [INFO ] Deduced a trap composed of 51 places in 435 ms of which 1 ms to minimize.
[2023-03-18 07:49:03] [INFO ] Deduced a trap composed of 20 places in 481 ms of which 1 ms to minimize.
[2023-03-18 07:49:04] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 1 ms to minimize.
[2023-03-18 07:49:04] [INFO ] Deduced a trap composed of 22 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:49:05] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 0 ms to minimize.
[2023-03-18 07:49:06] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2023-03-18 07:49:06] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 2 ms to minimize.
[2023-03-18 07:49:07] [INFO ] Deduced a trap composed of 63 places in 504 ms of which 1 ms to minimize.
[2023-03-18 07:49:07] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2023-03-18 07:49:08] [INFO ] Deduced a trap composed of 28 places in 497 ms of which 1 ms to minimize.
[2023-03-18 07:49:08] [INFO ] Deduced a trap composed of 46 places in 421 ms of which 1 ms to minimize.
[2023-03-18 07:49:09] [INFO ] Deduced a trap composed of 79 places in 485 ms of which 1 ms to minimize.
[2023-03-18 07:49:09] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 0 ms to minimize.
[2023-03-18 07:49:10] [INFO ] Deduced a trap composed of 53 places in 424 ms of which 3 ms to minimize.
[2023-03-18 07:49:10] [INFO ] Deduced a trap composed of 75 places in 481 ms of which 1 ms to minimize.
[2023-03-18 07:49:11] [INFO ] Deduced a trap composed of 89 places in 434 ms of which 1 ms to minimize.
[2023-03-18 07:49:12] [INFO ] Deduced a trap composed of 58 places in 440 ms of which 1 ms to minimize.
[2023-03-18 07:49:12] [INFO ] Deduced a trap composed of 46 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:49:12] [INFO ] Deduced a trap composed of 12 places in 425 ms of which 1 ms to minimize.
[2023-03-18 07:49:13] [INFO ] Deduced a trap composed of 29 places in 451 ms of which 1 ms to minimize.
[2023-03-18 07:49:13] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 1 ms to minimize.
[2023-03-18 07:49:14] [INFO ] Deduced a trap composed of 36 places in 385 ms of which 0 ms to minimize.
[2023-03-18 07:49:14] [INFO ] Deduced a trap composed of 37 places in 376 ms of which 1 ms to minimize.
[2023-03-18 07:49:15] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2023-03-18 07:49:15] [INFO ] Deduced a trap composed of 56 places in 524 ms of which 1 ms to minimize.
[2023-03-18 07:49:16] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 2 ms to minimize.
[2023-03-18 07:49:16] [INFO ] Deduced a trap composed of 20 places in 504 ms of which 1 ms to minimize.
[2023-03-18 07:49:17] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 1 ms to minimize.
[2023-03-18 07:49:17] [INFO ] Deduced a trap composed of 52 places in 501 ms of which 0 ms to minimize.
[2023-03-18 07:49:18] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 1 ms to minimize.
[2023-03-18 07:49:18] [INFO ] Deduced a trap composed of 37 places in 401 ms of which 1 ms to minimize.
[2023-03-18 07:49:19] [INFO ] Deduced a trap composed of 28 places in 427 ms of which 1 ms to minimize.
[2023-03-18 07:49:19] [INFO ] Deduced a trap composed of 36 places in 514 ms of which 1 ms to minimize.
[2023-03-18 07:49:20] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2023-03-18 07:49:20] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 1 ms to minimize.
[2023-03-18 07:49:21] [INFO ] Deduced a trap composed of 27 places in 368 ms of which 1 ms to minimize.
[2023-03-18 07:49:21] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 1 ms to minimize.
[2023-03-18 07:49:22] [INFO ] Deduced a trap composed of 67 places in 386 ms of which 1 ms to minimize.
[2023-03-18 07:49:22] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 1 ms to minimize.
[2023-03-18 07:49:23] [INFO ] Deduced a trap composed of 67 places in 351 ms of which 1 ms to minimize.
[2023-03-18 07:49:23] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 0 ms to minimize.
[2023-03-18 07:49:24] [INFO ] Deduced a trap composed of 58 places in 363 ms of which 1 ms to minimize.
[2023-03-18 07:49:24] [INFO ] Deduced a trap composed of 30 places in 379 ms of which 0 ms to minimize.
[2023-03-18 07:49:25] [INFO ] Deduced a trap composed of 39 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:49:25] [INFO ] Deduced a trap composed of 22 places in 357 ms of which 1 ms to minimize.
[2023-03-18 07:49:26] [INFO ] Deduced a trap composed of 71 places in 375 ms of which 1 ms to minimize.
[2023-03-18 07:49:26] [INFO ] Deduced a trap composed of 24 places in 363 ms of which 1 ms to minimize.
[2023-03-18 07:49:27] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 1 ms to minimize.
[2023-03-18 07:49:27] [INFO ] Deduced a trap composed of 29 places in 337 ms of which 1 ms to minimize.
[2023-03-18 07:49:28] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 1 ms to minimize.
[2023-03-18 07:49:28] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 1 ms to minimize.
[2023-03-18 07:49:29] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 0 ms to minimize.
[2023-03-18 07:49:29] [INFO ] Deduced a trap composed of 39 places in 406 ms of which 1 ms to minimize.
[2023-03-18 07:49:30] [INFO ] Deduced a trap composed of 61 places in 403 ms of which 1 ms to minimize.
[2023-03-18 07:49:30] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:49:31] [INFO ] Deduced a trap composed of 22 places in 390 ms of which 1 ms to minimize.
[2023-03-18 07:49:31] [INFO ] Deduced a trap composed of 27 places in 392 ms of which 1 ms to minimize.
[2023-03-18 07:49:32] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 1 ms to minimize.
[2023-03-18 07:49:32] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 1 ms to minimize.
[2023-03-18 07:49:33] [INFO ] Deduced a trap composed of 46 places in 373 ms of which 1 ms to minimize.
[2023-03-18 07:49:33] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 1 ms to minimize.
[2023-03-18 07:49:33] [INFO ] Deduced a trap composed of 36 places in 376 ms of which 1 ms to minimize.
[2023-03-18 07:49:34] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 1 ms to minimize.
[2023-03-18 07:49:34] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 1 ms to minimize.
[2023-03-18 07:49:35] [INFO ] Deduced a trap composed of 80 places in 511 ms of which 1 ms to minimize.
[2023-03-18 07:49:35] [INFO ] Deduced a trap composed of 27 places in 405 ms of which 2 ms to minimize.
[2023-03-18 07:49:36] [INFO ] Deduced a trap composed of 52 places in 484 ms of which 1 ms to minimize.
[2023-03-18 07:49:36] [INFO ] Deduced a trap composed of 48 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:49:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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) : [8] Max seen :[1]
Support contains 8 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 51 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 600/600 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 43 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-18 07:49:36] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:49:37] [INFO ] Invariant cache hit.
[2023-03-18 07:49:37] [INFO ] Implicit Places using invariants in 757 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 761 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 592/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 40 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 844 ms. Remains : 592/600 places, 1704/1704 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:49:37] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2768 ms. (steps per millisecond=361 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :1
[2023-03-18 07:49:41] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:49:41] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-18 07:49:41] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-18 07:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:49:41] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-18 07:49:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:49:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-18 07:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:49:42] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-18 07:49:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:49:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 85 ms returned sat
[2023-03-18 07:49:42] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 0 ms to minimize.
[2023-03-18 07:49:43] [INFO ] Deduced a trap composed of 78 places in 410 ms of which 1 ms to minimize.
[2023-03-18 07:49:43] [INFO ] Deduced a trap composed of 62 places in 434 ms of which 1 ms to minimize.
[2023-03-18 07:49:44] [INFO ] Deduced a trap composed of 39 places in 491 ms of which 1 ms to minimize.
[2023-03-18 07:49:44] [INFO ] Deduced a trap composed of 47 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:49:45] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-18 07:49:45] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2023-03-18 07:49:46] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 1 ms to minimize.
[2023-03-18 07:49:46] [INFO ] Deduced a trap composed of 89 places in 358 ms of which 1 ms to minimize.
[2023-03-18 07:49:47] [INFO ] Deduced a trap composed of 55 places in 393 ms of which 1 ms to minimize.
[2023-03-18 07:49:47] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 1 ms to minimize.
[2023-03-18 07:49:47] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-18 07:49:48] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:49:48] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 1 ms to minimize.
[2023-03-18 07:49:49] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 1 ms to minimize.
[2023-03-18 07:49:49] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:49:50] [INFO ] Deduced a trap composed of 45 places in 374 ms of which 1 ms to minimize.
[2023-03-18 07:49:50] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 1 ms to minimize.
[2023-03-18 07:49:51] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 1 ms to minimize.
[2023-03-18 07:49:51] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 1 ms to minimize.
[2023-03-18 07:49:52] [INFO ] Deduced a trap composed of 23 places in 370 ms of which 0 ms to minimize.
[2023-03-18 07:49:52] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2023-03-18 07:49:53] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:49:53] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2023-03-18 07:49:53] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 1 ms to minimize.
[2023-03-18 07:49:54] [INFO ] Deduced a trap composed of 13 places in 384 ms of which 1 ms to minimize.
[2023-03-18 07:49:54] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 1 ms to minimize.
[2023-03-18 07:49:55] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 1 ms to minimize.
[2023-03-18 07:49:55] [INFO ] Deduced a trap composed of 43 places in 475 ms of which 1 ms to minimize.
[2023-03-18 07:49:56] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 0 ms to minimize.
[2023-03-18 07:49:56] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 1 ms to minimize.
[2023-03-18 07:49:57] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 1 ms to minimize.
[2023-03-18 07:49:57] [INFO ] Deduced a trap composed of 56 places in 339 ms of which 1 ms to minimize.
[2023-03-18 07:49:58] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 1 ms to minimize.
[2023-03-18 07:49:58] [INFO ] Deduced a trap composed of 52 places in 372 ms of which 2 ms to minimize.
[2023-03-18 07:49:58] [INFO ] Deduced a trap composed of 59 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:49:59] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 1 ms to minimize.
[2023-03-18 07:49:59] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 0 ms to minimize.
[2023-03-18 07:50:00] [INFO ] Deduced a trap composed of 69 places in 379 ms of which 1 ms to minimize.
[2023-03-18 07:50:00] [INFO ] Deduced a trap composed of 50 places in 339 ms of which 0 ms to minimize.
[2023-03-18 07:50:00] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 1 ms to minimize.
[2023-03-18 07:50:01] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 1 ms to minimize.
[2023-03-18 07:50:01] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 1 ms to minimize.
[2023-03-18 07:50:02] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 0 ms to minimize.
[2023-03-18 07:50:02] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2023-03-18 07:50:03] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 1 ms to minimize.
[2023-03-18 07:50:04] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-18 07:50:04] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 1 ms to minimize.
[2023-03-18 07:50:04] [INFO ] Deduced a trap composed of 60 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:50:05] [INFO ] Deduced a trap composed of 38 places in 491 ms of which 0 ms to minimize.
[2023-03-18 07:50:05] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 0 ms to minimize.
[2023-03-18 07:50:06] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 3 ms to minimize.
[2023-03-18 07:50:06] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 2 ms to minimize.
[2023-03-18 07:50:07] [INFO ] Deduced a trap composed of 59 places in 350 ms of which 0 ms to minimize.
[2023-03-18 07:50:07] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 1 ms to minimize.
[2023-03-18 07:50:08] [INFO ] Deduced a trap composed of 83 places in 341 ms of which 1 ms to minimize.
[2023-03-18 07:50:08] [INFO ] Deduced a trap composed of 64 places in 318 ms of which 1 ms to minimize.
[2023-03-18 07:50:09] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2023-03-18 07:50:10] [INFO ] Deduced a trap composed of 42 places in 357 ms of which 3 ms to minimize.
[2023-03-18 07:50:10] [INFO ] Deduced a trap composed of 60 places in 330 ms of which 1 ms to minimize.
[2023-03-18 07:50:11] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2023-03-18 07:50:11] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 1 ms to minimize.
[2023-03-18 07:50:11] [INFO ] Deduced a trap composed of 106 places in 438 ms of which 1 ms to minimize.
[2023-03-18 07:50:12] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 1 ms to minimize.
[2023-03-18 07:50:12] [INFO ] Deduced a trap composed of 93 places in 387 ms of which 1 ms to minimize.
[2023-03-18 07:50:13] [INFO ] Deduced a trap composed of 39 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:50:13] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 1 ms to minimize.
[2023-03-18 07:50:14] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 1 ms to minimize.
[2023-03-18 07:50:14] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:50:15] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 1 ms to minimize.
[2023-03-18 07:50:15] [INFO ] Deduced a trap composed of 39 places in 371 ms of which 1 ms to minimize.
[2023-03-18 07:50:16] [INFO ] Deduced a trap composed of 56 places in 354 ms of which 1 ms to minimize.
[2023-03-18 07:50:19] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 36611 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-18 07:50:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:50:19] [INFO ] Invariant cache hit.
[2023-03-18 07:50:20] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-18 07:50:20] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:50:20] [INFO ] Invariant cache hit.
[2023-03-18 07:50:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:50:24] [INFO ] Implicit Places using invariants and state equation in 4305 ms returned []
Implicit Place search using SMT with State Equation took 5031 ms to find 0 implicit places.
[2023-03-18 07:50:24] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-18 07:50:24] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:50:24] [INFO ] Invariant cache hit.
[2023-03-18 07:50:25] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6409 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting property specific reduction for Peterson-COL-7-UpperBounds-00
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:50:25] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2023-03-18 07:50:25] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:50:25] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-18 07:50:25] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-18 07:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:50:26] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-18 07:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:50:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-18 07:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:50:26] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-18 07:50:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:50:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 84 ms returned sat
[2023-03-18 07:50:27] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 0 ms to minimize.
[2023-03-18 07:50:27] [INFO ] Deduced a trap composed of 78 places in 411 ms of which 1 ms to minimize.
[2023-03-18 07:50:28] [INFO ] Deduced a trap composed of 62 places in 399 ms of which 1 ms to minimize.
[2023-03-18 07:50:28] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 1 ms to minimize.
[2023-03-18 07:50:29] [INFO ] Deduced a trap composed of 47 places in 332 ms of which 1 ms to minimize.
[2023-03-18 07:50:29] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 0 ms to minimize.
[2023-03-18 07:50:29] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 0 ms to minimize.
[2023-03-18 07:50:30] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 0 ms to minimize.
[2023-03-18 07:50:30] [INFO ] Deduced a trap composed of 89 places in 389 ms of which 1 ms to minimize.
[2023-03-18 07:50:31] [INFO ] Deduced a trap composed of 55 places in 519 ms of which 1 ms to minimize.
[2023-03-18 07:50:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 33 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 592/592 places, 1704/1704 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:50:31] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2591 ms. (steps per millisecond=385 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 1) seen :1
[2023-03-18 07:50:34] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 07:50:34] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-18 07:50:34] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-18 07:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 07:50:35] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-18 07:50:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 07:50:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-18 07:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 07:50:35] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-18 07:50:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:50:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 85 ms returned sat
[2023-03-18 07:50:36] [INFO ] Deduced a trap composed of 29 places in 396 ms of which 1 ms to minimize.
[2023-03-18 07:50:36] [INFO ] Deduced a trap composed of 78 places in 418 ms of which 1 ms to minimize.
[2023-03-18 07:50:37] [INFO ] Deduced a trap composed of 62 places in 399 ms of which 0 ms to minimize.
[2023-03-18 07:50:37] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 0 ms to minimize.
[2023-03-18 07:50:38] [INFO ] Deduced a trap composed of 47 places in 409 ms of which 1 ms to minimize.
[2023-03-18 07:50:38] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2023-03-18 07:50:39] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 0 ms to minimize.
[2023-03-18 07:50:39] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 0 ms to minimize.
[2023-03-18 07:50:40] [INFO ] Deduced a trap composed of 89 places in 389 ms of which 1 ms to minimize.
[2023-03-18 07:50:40] [INFO ] Deduced a trap composed of 55 places in 402 ms of which 1 ms to minimize.
[2023-03-18 07:50:41] [INFO ] Deduced a trap composed of 38 places in 395 ms of which 0 ms to minimize.
[2023-03-18 07:50:41] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 1 ms to minimize.
[2023-03-18 07:50:41] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 1 ms to minimize.
[2023-03-18 07:50:42] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 1 ms to minimize.
[2023-03-18 07:50:42] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 1 ms to minimize.
[2023-03-18 07:50:43] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:50:43] [INFO ] Deduced a trap composed of 45 places in 366 ms of which 1 ms to minimize.
[2023-03-18 07:50:44] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2023-03-18 07:50:44] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 1 ms to minimize.
[2023-03-18 07:50:45] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 1 ms to minimize.
[2023-03-18 07:50:45] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 1 ms to minimize.
[2023-03-18 07:50:46] [INFO ] Deduced a trap composed of 21 places in 528 ms of which 1 ms to minimize.
[2023-03-18 07:50:46] [INFO ] Deduced a trap composed of 22 places in 464 ms of which 1 ms to minimize.
[2023-03-18 07:50:47] [INFO ] Deduced a trap composed of 13 places in 480 ms of which 1 ms to minimize.
[2023-03-18 07:50:47] [INFO ] Deduced a trap composed of 14 places in 367 ms of which 1 ms to minimize.
[2023-03-18 07:50:48] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 1 ms to minimize.
[2023-03-18 07:50:48] [INFO ] Deduced a trap composed of 22 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:50:49] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 1 ms to minimize.
[2023-03-18 07:50:49] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 1 ms to minimize.
[2023-03-18 07:50:50] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 0 ms to minimize.
[2023-03-18 07:50:50] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 1 ms to minimize.
[2023-03-18 07:50:51] [INFO ] Deduced a trap composed of 30 places in 363 ms of which 1 ms to minimize.
[2023-03-18 07:50:51] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 0 ms to minimize.
[2023-03-18 07:50:51] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 0 ms to minimize.
[2023-03-18 07:50:52] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 1 ms to minimize.
[2023-03-18 07:50:52] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 1 ms to minimize.
[2023-03-18 07:50:53] [INFO ] Deduced a trap composed of 55 places in 367 ms of which 1 ms to minimize.
[2023-03-18 07:50:53] [INFO ] Deduced a trap composed of 22 places in 344 ms of which 1 ms to minimize.
[2023-03-18 07:50:54] [INFO ] Deduced a trap composed of 69 places in 387 ms of which 0 ms to minimize.
[2023-03-18 07:50:54] [INFO ] Deduced a trap composed of 50 places in 383 ms of which 0 ms to minimize.
[2023-03-18 07:50:54] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 2 ms to minimize.
[2023-03-18 07:50:55] [INFO ] Deduced a trap composed of 47 places in 383 ms of which 1 ms to minimize.
[2023-03-18 07:50:55] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 1 ms to minimize.
[2023-03-18 07:50:56] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 1 ms to minimize.
[2023-03-18 07:50:56] [INFO ] Deduced a trap composed of 38 places in 499 ms of which 1 ms to minimize.
[2023-03-18 07:50:57] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-18 07:50:58] [INFO ] Deduced a trap composed of 11 places in 404 ms of which 1 ms to minimize.
[2023-03-18 07:50:58] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:50:59] [INFO ] Deduced a trap composed of 60 places in 381 ms of which 1 ms to minimize.
[2023-03-18 07:50:59] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2023-03-18 07:50:59] [INFO ] Deduced a trap composed of 41 places in 382 ms of which 1 ms to minimize.
[2023-03-18 07:51:00] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2023-03-18 07:51:00] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 1 ms to minimize.
[2023-03-18 07:51:01] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 1 ms to minimize.
[2023-03-18 07:51:02] [INFO ] Deduced a trap composed of 75 places in 310 ms of which 0 ms to minimize.
[2023-03-18 07:51:02] [INFO ] Deduced a trap composed of 83 places in 345 ms of which 1 ms to minimize.
[2023-03-18 07:51:02] [INFO ] Deduced a trap composed of 64 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:51:04] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 1 ms to minimize.
[2023-03-18 07:51:04] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 1 ms to minimize.
[2023-03-18 07:51:04] [INFO ] Deduced a trap composed of 60 places in 373 ms of which 1 ms to minimize.
[2023-03-18 07:51:05] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 0 ms to minimize.
[2023-03-18 07:51:05] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 1 ms to minimize.
[2023-03-18 07:51:06] [INFO ] Deduced a trap composed of 106 places in 382 ms of which 1 ms to minimize.
[2023-03-18 07:51:06] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2023-03-18 07:51:07] [INFO ] Deduced a trap composed of 93 places in 500 ms of which 0 ms to minimize.
[2023-03-18 07:51:07] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 0 ms to minimize.
[2023-03-18 07:51:08] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-18 07:51:08] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 1 ms to minimize.
[2023-03-18 07:51:09] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 1 ms to minimize.
[2023-03-18 07:51:09] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2023-03-18 07:51:10] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 1 ms to minimize.
[2023-03-18 07:51:10] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 1 ms to minimize.
[2023-03-18 07:51:13] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 37844 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-18 07:51:13] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:51:13] [INFO ] Invariant cache hit.
[2023-03-18 07:51:14] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-18 07:51:14] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:51:14] [INFO ] Invariant cache hit.
[2023-03-18 07:51:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 07:51:19] [INFO ] Implicit Places using invariants and state equation in 4313 ms returned []
Implicit Place search using SMT with State Equation took 5050 ms to find 0 implicit places.
[2023-03-18 07:51:19] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-18 07:51:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 07:51:19] [INFO ] Invariant cache hit.
[2023-03-18 07:51:20] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6807 ms. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-00 in 55090 ms.
[2023-03-18 07:51:21] [INFO ] Flatten gal took : 266 ms
[2023-03-18 07:51:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-18 07:51:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 1704 transitions and 6784 arcs took 12 ms.
Total runtime 383760 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/1740/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14715704 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090652 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="Peterson-COL-7"
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 Peterson-COL-7, 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 r265-smll-167863540300597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;