About the Execution of Smart+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 |
| 3866.315 | 3600000.00 | 3666291.00 | 8241.20 | ? 7 7 7 8 7 8 8 8 ? 8 7 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.r267-smll-167863542100597.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 smartxred
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 r267-smll-167863542100597
=====================================================================
--------------------
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 1678937400684
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 03:30:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 03:30:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:30:03] [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-16 03:30:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 03:30:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 922 ms
[2023-03-16 03:30:04] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-16 03:30:04] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2023-03-16 03:30:04] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-16 03:30:04] [INFO ] Computed 1 place invariants in 9 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-16 03:30:04] [INFO ] Invariant cache hit.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 03:30:05] [INFO ] Added : 12 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 03:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:30:05] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 03:30:05] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 03:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:30:06] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:30:06] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 03:30:06] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 03:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 03:30:06] [INFO ] Added : 11 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:30:06] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 03:30:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 03:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 03:30:06] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 03:30:06] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 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-16 03:30:06] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 137 ms.
[2023-03-16 03:30:06] [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 664 ms. (steps per millisecond=15 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :27
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 128 ms. (steps per millisecond=78 ) 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 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :36
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 48 ms. (steps per millisecond=208 ) 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 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :23
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-16 03:30:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-16 03:30:08] [INFO ] Computed 31 place invariants in 103 ms
[2023-03-16 03:30:09] [INFO ] [Real]Absence check using 23 positive place invariants in 82 ms returned sat
[2023-03-16 03:30:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2023-03-16 03:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:10] [INFO ] [Real]Absence check using state equation in 1882 ms returned sat
[2023-03-16 03:30:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 77 ms returned sat
[2023-03-16 03:30:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 32 ms returned sat
[2023-03-16 03:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:13] [INFO ] [Nat]Absence check using state equation in 1578 ms returned sat
[2023-03-16 03:30:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:30:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 402 ms returned sat
[2023-03-16 03:30:15] [INFO ] Deduced a trap composed of 13 places in 1883 ms of which 9 ms to minimize.
[2023-03-16 03:30:17] [INFO ] Deduced a trap composed of 17 places in 1558 ms of which 2 ms to minimize.
[2023-03-16 03:30: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 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-16 03:30:17] [INFO ] [Real]Absence check using 23 positive place invariants in 58 ms returned sat
[2023-03-16 03:30:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-16 03:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:18] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-16 03:30:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 56 ms returned sat
[2023-03-16 03:30:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-16 03:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:20] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2023-03-16 03:30:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 338 ms returned sat
[2023-03-16 03:30:22] [INFO ] Deduced a trap composed of 32 places in 1651 ms of which 3 ms to minimize.
[2023-03-16 03:30:24] [INFO ] Deduced a trap composed of 33 places in 1534 ms of which 2 ms to minimize.
[2023-03-16 03:30:24] [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-16 03:30:24] [INFO ] [Real]Absence check using 23 positive place invariants in 54 ms returned sat
[2023-03-16 03:30:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-16 03:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:26] [INFO ] [Real]Absence check using state equation in 1482 ms returned sat
[2023-03-16 03:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 82 ms returned sat
[2023-03-16 03:30:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2023-03-16 03:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:28] [INFO ] [Nat]Absence check using state equation in 1644 ms returned sat
[2023-03-16 03:30:29] [INFO ] [Nat]Added 497 Read/Feed constraints in 352 ms returned sat
[2023-03-16 03:30:30] [INFO ] Deduced a trap composed of 32 places in 1717 ms of which 3 ms to minimize.
[2023-03-16 03:30:32] [INFO ] Deduced a trap composed of 33 places in 1698 ms of which 2 ms to minimize.
[2023-03-16 03:30:32] [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-16 03:30:33] [INFO ] [Real]Absence check using 23 positive place invariants in 72 ms returned sat
[2023-03-16 03:30:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2023-03-16 03:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:34] [INFO ] [Real]Absence check using state equation in 1443 ms returned sat
[2023-03-16 03:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 77 ms returned sat
[2023-03-16 03:30:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 27 ms returned sat
[2023-03-16 03:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:36] [INFO ] [Nat]Absence check using state equation in 1530 ms returned sat
[2023-03-16 03:30:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 267 ms returned sat
[2023-03-16 03:30:38] [INFO ] Deduced a trap composed of 13 places in 1693 ms of which 2 ms to minimize.
[2023-03-16 03:30:40] [INFO ] Deduced a trap composed of 34 places in 1670 ms of which 4 ms to minimize.
[2023-03-16 03:30:40] [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-16 03:30:41] [INFO ] [Real]Absence check using 23 positive place invariants in 74 ms returned sat
[2023-03-16 03:30:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2023-03-16 03:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:42] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-16 03:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 82 ms returned sat
[2023-03-16 03:30:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2023-03-16 03:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:44] [INFO ] [Nat]Absence check using state equation in 1423 ms returned sat
[2023-03-16 03:30:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 435 ms returned sat
[2023-03-16 03:30:47] [INFO ] Deduced a trap composed of 32 places in 1848 ms of which 2 ms to minimize.
[2023-03-16 03:30:49] [INFO ] Deduced a trap composed of 33 places in 1716 ms of which 2 ms to minimize.
[2023-03-16 03:30:49] [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-16 03:30:49] [INFO ] [Real]Absence check using 23 positive place invariants in 51 ms returned sat
[2023-03-16 03:30:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-16 03:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:50] [INFO ] [Real]Absence check using state equation in 1394 ms returned sat
[2023-03-16 03:30:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:30:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 77 ms returned sat
[2023-03-16 03:30:51] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2023-03-16 03:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:30:53] [INFO ] [Nat]Absence check using state equation in 1497 ms returned sat
[2023-03-16 03:30:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 275 ms returned sat
[2023-03-16 03:30:55] [INFO ] Deduced a trap composed of 13 places in 2040 ms of which 2 ms to minimize.
[2023-03-16 03:30:57] [INFO ] Deduced a trap composed of 34 places in 1807 ms of which 1 ms to minimize.
[2023-03-16 03:30:57] [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, 1, 7, 1]
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 6 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 600 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 601 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-16 03:30:58] [INFO ] Computed 31 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20856 ms. (steps per millisecond=47 ) properties (out of 6) seen :25
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2531 ms. (steps per millisecond=395 ) properties (out of 6) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3369 ms. (steps per millisecond=296 ) properties (out of 6) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3375 ms. (steps per millisecond=296 ) properties (out of 6) seen :23
Interrupted Best-First random walk after 587683 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3545 ms. (steps per millisecond=282 ) properties (out of 6) seen :23
Interrupted Best-First random walk after 615529 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 14
[2023-03-16 03:31:41] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-16 03:31:41] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-16 03:31:42] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2023-03-16 03:31:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-16 03:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:31:43] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2023-03-16 03:31:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:31:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 03:31:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:31:44] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2023-03-16 03:31:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:31:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 267 ms returned sat
[2023-03-16 03:31:45] [INFO ] Deduced a trap composed of 32 places in 1055 ms of which 2 ms to minimize.
[2023-03-16 03:31:46] [INFO ] Deduced a trap composed of 28 places in 958 ms of which 1 ms to minimize.
[2023-03-16 03:31:47] [INFO ] Deduced a trap composed of 49 places in 883 ms of which 3 ms to minimize.
[2023-03-16 03:31:48] [INFO ] Deduced a trap composed of 15 places in 952 ms of which 1 ms to minimize.
[2023-03-16 03:31:49] [INFO ] Deduced a trap composed of 13 places in 813 ms of which 1 ms to minimize.
[2023-03-16 03:31:50] [INFO ] Deduced a trap composed of 105 places in 864 ms of which 1 ms to minimize.
[2023-03-16 03:31:51] [INFO ] Deduced a trap composed of 57 places in 819 ms of which 1 ms to minimize.
[2023-03-16 03:31:52] [INFO ] Deduced a trap composed of 13 places in 820 ms of which 1 ms to minimize.
[2023-03-16 03:31:53] [INFO ] Deduced a trap composed of 57 places in 946 ms of which 1 ms to minimize.
[2023-03-16 03:31:54] [INFO ] Deduced a trap composed of 58 places in 946 ms of which 2 ms to minimize.
[2023-03-16 03:31:55] [INFO ] Deduced a trap composed of 13 places in 1145 ms of which 1 ms to minimize.
[2023-03-16 03:31:56] [INFO ] Deduced a trap composed of 75 places in 888 ms of which 2 ms to minimize.
[2023-03-16 03:31:57] [INFO ] Deduced a trap composed of 72 places in 881 ms of which 1 ms to minimize.
[2023-03-16 03:31:58] [INFO ] Deduced a trap composed of 53 places in 877 ms of which 1 ms to minimize.
[2023-03-16 03:31:59] [INFO ] Deduced a trap composed of 45 places in 770 ms of which 2 ms to minimize.
[2023-03-16 03:32:00] [INFO ] Deduced a trap composed of 34 places in 1002 ms of which 2 ms to minimize.
[2023-03-16 03:32:02] [INFO ] Deduced a trap composed of 52 places in 845 ms of which 2 ms to minimize.
[2023-03-16 03:32:03] [INFO ] Deduced a trap composed of 25 places in 1253 ms of which 1 ms to minimize.
[2023-03-16 03:32:04] [INFO ] Deduced a trap composed of 69 places in 884 ms of which 2 ms to minimize.
[2023-03-16 03:32:05] [INFO ] Deduced a trap composed of 76 places in 811 ms of which 1 ms to minimize.
[2023-03-16 03:32:06] [INFO ] Deduced a trap composed of 34 places in 1050 ms of which 1 ms to minimize.
[2023-03-16 03:32:07] [INFO ] Deduced a trap composed of 82 places in 931 ms of which 2 ms to minimize.
[2023-03-16 03:32:08] [INFO ] Deduced a trap composed of 28 places in 882 ms of which 10 ms to minimize.
[2023-03-16 03:32:09] [INFO ] Deduced a trap composed of 76 places in 928 ms of which 1 ms to minimize.
[2023-03-16 03:32:10] [INFO ] Deduced a trap composed of 15 places in 787 ms of which 1 ms to minimize.
[2023-03-16 03:32:11] [INFO ] Deduced a trap composed of 15 places in 861 ms of which 4 ms to minimize.
[2023-03-16 03:32:12] [INFO ] Deduced a trap composed of 86 places in 917 ms of which 1 ms to minimize.
[2023-03-16 03:32:13] [INFO ] Deduced a trap composed of 63 places in 1020 ms of which 1 ms to minimize.
[2023-03-16 03:32:14] [INFO ] Deduced a trap composed of 93 places in 841 ms of which 1 ms to minimize.
[2023-03-16 03:32:15] [INFO ] Deduced a trap composed of 51 places in 783 ms of which 2 ms to minimize.
[2023-03-16 03:32:16] [INFO ] Deduced a trap composed of 44 places in 811 ms of which 1 ms to minimize.
[2023-03-16 03:32:17] [INFO ] Deduced a trap composed of 51 places in 868 ms of which 1 ms to minimize.
[2023-03-16 03:32:17] [INFO ] Deduced a trap composed of 43 places in 848 ms of which 1 ms to minimize.
[2023-03-16 03:32:18] [INFO ] Deduced a trap composed of 32 places in 964 ms of which 2 ms to minimize.
[2023-03-16 03:32:20] [INFO ] Deduced a trap composed of 45 places in 1125 ms of which 2 ms to minimize.
[2023-03-16 03:32:21] [INFO ] Deduced a trap composed of 86 places in 1048 ms of which 1 ms to minimize.
[2023-03-16 03:32:22] [INFO ] Deduced a trap composed of 79 places in 885 ms of which 1 ms to minimize.
[2023-03-16 03:32:23] [INFO ] Deduced a trap composed of 44 places in 745 ms of which 2 ms to minimize.
[2023-03-16 03:32:24] [INFO ] Deduced a trap composed of 53 places in 942 ms of which 1 ms to minimize.
[2023-03-16 03:32:25] [INFO ] Deduced a trap composed of 34 places in 801 ms of which 1 ms to minimize.
[2023-03-16 03:32:28] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 43828 ms
[2023-03-16 03:32:28] [INFO ] [Real]Absence check using 23 positive place invariants in 46 ms returned sat
[2023-03-16 03:32:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-16 03:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:29] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2023-03-16 03:32:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:32:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-16 03:32:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-16 03:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:30] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2023-03-16 03:32:30] [INFO ] [Nat]Added 497 Read/Feed constraints in 191 ms returned sat
[2023-03-16 03:32:31] [INFO ] Deduced a trap composed of 25 places in 956 ms of which 1 ms to minimize.
[2023-03-16 03:32:32] [INFO ] Deduced a trap composed of 21 places in 822 ms of which 2 ms to minimize.
[2023-03-16 03:32:33] [INFO ] Deduced a trap composed of 25 places in 815 ms of which 1 ms to minimize.
[2023-03-16 03:32:34] [INFO ] Deduced a trap composed of 25 places in 837 ms of which 2 ms to minimize.
[2023-03-16 03:32:35] [INFO ] Deduced a trap composed of 25 places in 951 ms of which 5 ms to minimize.
[2023-03-16 03:32:36] [INFO ] Deduced a trap composed of 25 places in 961 ms of which 1 ms to minimize.
[2023-03-16 03:32:37] [INFO ] Deduced a trap composed of 22 places in 888 ms of which 2 ms to minimize.
[2023-03-16 03:32:38] [INFO ] Deduced a trap composed of 21 places in 981 ms of which 1 ms to minimize.
[2023-03-16 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7788 ms
[2023-03-16 03:32:38] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-16 03:32:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:39] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2023-03-16 03:32:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:32:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-16 03:32:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-16 03:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:40] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2023-03-16 03:32:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 186 ms returned sat
[2023-03-16 03:32:41] [INFO ] Deduced a trap composed of 25 places in 870 ms of which 2 ms to minimize.
[2023-03-16 03:32:42] [INFO ] Deduced a trap composed of 21 places in 1161 ms of which 1 ms to minimize.
[2023-03-16 03:32:44] [INFO ] Deduced a trap composed of 25 places in 1159 ms of which 2 ms to minimize.
[2023-03-16 03:32:45] [INFO ] Deduced a trap composed of 25 places in 1023 ms of which 2 ms to minimize.
[2023-03-16 03:32:46] [INFO ] Deduced a trap composed of 25 places in 839 ms of which 2 ms to minimize.
[2023-03-16 03:32:47] [INFO ] Deduced a trap composed of 25 places in 912 ms of which 2 ms to minimize.
[2023-03-16 03:32:48] [INFO ] Deduced a trap composed of 22 places in 1028 ms of which 2 ms to minimize.
[2023-03-16 03:32:49] [INFO ] Deduced a trap composed of 21 places in 890 ms of which 5 ms to minimize.
[2023-03-16 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 8516 ms
[2023-03-16 03:32:49] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-16 03:32:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-16 03:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:50] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2023-03-16 03:32:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:32:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 03:32:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-16 03:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:32:51] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-16 03:32:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 248 ms returned sat
[2023-03-16 03:32:52] [INFO ] Deduced a trap composed of 134 places in 978 ms of which 2 ms to minimize.
[2023-03-16 03:32:53] [INFO ] Deduced a trap composed of 91 places in 942 ms of which 1 ms to minimize.
[2023-03-16 03:32:54] [INFO ] Deduced a trap composed of 130 places in 944 ms of which 1 ms to minimize.
[2023-03-16 03:32:55] [INFO ] Deduced a trap composed of 97 places in 944 ms of which 2 ms to minimize.
[2023-03-16 03:32:56] [INFO ] Deduced a trap composed of 70 places in 1147 ms of which 1 ms to minimize.
[2023-03-16 03:32:57] [INFO ] Deduced a trap composed of 147 places in 851 ms of which 2 ms to minimize.
[2023-03-16 03:32:58] [INFO ] Deduced a trap composed of 167 places in 853 ms of which 1 ms to minimize.
[2023-03-16 03:32:59] [INFO ] Deduced a trap composed of 145 places in 854 ms of which 2 ms to minimize.
[2023-03-16 03:33:00] [INFO ] Deduced a trap composed of 151 places in 916 ms of which 1 ms to minimize.
[2023-03-16 03:33:01] [INFO ] Deduced a trap composed of 106 places in 817 ms of which 2 ms to minimize.
[2023-03-16 03:33:02] [INFO ] Deduced a trap composed of 128 places in 883 ms of which 1 ms to minimize.
[2023-03-16 03:33:03] [INFO ] Deduced a trap composed of 93 places in 874 ms of which 1 ms to minimize.
[2023-03-16 03:33:04] [INFO ] Deduced a trap composed of 143 places in 758 ms of which 1 ms to minimize.
[2023-03-16 03:33:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 12903 ms
[2023-03-16 03:33:04] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 166 ms.
[2023-03-16 03:33:11] [INFO ] Deduced a trap composed of 36 places in 937 ms of which 1 ms to minimize.
[2023-03-16 03:33:12] [INFO ] Deduced a trap composed of 58 places in 1075 ms of which 1 ms to minimize.
[2023-03-16 03:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2390 ms
[2023-03-16 03:33:13] [INFO ] Added : 128 causal constraints over 26 iterations in 8722 ms. Result :sat
Minimization took 1260 ms.
[2023-03-16 03:33:14] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-16 03:33:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:33:15] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2023-03-16 03:33:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:33:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 03:33:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-16 03:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:33:16] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2023-03-16 03:33:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 192 ms returned sat
[2023-03-16 03:33:17] [INFO ] Deduced a trap composed of 25 places in 1090 ms of which 1 ms to minimize.
[2023-03-16 03:33:18] [INFO ] Deduced a trap composed of 21 places in 837 ms of which 2 ms to minimize.
[2023-03-16 03:33:19] [INFO ] Deduced a trap composed of 25 places in 1109 ms of which 1 ms to minimize.
[2023-03-16 03:33:20] [INFO ] Deduced a trap composed of 25 places in 904 ms of which 1 ms to minimize.
[2023-03-16 03:33:21] [INFO ] Deduced a trap composed of 25 places in 823 ms of which 1 ms to minimize.
[2023-03-16 03:33:22] [INFO ] Deduced a trap composed of 25 places in 954 ms of which 2 ms to minimize.
[2023-03-16 03:33:23] [INFO ] Deduced a trap composed of 22 places in 997 ms of which 1 ms to minimize.
[2023-03-16 03:33:24] [INFO ] Deduced a trap composed of 21 places in 915 ms of which 2 ms to minimize.
[2023-03-16 03:33:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 8278 ms
[2023-03-16 03:33:25] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 03:33:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:33:26] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2023-03-16 03:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:33:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 47 ms returned sat
[2023-03-16 03:33:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-16 03:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:33:27] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2023-03-16 03:33:27] [INFO ] [Nat]Added 497 Read/Feed constraints in 250 ms returned sat
[2023-03-16 03:33:28] [INFO ] Deduced a trap composed of 134 places in 1059 ms of which 2 ms to minimize.
[2023-03-16 03:33:30] [INFO ] Deduced a trap composed of 91 places in 1105 ms of which 2 ms to minimize.
[2023-03-16 03:33:31] [INFO ] Deduced a trap composed of 130 places in 1081 ms of which 2 ms to minimize.
[2023-03-16 03:33:32] [INFO ] Deduced a trap composed of 97 places in 1074 ms of which 2 ms to minimize.
[2023-03-16 03:33:33] [INFO ] Deduced a trap composed of 70 places in 1102 ms of which 1 ms to minimize.
[2023-03-16 03:33:34] [INFO ] Deduced a trap composed of 147 places in 1179 ms of which 1 ms to minimize.
[2023-03-16 03:33:35] [INFO ] Deduced a trap composed of 167 places in 871 ms of which 1 ms to minimize.
[2023-03-16 03:33:36] [INFO ] Deduced a trap composed of 145 places in 912 ms of which 1 ms to minimize.
[2023-03-16 03:33:37] [INFO ] Deduced a trap composed of 151 places in 963 ms of which 1 ms to minimize.
[2023-03-16 03:33:39] [INFO ] Deduced a trap composed of 106 places in 1024 ms of which 1 ms to minimize.
[2023-03-16 03:33:40] [INFO ] Deduced a trap composed of 128 places in 1043 ms of which 2 ms to minimize.
[2023-03-16 03:33:41] [INFO ] Deduced a trap composed of 93 places in 1018 ms of which 2 ms to minimize.
[2023-03-16 03:33:42] [INFO ] Deduced a trap composed of 143 places in 691 ms of which 1 ms to minimize.
[2023-03-16 03:33:42] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14599 ms
[2023-03-16 03:33:42] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 229 ms.
[2023-03-16 03:33:49] [INFO ] Deduced a trap composed of 36 places in 1046 ms of which 1 ms to minimize.
[2023-03-16 03:33:50] [INFO ] Deduced a trap composed of 58 places in 871 ms of which 2 ms to minimize.
[2023-03-16 03:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2342 ms
[2023-03-16 03:33:50] [INFO ] Added : 128 causal constraints over 26 iterations in 8530 ms. Result :sat
Minimization took 1257 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
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 188 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 1104/1152 places, 2208/2256 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1104 cols
[2023-03-16 03:34:07] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15859 ms. (steps per millisecond=63 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2202 ms. (steps per millisecond=454 ) properties (out of 3) seen :3
Finished Best-First random walk after 655084 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=130 )
Interrupted Best-First random walk after 654085 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 4
[2023-03-16 03:34:35] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2023-03-16 03:34:35] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-16 03:34:36] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 03:34:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-16 03:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:34:36] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2023-03-16 03:34:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:34:37] [INFO ] [Real]Added 497 Read/Feed constraints in 89 ms returned sat
[2023-03-16 03:34:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:34:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-16 03:34:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-16 03:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:34:38] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2023-03-16 03:34:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 242 ms returned sat
[2023-03-16 03:34:39] [INFO ] Deduced a trap composed of 31 places in 867 ms of which 1 ms to minimize.
[2023-03-16 03:34:40] [INFO ] Deduced a trap composed of 39 places in 723 ms of which 1 ms to minimize.
[2023-03-16 03:34:40] [INFO ] Deduced a trap composed of 48 places in 742 ms of which 1 ms to minimize.
[2023-03-16 03:34:41] [INFO ] Deduced a trap composed of 13 places in 852 ms of which 1 ms to minimize.
[2023-03-16 03:34:42] [INFO ] Deduced a trap composed of 52 places in 869 ms of which 2 ms to minimize.
[2023-03-16 03:34:43] [INFO ] Deduced a trap composed of 67 places in 839 ms of which 1 ms to minimize.
[2023-03-16 03:34:44] [INFO ] Deduced a trap composed of 51 places in 837 ms of which 1 ms to minimize.
[2023-03-16 03:34:45] [INFO ] Deduced a trap composed of 28 places in 872 ms of which 1 ms to minimize.
[2023-03-16 03:34:46] [INFO ] Deduced a trap composed of 15 places in 783 ms of which 1 ms to minimize.
[2023-03-16 03:34:47] [INFO ] Deduced a trap composed of 60 places in 885 ms of which 1 ms to minimize.
[2023-03-16 03:34:48] [INFO ] Deduced a trap composed of 17 places in 1005 ms of which 1 ms to minimize.
[2023-03-16 03:34:49] [INFO ] Deduced a trap composed of 42 places in 792 ms of which 1 ms to minimize.
[2023-03-16 03:34:50] [INFO ] Deduced a trap composed of 69 places in 871 ms of which 1 ms to minimize.
[2023-03-16 03:34:51] [INFO ] Deduced a trap composed of 61 places in 852 ms of which 1 ms to minimize.
[2023-03-16 03:34:52] [INFO ] Deduced a trap composed of 71 places in 841 ms of which 1 ms to minimize.
[2023-03-16 03:34:53] [INFO ] Deduced a trap composed of 50 places in 853 ms of which 1 ms to minimize.
[2023-03-16 03:34:54] [INFO ] Deduced a trap composed of 31 places in 721 ms of which 3 ms to minimize.
[2023-03-16 03:34:55] [INFO ] Deduced a trap composed of 83 places in 827 ms of which 1 ms to minimize.
[2023-03-16 03:34:56] [INFO ] Deduced a trap composed of 39 places in 833 ms of which 2 ms to minimize.
[2023-03-16 03:34:57] [INFO ] Deduced a trap composed of 50 places in 855 ms of which 2 ms to minimize.
[2023-03-16 03:34:58] [INFO ] Deduced a trap composed of 121 places in 766 ms of which 1 ms to minimize.
[2023-03-16 03:34:58] [INFO ] Deduced a trap composed of 57 places in 796 ms of which 1 ms to minimize.
[2023-03-16 03:34:59] [INFO ] Deduced a trap composed of 49 places in 779 ms of which 1 ms to minimize.
[2023-03-16 03:35:00] [INFO ] Deduced a trap composed of 69 places in 855 ms of which 1 ms to minimize.
[2023-03-16 03:35:02] [INFO ] Deduced a trap composed of 33 places in 1066 ms of which 2 ms to minimize.
[2023-03-16 03:35:03] [INFO ] Deduced a trap composed of 49 places in 1037 ms of which 1 ms to minimize.
[2023-03-16 03:35:04] [INFO ] Deduced a trap composed of 15 places in 914 ms of which 1 ms to minimize.
[2023-03-16 03:35:05] [INFO ] Deduced a trap composed of 40 places in 1066 ms of which 1 ms to minimize.
[2023-03-16 03:35:06] [INFO ] Deduced a trap composed of 36 places in 792 ms of which 1 ms to minimize.
[2023-03-16 03:35:07] [INFO ] Deduced a trap composed of 63 places in 870 ms of which 1 ms to minimize.
[2023-03-16 03:35:08] [INFO ] Deduced a trap composed of 41 places in 869 ms of which 1 ms to minimize.
[2023-03-16 03:35:09] [INFO ] Deduced a trap composed of 15 places in 717 ms of which 1 ms to minimize.
[2023-03-16 03:35:10] [INFO ] Deduced a trap composed of 73 places in 881 ms of which 1 ms to minimize.
[2023-03-16 03:35:11] [INFO ] Deduced a trap composed of 75 places in 877 ms of which 1 ms to minimize.
[2023-03-16 03:35:12] [INFO ] Deduced a trap composed of 21 places in 867 ms of which 1 ms to minimize.
[2023-03-16 03:35:13] [INFO ] Deduced a trap composed of 159 places in 861 ms of which 2 ms to minimize.
[2023-03-16 03:35:14] [INFO ] Deduced a trap composed of 113 places in 853 ms of which 3 ms to minimize.
[2023-03-16 03:35:15] [INFO ] Deduced a trap composed of 91 places in 855 ms of which 1 ms to minimize.
[2023-03-16 03:35:16] [INFO ] Deduced a trap composed of 74 places in 834 ms of which 1 ms to minimize.
[2023-03-16 03:35:17] [INFO ] Deduced a trap composed of 92 places in 850 ms of which 1 ms to minimize.
[2023-03-16 03:35:17] [INFO ] Deduced a trap composed of 71 places in 869 ms of which 1 ms to minimize.
[2023-03-16 03:35:18] [INFO ] Deduced a trap composed of 60 places in 838 ms of which 1 ms to minimize.
[2023-03-16 03:35:19] [INFO ] Deduced a trap composed of 43 places in 865 ms of which 2 ms to minimize.
[2023-03-16 03:35:20] [INFO ] Deduced a trap composed of 60 places in 861 ms of which 2 ms to minimize.
[2023-03-16 03:35:21] [INFO ] Deduced a trap composed of 33 places in 891 ms of which 1 ms to minimize.
[2023-03-16 03:35:22] [INFO ] Deduced a trap composed of 51 places in 857 ms of which 1 ms to minimize.
[2023-03-16 03:35:22] [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-16 03:35:23] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-16 03:35:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:35:23] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2023-03-16 03:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:35:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-16 03:35:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-16 03:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:35:25] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2023-03-16 03:35:25] [INFO ] [Nat]Added 497 Read/Feed constraints in 224 ms returned sat
[2023-03-16 03:35:26] [INFO ] Deduced a trap composed of 154 places in 1037 ms of which 1 ms to minimize.
[2023-03-16 03:35:27] [INFO ] Deduced a trap composed of 99 places in 1080 ms of which 1 ms to minimize.
[2023-03-16 03:35:28] [INFO ] Deduced a trap composed of 113 places in 994 ms of which 1 ms to minimize.
[2023-03-16 03:35:29] [INFO ] Deduced a trap composed of 139 places in 1002 ms of which 1 ms to minimize.
[2023-03-16 03:35:30] [INFO ] Deduced a trap composed of 134 places in 885 ms of which 2 ms to minimize.
[2023-03-16 03:35:31] [INFO ] Deduced a trap composed of 119 places in 1001 ms of which 1 ms to minimize.
[2023-03-16 03:35:32] [INFO ] Deduced a trap composed of 125 places in 995 ms of which 1 ms to minimize.
[2023-03-16 03:35:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7630 ms
[2023-03-16 03:35:33] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 151 ms.
[2023-03-16 03:35:42] [INFO ] Deduced a trap composed of 151 places in 1097 ms of which 1 ms to minimize.
[2023-03-16 03:35:43] [INFO ] Deduced a trap composed of 139 places in 973 ms of which 1 ms to minimize.
[2023-03-16 03:35:44] [INFO ] Deduced a trap composed of 210 places in 991 ms of which 1 ms to minimize.
[2023-03-16 03:35:45] [INFO ] Deduced a trap composed of 87 places in 1106 ms of which 1 ms to minimize.
[2023-03-16 03:35:47] [INFO ] Deduced a trap composed of 135 places in 1014 ms of which 1 ms to minimize.
[2023-03-16 03:35:47] [INFO ] Deduced a trap composed of 30 places in 872 ms of which 1 ms to minimize.
[2023-03-16 03:35:49] [INFO ] Deduced a trap composed of 13 places in 969 ms of which 2 ms to minimize.
[2023-03-16 03:35:50] [INFO ] Deduced a trap composed of 174 places in 1135 ms of which 1 ms to minimize.
[2023-03-16 03:35:51] [INFO ] Deduced a trap composed of 13 places in 1272 ms of which 2 ms to minimize.
[2023-03-16 03:35:52] [INFO ] Deduced a trap composed of 29 places in 993 ms of which 2 ms to minimize.
[2023-03-16 03:35:54] [INFO ] Deduced a trap composed of 34 places in 957 ms of which 1 ms to minimize.
[2023-03-16 03:35:55] [INFO ] Deduced a trap composed of 11 places in 1241 ms of which 2 ms to minimize.
[2023-03-16 03:35:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 14501 ms
[2023-03-16 03:35:56] [INFO ] Added : 240 causal constraints over 48 iterations in 23173 ms. Result :sat
Minimization took 641 ms.
[2023-03-16 03:35:57] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned sat
[2023-03-16 03:35:57] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-16 03:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:35:58] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2023-03-16 03:35:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:35:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2023-03-16 03:35:58] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-16 03:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:35:59] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2023-03-16 03:35:59] [INFO ] [Nat]Added 497 Read/Feed constraints in 212 ms returned sat
[2023-03-16 03:36:00] [INFO ] Deduced a trap composed of 154 places in 972 ms of which 2 ms to minimize.
[2023-03-16 03:36:01] [INFO ] Deduced a trap composed of 99 places in 959 ms of which 1 ms to minimize.
[2023-03-16 03:36:02] [INFO ] Deduced a trap composed of 113 places in 1076 ms of which 2 ms to minimize.
[2023-03-16 03:36:04] [INFO ] Deduced a trap composed of 139 places in 1084 ms of which 2 ms to minimize.
[2023-03-16 03:36:05] [INFO ] Deduced a trap composed of 134 places in 1119 ms of which 1 ms to minimize.
[2023-03-16 03:36:06] [INFO ] Deduced a trap composed of 119 places in 1043 ms of which 2 ms to minimize.
[2023-03-16 03:36:07] [INFO ] Deduced a trap composed of 125 places in 1202 ms of which 2 ms to minimize.
[2023-03-16 03:36:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8243 ms
[2023-03-16 03:36:08] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 192 ms.
[2023-03-16 03:36:18] [INFO ] Deduced a trap composed of 151 places in 1127 ms of which 1 ms to minimize.
[2023-03-16 03:36:19] [INFO ] Deduced a trap composed of 139 places in 998 ms of which 1 ms to minimize.
[2023-03-16 03:36:20] [INFO ] Deduced a trap composed of 210 places in 1000 ms of which 2 ms to minimize.
[2023-03-16 03:36:22] [INFO ] Deduced a trap composed of 87 places in 1087 ms of which 1 ms to minimize.
[2023-03-16 03:36:23] [INFO ] Deduced a trap composed of 135 places in 1141 ms of which 1 ms to minimize.
[2023-03-16 03:36:24] [INFO ] Deduced a trap composed of 30 places in 978 ms of which 1 ms to minimize.
[2023-03-16 03:36:25] [INFO ] Deduced a trap composed of 13 places in 984 ms of which 2 ms to minimize.
[2023-03-16 03:36:26] [INFO ] Deduced a trap composed of 174 places in 988 ms of which 1 ms to minimize.
[2023-03-16 03:36:27] [INFO ] Deduced a trap composed of 13 places in 892 ms of which 2 ms to minimize.
[2023-03-16 03:36:28] [INFO ] Deduced a trap composed of 29 places in 1207 ms of which 1 ms to minimize.
[2023-03-16 03:36:30] [INFO ] Deduced a trap composed of 34 places in 992 ms of which 1 ms to minimize.
[2023-03-16 03:36:31] [INFO ] Deduced a trap composed of 11 places in 1127 ms of which 1 ms to minimize.
[2023-03-16 03:36:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 14159 ms
[2023-03-16 03:36:31] [INFO ] Added : 240 causal constraints over 48 iterations in 23792 ms. Result :sat
Minimization took 824 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8] Max seen :[1, 7, 7]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 108 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 75 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-16 03:36:34] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-16 03:36:34] [INFO ] Invariant cache hit.
[2023-03-16 03:36:35] [INFO ] Implicit Places using invariants in 986 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 990 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 43 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1110 ms. Remains : 1096/1104 places, 2208/2208 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:36:35] [INFO ] Computed 23 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15431 ms. (steps per millisecond=64 ) properties (out of 3) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2193 ms. (steps per millisecond=455 ) properties (out of 3) seen :3
Finished Best-First random walk after 656443 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=131 )
Interrupted Best-First random walk after 655156 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 2
[2023-03-16 03:37:02] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:37:02] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-16 03:37:03] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-16 03:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:37:04] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2023-03-16 03:37:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:37:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 03:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:37:05] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2023-03-16 03:37:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:37:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 247 ms returned sat
[2023-03-16 03:37:06] [INFO ] Deduced a trap composed of 33 places in 842 ms of which 1 ms to minimize.
[2023-03-16 03:37:07] [INFO ] Deduced a trap composed of 49 places in 787 ms of which 1 ms to minimize.
[2023-03-16 03:37:08] [INFO ] Deduced a trap composed of 94 places in 906 ms of which 1 ms to minimize.
[2023-03-16 03:37:09] [INFO ] Deduced a trap composed of 74 places in 910 ms of which 1 ms to minimize.
[2023-03-16 03:37:10] [INFO ] Deduced a trap composed of 81 places in 1068 ms of which 1 ms to minimize.
[2023-03-16 03:37:11] [INFO ] Deduced a trap composed of 29 places in 796 ms of which 1 ms to minimize.
[2023-03-16 03:37:12] [INFO ] Deduced a trap composed of 15 places in 1056 ms of which 1 ms to minimize.
[2023-03-16 03:37:13] [INFO ] Deduced a trap composed of 28 places in 752 ms of which 1 ms to minimize.
[2023-03-16 03:37:14] [INFO ] Deduced a trap composed of 83 places in 817 ms of which 1 ms to minimize.
[2023-03-16 03:37:14] [INFO ] Deduced a trap composed of 24 places in 808 ms of which 1 ms to minimize.
[2023-03-16 03:37:15] [INFO ] Deduced a trap composed of 42 places in 729 ms of which 1 ms to minimize.
[2023-03-16 03:37:16] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 1 ms to minimize.
[2023-03-16 03:37:17] [INFO ] Deduced a trap composed of 24 places in 713 ms of which 2 ms to minimize.
[2023-03-16 03:37:18] [INFO ] Deduced a trap composed of 44 places in 912 ms of which 2 ms to minimize.
[2023-03-16 03:37:19] [INFO ] Deduced a trap composed of 74 places in 836 ms of which 1 ms to minimize.
[2023-03-16 03:37:20] [INFO ] Deduced a trap composed of 42 places in 879 ms of which 1 ms to minimize.
[2023-03-16 03:37:21] [INFO ] Deduced a trap composed of 119 places in 796 ms of which 1 ms to minimize.
[2023-03-16 03:37:22] [INFO ] Deduced a trap composed of 15 places in 823 ms of which 2 ms to minimize.
[2023-03-16 03:37:23] [INFO ] Deduced a trap composed of 15 places in 940 ms of which 2 ms to minimize.
[2023-03-16 03:37:24] [INFO ] Deduced a trap composed of 42 places in 872 ms of which 1 ms to minimize.
[2023-03-16 03:37:25] [INFO ] Deduced a trap composed of 15 places in 858 ms of which 1 ms to minimize.
[2023-03-16 03:37:26] [INFO ] Deduced a trap composed of 71 places in 830 ms of which 1 ms to minimize.
[2023-03-16 03:37:27] [INFO ] Deduced a trap composed of 94 places in 672 ms of which 2 ms to minimize.
[2023-03-16 03:37:28] [INFO ] Deduced a trap composed of 109 places in 811 ms of which 2 ms to minimize.
[2023-03-16 03:37:28] [INFO ] Deduced a trap composed of 119 places in 879 ms of which 2 ms to minimize.
[2023-03-16 03:37:29] [INFO ] Deduced a trap composed of 79 places in 808 ms of which 1 ms to minimize.
[2023-03-16 03:37:31] [INFO ] Deduced a trap composed of 130 places in 1000 ms of which 2 ms to minimize.
[2023-03-16 03:37:32] [INFO ] Deduced a trap composed of 106 places in 858 ms of which 2 ms to minimize.
[2023-03-16 03:37:33] [INFO ] Deduced a trap composed of 31 places in 938 ms of which 2 ms to minimize.
[2023-03-16 03:37:34] [INFO ] Deduced a trap composed of 93 places in 665 ms of which 1 ms to minimize.
[2023-03-16 03:37:34] [INFO ] Deduced a trap composed of 94 places in 692 ms of which 1 ms to minimize.
[2023-03-16 03:37:35] [INFO ] Deduced a trap composed of 123 places in 736 ms of which 1 ms to minimize.
[2023-03-16 03:37:36] [INFO ] Deduced a trap composed of 130 places in 882 ms of which 2 ms to minimize.
[2023-03-16 03:37:37] [INFO ] Deduced a trap composed of 111 places in 851 ms of which 1 ms to minimize.
[2023-03-16 03:37:38] [INFO ] Deduced a trap composed of 67 places in 865 ms of which 2 ms to minimize.
[2023-03-16 03:37:39] [INFO ] Deduced a trap composed of 94 places in 724 ms of which 1 ms to minimize.
[2023-03-16 03:37:40] [INFO ] Deduced a trap composed of 137 places in 846 ms of which 1 ms to minimize.
[2023-03-16 03:37:41] [INFO ] Deduced a trap composed of 59 places in 871 ms of which 1 ms to minimize.
[2023-03-16 03:37:42] [INFO ] Deduced a trap composed of 24 places in 613 ms of which 1 ms to minimize.
[2023-03-16 03:37:43] [INFO ] Deduced a trap composed of 24 places in 718 ms of which 1 ms to minimize.
[2023-03-16 03:37:43] [INFO ] Deduced a trap composed of 116 places in 731 ms of which 1 ms to minimize.
[2023-03-16 03:37:44] [INFO ] Deduced a trap composed of 49 places in 716 ms of which 3 ms to minimize.
[2023-03-16 03:37:45] [INFO ] Deduced a trap composed of 13 places in 738 ms of which 2 ms to minimize.
[2023-03-16 03:37:46] [INFO ] Deduced a trap composed of 57 places in 778 ms of which 1 ms to minimize.
[2023-03-16 03:37:47] [INFO ] Deduced a trap composed of 61 places in 808 ms of which 1 ms to minimize.
[2023-03-16 03:37:48] [INFO ] Deduced a trap composed of 24 places in 914 ms of which 2 ms to minimize.
[2023-03-16 03:37:49] [INFO ] Deduced a trap composed of 84 places in 1041 ms of which 1 ms to minimize.
[2023-03-16 03:37:49] [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-16 03:37:50] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2023-03-16 03:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:37:50] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2023-03-16 03:37:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:37:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-16 03:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:37:51] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2023-03-16 03:37:52] [INFO ] [Nat]Added 497 Read/Feed constraints in 233 ms returned sat
[2023-03-16 03:37:53] [INFO ] Deduced a trap composed of 177 places in 948 ms of which 1 ms to minimize.
[2023-03-16 03:37:54] [INFO ] Deduced a trap composed of 117 places in 1122 ms of which 1 ms to minimize.
[2023-03-16 03:37:55] [INFO ] Deduced a trap composed of 166 places in 856 ms of which 1 ms to minimize.
[2023-03-16 03:37:56] [INFO ] Deduced a trap composed of 96 places in 1004 ms of which 2 ms to minimize.
[2023-03-16 03:37:57] [INFO ] Deduced a trap composed of 80 places in 1275 ms of which 1 ms to minimize.
[2023-03-16 03:37:59] [INFO ] Deduced a trap composed of 33 places in 1183 ms of which 2 ms to minimize.
[2023-03-16 03:38:00] [INFO ] Deduced a trap composed of 33 places in 993 ms of which 1 ms to minimize.
[2023-03-16 03:38:01] [INFO ] Deduced a trap composed of 34 places in 1084 ms of which 1 ms to minimize.
[2023-03-16 03:38:02] [INFO ] Deduced a trap composed of 56 places in 765 ms of which 1 ms to minimize.
[2023-03-16 03:38:03] [INFO ] Deduced a trap composed of 13 places in 770 ms of which 1 ms to minimize.
[2023-03-16 03:38:03] [INFO ] Deduced a trap composed of 13 places in 755 ms of which 4 ms to minimize.
[2023-03-16 03:38:04] [INFO ] Deduced a trap composed of 75 places in 780 ms of which 8 ms to minimize.
[2023-03-16 03:38:05] [INFO ] Deduced a trap composed of 113 places in 536 ms of which 1 ms to minimize.
[2023-03-16 03:38:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 13266 ms
[2023-03-16 03:38:05] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 153 ms.
[2023-03-16 03:38:17] [INFO ] Deduced a trap composed of 77 places in 1241 ms of which 1 ms to minimize.
[2023-03-16 03:38:17] [INFO ] Deduced a trap composed of 84 places in 844 ms of which 1 ms to minimize.
[2023-03-16 03:38:19] [INFO ] Deduced a trap composed of 87 places in 899 ms of which 1 ms to minimize.
[2023-03-16 03:38:20] [INFO ] Deduced a trap composed of 81 places in 1252 ms of which 1 ms to minimize.
[2023-03-16 03:38:21] [INFO ] Deduced a trap composed of 88 places in 934 ms of which 1 ms to minimize.
[2023-03-16 03:38:22] [INFO ] Deduced a trap composed of 154 places in 986 ms of which 1 ms to minimize.
[2023-03-16 03:38:23] [INFO ] Deduced a trap composed of 13 places in 1054 ms of which 2 ms to minimize.
[2023-03-16 03:38:24] [INFO ] Deduced a trap composed of 80 places in 1020 ms of which 2 ms to minimize.
[2023-03-16 03:38:26] [INFO ] Deduced a trap composed of 73 places in 1018 ms of which 2 ms to minimize.
[2023-03-16 03:38:27] [INFO ] Deduced a trap composed of 171 places in 1347 ms of which 2 ms to minimize.
[2023-03-16 03:38:28] [INFO ] Deduced a trap composed of 77 places in 1095 ms of which 1 ms to minimize.
[2023-03-16 03:38:30] [INFO ] Deduced a trap composed of 125 places in 1036 ms of which 1 ms to minimize.
[2023-03-16 03:38:31] [INFO ] Deduced a trap composed of 46 places in 959 ms of which 2 ms to minimize.
[2023-03-16 03:38:32] [INFO ] Deduced a trap composed of 75 places in 1129 ms of which 2 ms to minimize.
[2023-03-16 03:38:33] [INFO ] Deduced a trap composed of 50 places in 1053 ms of which 2 ms to minimize.
[2023-03-16 03:38:34] [INFO ] Deduced a trap composed of 41 places in 1055 ms of which 1 ms to minimize.
[2023-03-16 03:38:36] [INFO ] Deduced a trap composed of 61 places in 1281 ms of which 1 ms to minimize.
[2023-03-16 03:38: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 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-16 03:38:36] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-16 03:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:38:37] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2023-03-16 03:38:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:38:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-16 03:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:38:38] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2023-03-16 03:38:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 328 ms returned sat
[2023-03-16 03:38:39] [INFO ] Deduced a trap composed of 177 places in 977 ms of which 1 ms to minimize.
[2023-03-16 03:38:41] [INFO ] Deduced a trap composed of 117 places in 905 ms of which 1 ms to minimize.
[2023-03-16 03:38:42] [INFO ] Deduced a trap composed of 166 places in 978 ms of which 1 ms to minimize.
[2023-03-16 03:38:43] [INFO ] Deduced a trap composed of 96 places in 1061 ms of which 1 ms to minimize.
[2023-03-16 03:38:44] [INFO ] Deduced a trap composed of 80 places in 1037 ms of which 2 ms to minimize.
[2023-03-16 03:38:45] [INFO ] Deduced a trap composed of 33 places in 1037 ms of which 2 ms to minimize.
[2023-03-16 03:38:46] [INFO ] Deduced a trap composed of 33 places in 1010 ms of which 2 ms to minimize.
[2023-03-16 03:38:47] [INFO ] Deduced a trap composed of 34 places in 1039 ms of which 2 ms to minimize.
[2023-03-16 03:38:49] [INFO ] Deduced a trap composed of 56 places in 1060 ms of which 2 ms to minimize.
[2023-03-16 03:38:50] [INFO ] Deduced a trap composed of 13 places in 963 ms of which 1 ms to minimize.
[2023-03-16 03:38:51] [INFO ] Deduced a trap composed of 13 places in 951 ms of which 1 ms to minimize.
[2023-03-16 03:38:52] [INFO ] Deduced a trap composed of 75 places in 896 ms of which 1 ms to minimize.
[2023-03-16 03:38:52] [INFO ] Deduced a trap composed of 113 places in 697 ms of which 1 ms to minimize.
[2023-03-16 03:38:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14232 ms
[2023-03-16 03:38:53] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 207 ms.
[2023-03-16 03:39:04] [INFO ] Deduced a trap composed of 77 places in 1363 ms of which 2 ms to minimize.
[2023-03-16 03:39:06] [INFO ] Deduced a trap composed of 84 places in 1297 ms of which 2 ms to minimize.
[2023-03-16 03:39:07] [INFO ] Deduced a trap composed of 87 places in 1120 ms of which 1 ms to minimize.
[2023-03-16 03:39:08] [INFO ] Deduced a trap composed of 81 places in 1013 ms of which 2 ms to minimize.
[2023-03-16 03:39:10] [INFO ] Deduced a trap composed of 88 places in 1113 ms of which 1 ms to minimize.
[2023-03-16 03:39:11] [INFO ] Deduced a trap composed of 154 places in 949 ms of which 1 ms to minimize.
[2023-03-16 03:39:12] [INFO ] Deduced a trap composed of 13 places in 849 ms of which 2 ms to minimize.
[2023-03-16 03:39:13] [INFO ] Deduced a trap composed of 80 places in 839 ms of which 1 ms to minimize.
[2023-03-16 03:39:14] [INFO ] Deduced a trap composed of 73 places in 885 ms of which 1 ms to minimize.
[2023-03-16 03:39:15] [INFO ] Deduced a trap composed of 171 places in 1077 ms of which 1 ms to minimize.
[2023-03-16 03:39:16] [INFO ] Deduced a trap composed of 77 places in 1035 ms of which 1 ms to minimize.
[2023-03-16 03:39:17] [INFO ] Deduced a trap composed of 125 places in 954 ms of which 1 ms to minimize.
[2023-03-16 03:39:18] [INFO ] Deduced a trap composed of 46 places in 950 ms of which 1 ms to minimize.
[2023-03-16 03:39:20] [INFO ] Deduced a trap composed of 75 places in 1181 ms of which 1 ms to minimize.
[2023-03-16 03:39:21] [INFO ] Deduced a trap composed of 50 places in 1353 ms of which 2 ms to minimize.
[2023-03-16 03:39:23] [INFO ] Deduced a trap composed of 41 places in 1221 ms of which 2 ms to minimize.
[2023-03-16 03:39:23] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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] Max seen :[1, 7, 7]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 60 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 58 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-16 03:39:23] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-16 03:39:23] [INFO ] Invariant cache hit.
[2023-03-16 03:39:24] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2023-03-16 03:39:24] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-16 03:39:24] [INFO ] Invariant cache hit.
[2023-03-16 03:39:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:39:33] [INFO ] Implicit Places using invariants and state equation in 9153 ms returned []
Implicit Place search using SMT with State Equation took 10341 ms to find 0 implicit places.
[2023-03-16 03:39:33] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-16 03:39:33] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-16 03:39:33] [INFO ] Invariant cache hit.
[2023-03-16 03:39:35] [INFO ] Dead Transitions using invariants and state equation in 2231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12855 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting property specific reduction for Peterson-COL-7-UpperBounds-00
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:39:36] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2023-03-16 03:39:36] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:39:36] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 03:39:36] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-16 03:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:39:37] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2023-03-16 03:39:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:39:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-16 03:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:39:38] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2023-03-16 03:39:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:39:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 269 ms returned sat
[2023-03-16 03:39:39] [INFO ] Deduced a trap composed of 33 places in 949 ms of which 1 ms to minimize.
[2023-03-16 03:39:40] [INFO ] Deduced a trap composed of 49 places in 810 ms of which 1 ms to minimize.
[2023-03-16 03:39:41] [INFO ] Deduced a trap composed of 94 places in 967 ms of which 1 ms to minimize.
[2023-03-16 03:39:42] [INFO ] Deduced a trap composed of 74 places in 972 ms of which 2 ms to minimize.
[2023-03-16 03:39:42] [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 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 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 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 182 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 592/1096 places, 1704/2208 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 03:39:42] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2915 ms. (steps per millisecond=343 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 1) seen :1
[2023-03-16 03:39:46] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-16 03:39:46] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-16 03:39:46] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-16 03:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:39:46] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-16 03:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:39:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-16 03:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:39:47] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-16 03:39:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:39:47] [INFO ] [Nat]Added 497 Read/Feed constraints in 94 ms returned sat
[2023-03-16 03:39:48] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 1 ms to minimize.
[2023-03-16 03:39:48] [INFO ] Deduced a trap composed of 78 places in 492 ms of which 1 ms to minimize.
[2023-03-16 03:39:49] [INFO ] Deduced a trap composed of 62 places in 615 ms of which 2 ms to minimize.
[2023-03-16 03:39:49] [INFO ] Deduced a trap composed of 39 places in 466 ms of which 0 ms to minimize.
[2023-03-16 03:39:50] [INFO ] Deduced a trap composed of 47 places in 466 ms of which 1 ms to minimize.
[2023-03-16 03:39:51] [INFO ] Deduced a trap composed of 11 places in 553 ms of which 1 ms to minimize.
[2023-03-16 03:39:51] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 1 ms to minimize.
[2023-03-16 03:39:52] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 1 ms to minimize.
[2023-03-16 03:39:52] [INFO ] Deduced a trap composed of 89 places in 506 ms of which 1 ms to minimize.
[2023-03-16 03:39:53] [INFO ] Deduced a trap composed of 55 places in 509 ms of which 1 ms to minimize.
[2023-03-16 03:39:53] [INFO ] Deduced a trap composed of 38 places in 508 ms of which 1 ms to minimize.
[2023-03-16 03:39:54] [INFO ] Deduced a trap composed of 11 places in 503 ms of which 1 ms to minimize.
[2023-03-16 03:39:55] [INFO ] Deduced a trap composed of 24 places in 502 ms of which 1 ms to minimize.
[2023-03-16 03:39:55] [INFO ] Deduced a trap composed of 65 places in 506 ms of which 1 ms to minimize.
[2023-03-16 03:39:56] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 1 ms to minimize.
[2023-03-16 03:39:56] [INFO ] Deduced a trap composed of 28 places in 483 ms of which 1 ms to minimize.
[2023-03-16 03:39:57] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 1 ms to minimize.
[2023-03-16 03:39:58] [INFO ] Deduced a trap composed of 20 places in 488 ms of which 1 ms to minimize.
[2023-03-16 03:39:58] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 1 ms to minimize.
[2023-03-16 03:39:59] [INFO ] Deduced a trap composed of 32 places in 495 ms of which 1 ms to minimize.
[2023-03-16 03:40:00] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 1 ms to minimize.
[2023-03-16 03:40:00] [INFO ] Deduced a trap composed of 21 places in 505 ms of which 1 ms to minimize.
[2023-03-16 03:40:01] [INFO ] Deduced a trap composed of 22 places in 503 ms of which 1 ms to minimize.
[2023-03-16 03:40:01] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 1 ms to minimize.
[2023-03-16 03:40:02] [INFO ] Deduced a trap composed of 14 places in 501 ms of which 1 ms to minimize.
[2023-03-16 03:40:02] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2023-03-16 03:40:03] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 1 ms to minimize.
[2023-03-16 03:40:04] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2023-03-16 03:40:04] [INFO ] Deduced a trap composed of 43 places in 338 ms of which 1 ms to minimize.
[2023-03-16 03:40:04] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 1 ms to minimize.
[2023-03-16 03:40:05] [INFO ] Deduced a trap composed of 38 places in 419 ms of which 1 ms to minimize.
[2023-03-16 03:40:05] [INFO ] Deduced a trap composed of 30 places in 443 ms of which 1 ms to minimize.
[2023-03-16 03:40:06] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 1 ms to minimize.
[2023-03-16 03:40:07] [INFO ] Deduced a trap composed of 33 places in 519 ms of which 1 ms to minimize.
[2023-03-16 03:40:07] [INFO ] Deduced a trap composed of 52 places in 520 ms of which 0 ms to minimize.
[2023-03-16 03:40:08] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 1 ms to minimize.
[2023-03-16 03:40:08] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 1 ms to minimize.
[2023-03-16 03:40:09] [INFO ] Deduced a trap composed of 22 places in 357 ms of which 1 ms to minimize.
[2023-03-16 03:40:09] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 1 ms to minimize.
[2023-03-16 03:40:10] [INFO ] Deduced a trap composed of 50 places in 382 ms of which 1 ms to minimize.
[2023-03-16 03:40:10] [INFO ] Deduced a trap composed of 39 places in 450 ms of which 1 ms to minimize.
[2023-03-16 03:40:11] [INFO ] Deduced a trap composed of 47 places in 388 ms of which 1 ms to minimize.
[2023-03-16 03:40:11] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 1 ms to minimize.
[2023-03-16 03:40:12] [INFO ] Deduced a trap composed of 75 places in 347 ms of which 1 ms to minimize.
[2023-03-16 03:40:12] [INFO ] Deduced a trap composed of 38 places in 378 ms of which 0 ms to minimize.
[2023-03-16 03:40:13] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2023-03-16 03:40:14] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 1 ms to minimize.
[2023-03-16 03:40:14] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 1 ms to minimize.
[2023-03-16 03:40:15] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 1 ms to minimize.
[2023-03-16 03:40:15] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 1 ms to minimize.
[2023-03-16 03:40:16] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 1 ms to minimize.
[2023-03-16 03:40:16] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 1 ms to minimize.
[2023-03-16 03:40:17] [INFO ] Deduced a trap composed of 20 places in 484 ms of which 1 ms to minimize.
[2023-03-16 03:40:18] [INFO ] Deduced a trap composed of 59 places in 465 ms of which 1 ms to minimize.
[2023-03-16 03:40:19] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 1 ms to minimize.
[2023-03-16 03:40:19] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 0 ms to minimize.
[2023-03-16 03:40:19] [INFO ] Deduced a trap composed of 64 places in 444 ms of which 3 ms to minimize.
[2023-03-16 03:40:21] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 1 ms to minimize.
[2023-03-16 03:40:21] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 1 ms to minimize.
[2023-03-16 03:40:22] [INFO ] Deduced a trap composed of 60 places in 440 ms of which 1 ms to minimize.
[2023-03-16 03:40:22] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 1 ms to minimize.
[2023-03-16 03:40:23] [INFO ] Deduced a trap composed of 47 places in 501 ms of which 1 ms to minimize.
[2023-03-16 03:40:23] [INFO ] Deduced a trap composed of 106 places in 506 ms of which 1 ms to minimize.
[2023-03-16 03:40:24] [INFO ] Deduced a trap composed of 21 places in 497 ms of which 1 ms to minimize.
[2023-03-16 03:40:24] [INFO ] Deduced a trap composed of 93 places in 481 ms of which 1 ms to minimize.
[2023-03-16 03:40:25] [INFO ] Deduced a trap composed of 39 places in 606 ms of which 1 ms to minimize.
[2023-03-16 03:40:26] [INFO ] Deduced a trap composed of 12 places in 592 ms of which 1 ms to minimize.
[2023-03-16 03:40:26] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 1 ms to minimize.
[2023-03-16 03:40:27] [INFO ] Deduced a trap composed of 33 places in 684 ms of which 1 ms to minimize.
[2023-03-16 03:40:27] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 0 ms to minimize.
[2023-03-16 03:40:28] [INFO ] Deduced a trap composed of 39 places in 565 ms of which 1 ms to minimize.
[2023-03-16 03:40:29] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 1 ms to minimize.
[2023-03-16 03:40:31] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 44288 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 32 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 31 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-16 03:40:32] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-16 03:40:32] [INFO ] Invariant cache hit.
[2023-03-16 03:40:32] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-16 03:40:32] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-16 03:40:32] [INFO ] Invariant cache hit.
[2023-03-16 03:40:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:40:36] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 4626 ms to find 0 implicit places.
[2023-03-16 03:40:36] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-16 03:40:36] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-16 03:40:36] [INFO ] Invariant cache hit.
[2023-03-16 03:40:38] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6375 ms. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-00 in 62407 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-09
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:40:38] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :5
[2023-03-16 03:40:38] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:40:38] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-16 03:40:38] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-16 03:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:40:39] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-16 03:40:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:40:39] [INFO ] [Real]Added 497 Read/Feed constraints in 111 ms returned sat
[2023-03-16 03:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:40:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-16 03:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:40:40] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2023-03-16 03:40:41] [INFO ] [Nat]Added 497 Read/Feed constraints in 186 ms returned sat
[2023-03-16 03:40:42] [INFO ] Deduced a trap composed of 102 places in 1201 ms of which 1 ms to minimize.
[2023-03-16 03:40:43] [INFO ] Deduced a trap composed of 116 places in 1154 ms of which 2 ms to minimize.
[2023-03-16 03:40:44] [INFO ] Deduced a trap composed of 86 places in 1236 ms of which 2 ms to minimize.
[2023-03-16 03:40:44] [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) : [448] Max seen :[5]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 57 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:40:44] [INFO ] Computed 23 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9747 ms. (steps per millisecond=102 ) properties (out of 1) seen :6
Finished Best-First random walk after 716015 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=143 )
[2023-03-16 03:40:59] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:40:59] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-16 03:40:59] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 03:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:41:00] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-16 03:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:41:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-16 03:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:41:01] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-16 03:41:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:41:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 215 ms returned sat
[2023-03-16 03:41:03] [INFO ] Deduced a trap composed of 30 places in 1046 ms of which 1 ms to minimize.
[2023-03-16 03:41:04] [INFO ] Deduced a trap composed of 51 places in 988 ms of which 1 ms to minimize.
[2023-03-16 03:41:05] [INFO ] Deduced a trap composed of 35 places in 891 ms of which 1 ms to minimize.
[2023-03-16 03:41:05] [INFO ] Deduced a trap composed of 31 places in 746 ms of which 1 ms to minimize.
[2023-03-16 03:41:06] [INFO ] Deduced a trap composed of 34 places in 783 ms of which 1 ms to minimize.
[2023-03-16 03:41:07] [INFO ] Deduced a trap composed of 51 places in 1027 ms of which 2 ms to minimize.
[2023-03-16 03:41:08] [INFO ] Deduced a trap composed of 51 places in 809 ms of which 1 ms to minimize.
[2023-03-16 03:41:09] [INFO ] Deduced a trap composed of 47 places in 820 ms of which 2 ms to minimize.
[2023-03-16 03:41:10] [INFO ] Deduced a trap composed of 46 places in 853 ms of which 2 ms to minimize.
[2023-03-16 03:41:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 8911 ms
[2023-03-16 03:41:11] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 199 ms.
[2023-03-16 03:41:19] [INFO ] Deduced a trap composed of 68 places in 1008 ms of which 2 ms to minimize.
[2023-03-16 03:41:20] [INFO ] Deduced a trap composed of 168 places in 1008 ms of which 2 ms to minimize.
[2023-03-16 03:41:22] [INFO ] Deduced a trap composed of 47 places in 986 ms of which 2 ms to minimize.
[2023-03-16 03:41:23] [INFO ] Deduced a trap composed of 37 places in 1012 ms of which 2 ms to minimize.
[2023-03-16 03:41:24] [INFO ] Deduced a trap composed of 51 places in 837 ms of which 2 ms to minimize.
[2023-03-16 03:41:25] [INFO ] Deduced a trap composed of 77 places in 1052 ms of which 1 ms to minimize.
[2023-03-16 03:41:26] [INFO ] Deduced a trap composed of 60 places in 1227 ms of which 2 ms to minimize.
[2023-03-16 03:41:28] [INFO ] Deduced a trap composed of 47 places in 956 ms of which 1 ms to minimize.
[2023-03-16 03:41:28] [INFO ] Deduced a trap composed of 151 places in 845 ms of which 1 ms to minimize.
[2023-03-16 03:41:29] [INFO ] Deduced a trap composed of 118 places in 816 ms of which 1 ms to minimize.
[2023-03-16 03:41:30] [INFO ] Deduced a trap composed of 167 places in 812 ms of which 2 ms to minimize.
[2023-03-16 03:41:32] [INFO ] Deduced a trap composed of 196 places in 958 ms of which 2 ms to minimize.
[2023-03-16 03:41:33] [INFO ] Deduced a trap composed of 143 places in 841 ms of which 1 ms to minimize.
[2023-03-16 03:41:33] [INFO ] Deduced a trap composed of 163 places in 859 ms of which 1 ms to minimize.
[2023-03-16 03:41:35] [INFO ] Deduced a trap composed of 129 places in 911 ms of which 1 ms to minimize.
[2023-03-16 03:41:36] [INFO ] Deduced a trap composed of 48 places in 877 ms of which 1 ms to minimize.
[2023-03-16 03:41:37] [INFO ] Deduced a trap composed of 65 places in 1087 ms of which 1 ms to minimize.
[2023-03-16 03:41:38] [INFO ] Deduced a trap composed of 73 places in 747 ms of which 2 ms to minimize.
[2023-03-16 03:41:39] [INFO ] Deduced a trap composed of 63 places in 1056 ms of which 1 ms to minimize.
[2023-03-16 03:41:40] [INFO ] Deduced a trap composed of 149 places in 734 ms of which 1 ms to minimize.
[2023-03-16 03:41:41] [INFO ] Deduced a trap composed of 46 places in 918 ms of which 1 ms to minimize.
[2023-03-16 03:41:42] [INFO ] Deduced a trap composed of 74 places in 797 ms of which 1 ms to minimize.
[2023-03-16 03:41:42] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 24331 ms
[2023-03-16 03:41:43] [INFO ] Added : 202 causal constraints over 42 iterations in 32349 ms.(timeout) Result :sat
Minimization took 1478 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 40 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 52 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-16 03:41:45] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:41:45] [INFO ] Invariant cache hit.
[2023-03-16 03:41:46] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-16 03:41:46] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:41:46] [INFO ] Invariant cache hit.
[2023-03-16 03:41:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:41:55] [INFO ] Implicit Places using invariants and state equation in 9199 ms returned []
Implicit Place search using SMT with State Equation took 9952 ms to find 0 implicit places.
[2023-03-16 03:41:55] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-16 03:41:55] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:41:55] [INFO ] Invariant cache hit.
[2023-03-16 03:41:57] [INFO ] Dead Transitions using invariants and state equation in 1590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11659 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:41:57] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8937 ms. (steps per millisecond=111 ) properties (out of 1) seen :6
Finished Best-First random walk after 721802 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=144 )
[2023-03-16 03:42:11] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:42:11] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-16 03:42:11] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 03:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:42:12] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-16 03:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:42:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-16 03:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:42:13] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2023-03-16 03:42:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:42:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 213 ms returned sat
[2023-03-16 03:42:15] [INFO ] Deduced a trap composed of 30 places in 1214 ms of which 1 ms to minimize.
[2023-03-16 03:42:16] [INFO ] Deduced a trap composed of 51 places in 1182 ms of which 2 ms to minimize.
[2023-03-16 03:42:17] [INFO ] Deduced a trap composed of 35 places in 1052 ms of which 1 ms to minimize.
[2023-03-16 03:42:18] [INFO ] Deduced a trap composed of 31 places in 813 ms of which 2 ms to minimize.
[2023-03-16 03:42:19] [INFO ] Deduced a trap composed of 34 places in 908 ms of which 1 ms to minimize.
[2023-03-16 03:42:20] [INFO ] Deduced a trap composed of 51 places in 891 ms of which 2 ms to minimize.
[2023-03-16 03:42:21] [INFO ] Deduced a trap composed of 51 places in 741 ms of which 2 ms to minimize.
[2023-03-16 03:42:22] [INFO ] Deduced a trap composed of 47 places in 1091 ms of which 2 ms to minimize.
[2023-03-16 03:42:23] [INFO ] Deduced a trap composed of 46 places in 1072 ms of which 1 ms to minimize.
[2023-03-16 03:42:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 9715 ms
[2023-03-16 03:42:23] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 129 ms.
[2023-03-16 03:42:31] [INFO ] Deduced a trap composed of 68 places in 1154 ms of which 1 ms to minimize.
[2023-03-16 03:42:32] [INFO ] Deduced a trap composed of 168 places in 1299 ms of which 1 ms to minimize.
[2023-03-16 03:42:33] [INFO ] Deduced a trap composed of 47 places in 957 ms of which 1 ms to minimize.
[2023-03-16 03:42:35] [INFO ] Deduced a trap composed of 37 places in 1275 ms of which 2 ms to minimize.
[2023-03-16 03:42:36] [INFO ] Deduced a trap composed of 51 places in 1181 ms of which 1 ms to minimize.
[2023-03-16 03:42:37] [INFO ] Deduced a trap composed of 77 places in 1088 ms of which 2 ms to minimize.
[2023-03-16 03:42:38] [INFO ] Deduced a trap composed of 60 places in 1137 ms of which 1 ms to minimize.
[2023-03-16 03:42:39] [INFO ] Deduced a trap composed of 47 places in 899 ms of which 1 ms to minimize.
[2023-03-16 03:42:40] [INFO ] Deduced a trap composed of 151 places in 769 ms of which 1 ms to minimize.
[2023-03-16 03:42:41] [INFO ] Deduced a trap composed of 118 places in 905 ms of which 1 ms to minimize.
[2023-03-16 03:42:42] [INFO ] Deduced a trap composed of 167 places in 706 ms of which 2 ms to minimize.
[2023-03-16 03:42:43] [INFO ] Deduced a trap composed of 196 places in 689 ms of which 1 ms to minimize.
[2023-03-16 03:42:44] [INFO ] Deduced a trap composed of 143 places in 699 ms of which 1 ms to minimize.
[2023-03-16 03:42:45] [INFO ] Deduced a trap composed of 163 places in 771 ms of which 1 ms to minimize.
[2023-03-16 03:42:46] [INFO ] Deduced a trap composed of 129 places in 884 ms of which 1 ms to minimize.
[2023-03-16 03:42:47] [INFO ] Deduced a trap composed of 48 places in 859 ms of which 2 ms to minimize.
[2023-03-16 03:42:48] [INFO ] Deduced a trap composed of 65 places in 977 ms of which 1 ms to minimize.
[2023-03-16 03:42:49] [INFO ] Deduced a trap composed of 73 places in 876 ms of which 1 ms to minimize.
[2023-03-16 03:42:50] [INFO ] Deduced a trap composed of 63 places in 962 ms of which 2 ms to minimize.
[2023-03-16 03:42:51] [INFO ] Deduced a trap composed of 149 places in 912 ms of which 1 ms to minimize.
[2023-03-16 03:42:53] [INFO ] Deduced a trap composed of 46 places in 811 ms of which 1 ms to minimize.
[2023-03-16 03:42:54] [INFO ] Deduced a trap composed of 74 places in 820 ms of which 1 ms to minimize.
[2023-03-16 03:42:54] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 24261 ms
[2023-03-16 03:42:54] [INFO ] Added : 202 causal constraints over 42 iterations in 30916 ms.(timeout) Result :sat
Minimization took 1353 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 35 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 33 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-16 03:42:57] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:42:57] [INFO ] Invariant cache hit.
[2023-03-16 03:42:58] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-16 03:42:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:42:58] [INFO ] Invariant cache hit.
[2023-03-16 03:42:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:43:07] [INFO ] Implicit Places using invariants and state equation in 9034 ms returned []
Implicit Place search using SMT with State Equation took 9888 ms to find 0 implicit places.
[2023-03-16 03:43:07] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-16 03:43:07] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:43:07] [INFO ] Invariant cache hit.
[2023-03-16 03:43:09] [INFO ] Dead Transitions using invariants and state equation in 2280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12268 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:43:09] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9611 ms. (steps per millisecond=104 ) properties (out of 1) seen :6
Finished Best-First random walk after 710408 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=142 )
[2023-03-16 03:43:24] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:43:24] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 03:43:24] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2023-03-16 03:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:43:25] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2023-03-16 03:43:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:43:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 03:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:43:26] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-16 03:43:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:43:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 186 ms returned sat
[2023-03-16 03:43:27] [INFO ] Deduced a trap composed of 59 places in 849 ms of which 2 ms to minimize.
[2023-03-16 03:43:27] [INFO ] Deduced a trap composed of 117 places in 687 ms of which 1 ms to minimize.
[2023-03-16 03:43:28] [INFO ] Deduced a trap composed of 84 places in 860 ms of which 1 ms to minimize.
[2023-03-16 03:43:29] [INFO ] Deduced a trap composed of 151 places in 862 ms of which 1 ms to minimize.
[2023-03-16 03:43:30] [INFO ] Deduced a trap composed of 105 places in 708 ms of which 1 ms to minimize.
[2023-03-16 03:43:31] [INFO ] Deduced a trap composed of 63 places in 713 ms of which 1 ms to minimize.
[2023-03-16 03:43:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5213 ms
[2023-03-16 03:43:31] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 136 ms.
[2023-03-16 03:43:42] [INFO ] Deduced a trap composed of 124 places in 1198 ms of which 1 ms to minimize.
[2023-03-16 03:43:43] [INFO ] Deduced a trap composed of 60 places in 1161 ms of which 2 ms to minimize.
[2023-03-16 03:43:44] [INFO ] Deduced a trap composed of 71 places in 972 ms of which 1 ms to minimize.
[2023-03-16 03:43:45] [INFO ] Deduced a trap composed of 13 places in 970 ms of which 1 ms to minimize.
[2023-03-16 03:43:47] [INFO ] Deduced a trap composed of 51 places in 995 ms of which 10 ms to minimize.
[2023-03-16 03:43:48] [INFO ] Deduced a trap composed of 41 places in 1002 ms of which 1 ms to minimize.
[2023-03-16 03:43:49] [INFO ] Deduced a trap composed of 48 places in 884 ms of which 1 ms to minimize.
[2023-03-16 03:43:50] [INFO ] Deduced a trap composed of 15 places in 941 ms of which 1 ms to minimize.
[2023-03-16 03:43:51] [INFO ] Deduced a trap composed of 34 places in 940 ms of which 1 ms to minimize.
[2023-03-16 03:43:52] [INFO ] Deduced a trap composed of 100 places in 1031 ms of which 1 ms to minimize.
[2023-03-16 03:43:53] [INFO ] Deduced a trap composed of 78 places in 850 ms of which 1 ms to minimize.
[2023-03-16 03:43:54] [INFO ] Deduced a trap composed of 91 places in 804 ms of which 1 ms to minimize.
[2023-03-16 03:43:55] [INFO ] Deduced a trap composed of 128 places in 802 ms of which 2 ms to minimize.
[2023-03-16 03:43:57] [INFO ] Deduced a trap composed of 147 places in 926 ms of which 1 ms to minimize.
[2023-03-16 03:43:58] [INFO ] Deduced a trap composed of 89 places in 999 ms of which 2 ms to minimize.
[2023-03-16 03:43:59] [INFO ] Deduced a trap composed of 84 places in 984 ms of which 2 ms to minimize.
[2023-03-16 03:44:00] [INFO ] Deduced a trap composed of 134 places in 836 ms of which 1 ms to minimize.
[2023-03-16 03:44:01] [INFO ] Deduced a trap composed of 107 places in 780 ms of which 1 ms to minimize.
[2023-03-16 03:44:02] [INFO ] Deduced a trap composed of 87 places in 729 ms of which 2 ms to minimize.
[2023-03-16 03:44:03] [INFO ] Deduced a trap composed of 130 places in 889 ms of which 1 ms to minimize.
[2023-03-16 03:44:04] [INFO ] Deduced a trap composed of 158 places in 763 ms of which 0 ms to minimize.
[2023-03-16 03:44:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 24046 ms
[2023-03-16 03:44:05] [INFO ] Added : 275 causal constraints over 55 iterations in 33941 ms.(timeout) Result :sat
Minimization took 1288 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 61 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 80 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-16 03:44:07] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:44:07] [INFO ] Invariant cache hit.
[2023-03-16 03:44:08] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-16 03:44:08] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:44:08] [INFO ] Invariant cache hit.
[2023-03-16 03:44:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:44:17] [INFO ] Implicit Places using invariants and state equation in 9287 ms returned []
Implicit Place search using SMT with State Equation took 10039 ms to find 0 implicit places.
[2023-03-16 03:44:17] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-16 03:44:17] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:44:17] [INFO ] Invariant cache hit.
[2023-03-16 03:44:19] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12044 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-09 in 221211 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-14
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:44:19] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :2
[2023-03-16 03:44:19] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-16 03:44:19] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 03:44:20] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-16 03:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:44:20] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-16 03:44:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:44:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 03:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:44:21] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2023-03-16 03:44:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:44:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 161 ms returned sat
[2023-03-16 03:44:22] [INFO ] Deduced a trap composed of 15 places in 838 ms of which 1 ms to minimize.
[2023-03-16 03:44:23] [INFO ] Deduced a trap composed of 105 places in 787 ms of which 1 ms to minimize.
[2023-03-16 03:44:24] [INFO ] Deduced a trap composed of 99 places in 745 ms of which 1 ms to minimize.
[2023-03-16 03:44:25] [INFO ] Deduced a trap composed of 17 places in 750 ms of which 1 ms to minimize.
[2023-03-16 03:44:26] [INFO ] Deduced a trap composed of 17 places in 918 ms of which 1 ms to minimize.
[2023-03-16 03:44:26] [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) : [448] Max seen :[3]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 59 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:44:26] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9125 ms. (steps per millisecond=109 ) properties (out of 1) seen :5
Finished Best-First random walk after 723899 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=144 )
[2023-03-16 03:44:40] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:44:40] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 03:44:40] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-16 03:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:44:41] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2023-03-16 03:44:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:44:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-16 03:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:44:42] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2023-03-16 03:44:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:44:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 213 ms returned sat
[2023-03-16 03:44:43] [INFO ] Deduced a trap composed of 52 places in 1071 ms of which 1 ms to minimize.
[2023-03-16 03:44:44] [INFO ] Deduced a trap composed of 48 places in 745 ms of which 1 ms to minimize.
[2023-03-16 03:44:45] [INFO ] Deduced a trap composed of 59 places in 1063 ms of which 1 ms to minimize.
[2023-03-16 03:44:46] [INFO ] Deduced a trap composed of 34 places in 727 ms of which 1 ms to minimize.
[2023-03-16 03:44:47] [INFO ] Deduced a trap composed of 67 places in 920 ms of which 1 ms to minimize.
[2023-03-16 03:44:48] [INFO ] Deduced a trap composed of 15 places in 1110 ms of which 1 ms to minimize.
[2023-03-16 03:44:49] [INFO ] Deduced a trap composed of 21 places in 905 ms of which 2 ms to minimize.
[2023-03-16 03:44:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7211 ms
[2023-03-16 03:44:50] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 216 ms.
[2023-03-16 03:44:52] [INFO ] Added : 38 causal constraints over 8 iterations in 2071 ms. Result :sat
Minimization took 1331 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[5]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 28 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 28 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-16 03:44:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:44:53] [INFO ] Invariant cache hit.
[2023-03-16 03:44:54] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-16 03:44:54] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:44:54] [INFO ] Invariant cache hit.
[2023-03-16 03:44:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:45:02] [INFO ] Implicit Places using invariants and state equation in 8094 ms returned []
Implicit Place search using SMT with State Equation took 8909 ms to find 0 implicit places.
[2023-03-16 03:45:02] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-16 03:45:02] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:45:02] [INFO ] Invariant cache hit.
[2023-03-16 03:45:04] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10426 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:45:04] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9252 ms. (steps per millisecond=108 ) properties (out of 1) seen :6
Finished Best-First random walk after 732620 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=146 )
[2023-03-16 03:45:18] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-16 03:45:18] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-16 03:45:18] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-16 03:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:45:19] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2023-03-16 03:45:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:45:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-16 03:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:45:20] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2023-03-16 03:45:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:45:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 170 ms returned sat
[2023-03-16 03:45:21] [INFO ] Deduced a trap composed of 59 places in 768 ms of which 1 ms to minimize.
[2023-03-16 03:45:22] [INFO ] Deduced a trap composed of 117 places in 774 ms of which 2 ms to minimize.
[2023-03-16 03:45:23] [INFO ] Deduced a trap composed of 84 places in 1023 ms of which 1 ms to minimize.
[2023-03-16 03:45:24] [INFO ] Deduced a trap composed of 151 places in 820 ms of which 1 ms to minimize.
[2023-03-16 03:45:25] [INFO ] Deduced a trap composed of 105 places in 844 ms of which 1 ms to minimize.
[2023-03-16 03:45:26] [INFO ] Deduced a trap composed of 63 places in 941 ms of which 2 ms to minimize.
[2023-03-16 03:45:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5950 ms
[2023-03-16 03:45:26] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 212 ms.
[2023-03-16 03:45:37] [INFO ] Deduced a trap composed of 124 places in 1147 ms of which 1 ms to minimize.
[2023-03-16 03:45:38] [INFO ] Deduced a trap composed of 60 places in 990 ms of which 2 ms to minimize.
[2023-03-16 03:45:39] [INFO ] Deduced a trap composed of 71 places in 1031 ms of which 1 ms to minimize.
[2023-03-16 03:45:40] [INFO ] Deduced a trap composed of 13 places in 1009 ms of which 1 ms to minimize.
[2023-03-16 03:45:41] [INFO ] Deduced a trap composed of 51 places in 1070 ms of which 2 ms to minimize.
[2023-03-16 03:45:42] [INFO ] Deduced a trap composed of 41 places in 990 ms of which 1 ms to minimize.
[2023-03-16 03:45:44] [INFO ] Deduced a trap composed of 48 places in 1008 ms of which 1 ms to minimize.
[2023-03-16 03:45:45] [INFO ] Deduced a trap composed of 15 places in 1007 ms of which 1 ms to minimize.
[2023-03-16 03:45:46] [INFO ] Deduced a trap composed of 34 places in 1003 ms of which 1 ms to minimize.
[2023-03-16 03:45:47] [INFO ] Deduced a trap composed of 100 places in 864 ms of which 2 ms to minimize.
[2023-03-16 03:45:48] [INFO ] Deduced a trap composed of 78 places in 978 ms of which 2 ms to minimize.
[2023-03-16 03:45:49] [INFO ] Deduced a trap composed of 91 places in 863 ms of which 2 ms to minimize.
[2023-03-16 03:45:50] [INFO ] Deduced a trap composed of 128 places in 823 ms of which 1 ms to minimize.
[2023-03-16 03:45:51] [INFO ] Deduced a trap composed of 147 places in 840 ms of which 1 ms to minimize.
[2023-03-16 03:45:52] [INFO ] Deduced a trap composed of 89 places in 818 ms of which 1 ms to minimize.
[2023-03-16 03:45:53] [INFO ] Deduced a trap composed of 84 places in 727 ms of which 1 ms to minimize.
[2023-03-16 03:45:54] [INFO ] Deduced a trap composed of 134 places in 827 ms of which 2 ms to minimize.
[2023-03-16 03:45:55] [INFO ] Deduced a trap composed of 107 places in 803 ms of which 1 ms to minimize.
[2023-03-16 03:45:56] [INFO ] Deduced a trap composed of 87 places in 748 ms of which 2 ms to minimize.
[2023-03-16 03:45:57] [INFO ] Deduced a trap composed of 130 places in 761 ms of which 1 ms to minimize.
[2023-03-16 03:45:59] [INFO ] Deduced a trap composed of 158 places in 741 ms of which 1 ms to minimize.
[2023-03-16 03:45:59] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 23765 ms
[2023-03-16 03:45:59] [INFO ] Added : 275 causal constraints over 55 iterations in 33469 ms.(timeout) Result :sat
Minimization took 1173 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 29 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 28 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-16 03:46:01] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:46:01] [INFO ] Invariant cache hit.
[2023-03-16 03:46:02] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-16 03:46:02] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:46:02] [INFO ] Invariant cache hit.
[2023-03-16 03:46:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-16 03:46:11] [INFO ] Implicit Places using invariants and state equation in 8948 ms returned []
Implicit Place search using SMT with State Equation took 9831 ms to find 0 implicit places.
[2023-03-16 03:46:11] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-16 03:46:11] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-16 03:46:11] [INFO ] Invariant cache hit.
[2023-03-16 03:46:13] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11954 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-14 in 114193 ms.
[2023-03-16 03:46:14] [INFO ] Flatten gal took : 473 ms
[2023-03-16 03:46:14] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 17 ms.
[2023-03-16 03:46:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1096 places, 2208 transitions and 7792 arcs took 38 ms.
Total runtime 970889 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Peterson (COL), instance 7
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 1096 places, 2208 transitions, 7792 arcs.
Final Score: 207005.234
Took : 115 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12278744 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097872 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
Caught signal 15, terminating.
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="smartxred"
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 smartxred"
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 r267-smll-167863542100597"
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 ;