About the Execution of Smart+red for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11166.044 | 3600000.00 | 3663160.00 | 9069.70 | 10 1 1 1 3 1 10 1 ? 1 1 1 1 1 1 1 | 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.r299-tall-167873953300677.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 PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953300677
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679529869797
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=PolyORBNT-COL-S10J20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 00:04:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 00:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:04:31] [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-23 00:04:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 00:04:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 524 ms
[2023-03-23 00:04:31] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 00:04:31] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 00:04:31] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 00:04:32] [INFO ] Computed 13 place invariants in 5 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 00:04:32] [INFO ] Invariant cache hit.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 00:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 00:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:04:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:04:32] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
[2023-03-23 00:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 00:04:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:04:32] [INFO ] Added : 36 causal constraints over 8 iterations in 256 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-23 00:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:04:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:04:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-23 00:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 00:04:33] [INFO ] Added : 36 causal constraints over 8 iterations in 196 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-23 00:04:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:04:33] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 00:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:04:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-23 00:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 00:04:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:04:33] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2023-03-23 00:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-23 00:04:33] [INFO ] Added : 36 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 00:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:04:33] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:04:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-23 00:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-23 00:04:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:04:33] [INFO ] Added : 22 causal constraints over 5 iterations in 167 ms. Result :sat
Minimization took 34 ms.
[2023-03-23 00:04:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2023-03-23 00:04:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:04:34] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 23 ms.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-23 00:04:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:04:34] [INFO ] Added : 15 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:04:34] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 00:04:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2023-03-23 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-23 00:04:34] [INFO ] Added : 36 causal constraints over 8 iterations in 262 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 00:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:04:35] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-23 00:04:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-23 00:04:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:04:35] [INFO ] Added : 36 causal constraints over 8 iterations in 35 ms. Result :sat
Minimization took 10 ms.
[2023-03-23 00:04:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 00:04:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:35] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 00:04:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:04:35] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-23 00:04:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2023-03-23 00:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-23 00:04:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:04:35] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, -1, 3, -1, -1, 4, -1, 1, -1, -1, -1, -1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 00:04:35] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 187 ms.
[2023-03-23 00:04:35] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 26 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 13) seen :13
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :2
[2023-03-23 00:04:36] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-23 00:04:36] [INFO ] Computed 72 place invariants in 68 ms
[2023-03-23 00:04:36] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-23 00:04:36] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 00:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:36] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-23 00:04:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-23 00:04:36] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 00:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:37] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2023-03-23 00:04:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:04:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 268 ms returned sat
[2023-03-23 00:04:38] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 1 ms to minimize.
[2023-03-23 00:04:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1121 ms
[2023-03-23 00:04:39] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 165 ms.
[2023-03-23 00:04:41] [INFO ] Added : 5 causal constraints over 1 iterations in 2794 ms. Result :unknown
[2023-03-23 00:04:41] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-23 00:04:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-23 00:04:41] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-23 00:04:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-23 00:04:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:42] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:42] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-23 00:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:43] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 00:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:44] [INFO ] [Nat]Absence check using state equation in 1613 ms returned sat
[2023-03-23 00:04:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-23 00:04:45] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 366 ms.
[2023-03-23 00:04:45] [INFO ] Added : 12 causal constraints over 3 iterations in 659 ms. Result :sat
Minimization took 304 ms.
[2023-03-23 00:04:45] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:46] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2023-03-23 00:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:46] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 00:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:46] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-23 00:04:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 491 ms returned sat
[2023-03-23 00:04:47] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 118 ms.
[2023-03-23 00:04:48] [INFO ] Deduced a trap composed of 238 places in 363 ms of which 1 ms to minimize.
[2023-03-23 00:04:49] [INFO ] Deduced a trap composed of 19 places in 403 ms of which 1 ms to minimize.
[2023-03-23 00:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 959 ms
[2023-03-23 00:04:49] [INFO ] Added : 32 causal constraints over 7 iterations in 1758 ms. Result :sat
Minimization took 458 ms.
[2023-03-23 00:04:49] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:49] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:50] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2023-03-23 00:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:50] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 00:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:50] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-23 00:04:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:04:51] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 113 ms.
[2023-03-23 00:04:51] [INFO ] Added : 7 causal constraints over 2 iterations in 342 ms. Result :sat
Minimization took 288 ms.
[2023-03-23 00:04:51] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:51] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:52] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-23 00:04:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-23 00:04:52] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 00:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:52] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2023-03-23 00:04:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 199 ms returned sat
[2023-03-23 00:04:53] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 122 ms.
[2023-03-23 00:04:54] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2023-03-23 00:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2023-03-23 00:04:54] [INFO ] Added : 27 causal constraints over 6 iterations in 1086 ms. Result :sat
Minimization took 514 ms.
[2023-03-23 00:04:54] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:54] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:55] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-23 00:04:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 00:04:55] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:56] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2023-03-23 00:04:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 281 ms returned sat
[2023-03-23 00:04:56] [INFO ] Deduced a trap composed of 137 places in 299 ms of which 1 ms to minimize.
[2023-03-23 00:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2023-03-23 00:04:57] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 114 ms.
[2023-03-23 00:04:59] [INFO ] Added : 36 causal constraints over 8 iterations in 2249 ms. Result :sat
Minimization took 355 ms.
[2023-03-23 00:04:59] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:04:59] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 00:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:05:00] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-23 00:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:05:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:05:00] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 00:05:00] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:05:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:05:00] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-23 00:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:05:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 00:05:00] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:05:01] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-23 00:05:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 389 ms returned sat
[2023-03-23 00:05:01] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 106 ms.
[2023-03-23 00:05:02] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 0 ms to minimize.
[2023-03-23 00:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2023-03-23 00:05:02] [INFO ] Added : 28 causal constraints over 7 iterations in 1322 ms. Result :sat
Minimization took 477 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 1, 4, 2147483647, 1, 2147483647, 2147483647, 1, 2147483647] Max seen :[0, 1, 1, 1, 3, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 26 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 464 transition count 1647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 461 transition count 1647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 16 place count 461 transition count 1622
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 66 place count 436 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 435 transition count 1621
Applied a total of 68 rules in 260 ms. Remains 435 /474 variables (removed 39) and now considering 1621/1650 (removed 29) transitions.
[2023-03-23 00:05:04] [INFO ] Flow matrix only has 1612 transitions (discarded 9 similar events)
// Phase 1: matrix 1612 rows 435 cols
[2023-03-23 00:05:04] [INFO ] Computed 62 place invariants in 35 ms
[2023-03-23 00:05:04] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/474 places, 1006/1650 transitions.
Applied a total of 0 rules in 37 ms. Remains 435 /435 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 988 ms. Remains : 435/474 places, 1006/1650 transitions.
Normalized transition count is 997 out of 1006 initially.
// Phase 1: matrix 997 rows 435 cols
[2023-03-23 00:05:04] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 69940 resets, run finished after 8924 ms. (steps per millisecond=112 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9624 resets, run finished after 1682 ms. (steps per millisecond=594 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 9691 resets, run finished after 1665 ms. (steps per millisecond=600 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 9571 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9643 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9574 resets, run finished after 1652 ms. (steps per millisecond=605 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9707 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties (out of 6) seen :8
[2023-03-23 00:05:24] [INFO ] Flow matrix only has 997 transitions (discarded 9 similar events)
// Phase 1: matrix 997 rows 435 cols
[2023-03-23 00:05:24] [INFO ] Computed 62 place invariants in 24 ms
[2023-03-23 00:05:24] [INFO ] [Real]Absence check using 56 positive place invariants in 25 ms returned sat
[2023-03-23 00:05:24] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 17 ms returned unsat
[2023-03-23 00:05:24] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-23 00:05:24] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-23 00:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:05:24] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-23 00:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:05:24] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-23 00:05:24] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-23 00:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:05:24] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-23 00:05:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:05:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-23 00:05:25] [INFO ] Deduced a trap composed of 189 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:05:25] [INFO ] Deduced a trap composed of 189 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:05:25] [INFO ] Deduced a trap composed of 191 places in 224 ms of which 0 ms to minimize.
[2023-03-23 00:05:26] [INFO ] Deduced a trap composed of 193 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:05:26] [INFO ] Deduced a trap composed of 185 places in 226 ms of which 1 ms to minimize.
[2023-03-23 00:05:26] [INFO ] Deduced a trap composed of 195 places in 218 ms of which 0 ms to minimize.
[2023-03-23 00:05:26] [INFO ] Deduced a trap composed of 187 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:05:27] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 1 ms to minimize.
[2023-03-23 00:05:27] [INFO ] Deduced a trap composed of 185 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:05:27] [INFO ] Deduced a trap composed of 195 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:05:27] [INFO ] Deduced a trap composed of 195 places in 228 ms of which 1 ms to minimize.
[2023-03-23 00:05:28] [INFO ] Deduced a trap composed of 199 places in 214 ms of which 0 ms to minimize.
[2023-03-23 00:05:28] [INFO ] Deduced a trap composed of 193 places in 211 ms of which 1 ms to minimize.
[2023-03-23 00:05:28] [INFO ] Deduced a trap composed of 191 places in 219 ms of which 3 ms to minimize.
[2023-03-23 00:05:28] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 0 ms to minimize.
[2023-03-23 00:05:29] [INFO ] Deduced a trap composed of 187 places in 208 ms of which 1 ms to minimize.
[2023-03-23 00:05:29] [INFO ] Deduced a trap composed of 187 places in 227 ms of which 1 ms to minimize.
[2023-03-23 00:05:29] [INFO ] Deduced a trap composed of 189 places in 238 ms of which 0 ms to minimize.
[2023-03-23 00:05:30] [INFO ] Deduced a trap composed of 193 places in 224 ms of which 0 ms to minimize.
[2023-03-23 00:05:30] [INFO ] Deduced a trap composed of 187 places in 218 ms of which 1 ms to minimize.
[2023-03-23 00:05:30] [INFO ] Deduced a trap composed of 187 places in 215 ms of which 0 ms to minimize.
[2023-03-23 00:05:31] [INFO ] Deduced a trap composed of 189 places in 206 ms of which 0 ms to minimize.
[2023-03-23 00:05:31] [INFO ] Deduced a trap composed of 183 places in 229 ms of which 0 ms to minimize.
[2023-03-23 00:05:31] [INFO ] Deduced a trap composed of 191 places in 215 ms of which 0 ms to minimize.
[2023-03-23 00:05:31] [INFO ] Deduced a trap composed of 190 places in 208 ms of which 1 ms to minimize.
[2023-03-23 00:05:32] [INFO ] Deduced a trap composed of 193 places in 237 ms of which 0 ms to minimize.
[2023-03-23 00:05:32] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:05:32] [INFO ] Deduced a trap composed of 187 places in 210 ms of which 0 ms to minimize.
[2023-03-23 00:05:32] [INFO ] Deduced a trap composed of 194 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:05:33] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 1 ms to minimize.
[2023-03-23 00:05:33] [INFO ] Deduced a trap composed of 185 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:05:33] [INFO ] Deduced a trap composed of 195 places in 218 ms of which 1 ms to minimize.
[2023-03-23 00:05:34] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 0 ms to minimize.
[2023-03-23 00:05:34] [INFO ] Deduced a trap composed of 206 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:05:34] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 1 ms to minimize.
[2023-03-23 00:05:35] [INFO ] Deduced a trap composed of 189 places in 220 ms of which 4 ms to minimize.
[2023-03-23 00:05:35] [INFO ] Deduced a trap composed of 195 places in 213 ms of which 1 ms to minimize.
[2023-03-23 00:05:35] [INFO ] Deduced a trap composed of 191 places in 224 ms of which 1 ms to minimize.
[2023-03-23 00:05:35] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:05:36] [INFO ] Deduced a trap composed of 195 places in 215 ms of which 0 ms to minimize.
[2023-03-23 00:05:36] [INFO ] Deduced a trap composed of 189 places in 238 ms of which 1 ms to minimize.
[2023-03-23 00:05:37] [INFO ] Deduced a trap composed of 191 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:05:37] [INFO ] Deduced a trap composed of 193 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:05:38] [INFO ] Deduced a trap composed of 193 places in 218 ms of which 1 ms to minimize.
[2023-03-23 00:05:38] [INFO ] Deduced a trap composed of 199 places in 215 ms of which 2 ms to minimize.
[2023-03-23 00:05:39] [INFO ] Deduced a trap composed of 191 places in 238 ms of which 1 ms to minimize.
[2023-03-23 00:05:39] [INFO ] Deduced a trap composed of 193 places in 228 ms of which 1 ms to minimize.
[2023-03-23 00:05:39] [INFO ] Deduced a trap composed of 189 places in 223 ms of which 1 ms to minimize.
[2023-03-23 00:05:40] [INFO ] Deduced a trap composed of 193 places in 232 ms of which 1 ms to minimize.
[2023-03-23 00:05:40] [INFO ] Deduced a trap composed of 195 places in 235 ms of which 1 ms to minimize.
[2023-03-23 00:05:40] [INFO ] Deduced a trap composed of 191 places in 237 ms of which 1 ms to minimize.
[2023-03-23 00:05:40] [INFO ] Deduced a trap composed of 187 places in 233 ms of which 0 ms to minimize.
[2023-03-23 00:05:41] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 1 ms to minimize.
[2023-03-23 00:05:41] [INFO ] Deduced a trap composed of 197 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:05:42] [INFO ] Deduced a trap composed of 189 places in 210 ms of which 0 ms to minimize.
[2023-03-23 00:05:42] [INFO ] Deduced a trap composed of 191 places in 217 ms of which 0 ms to minimize.
[2023-03-23 00:05:42] [INFO ] Deduced a trap composed of 187 places in 211 ms of which 0 ms to minimize.
[2023-03-23 00:05:43] [INFO ] Deduced a trap composed of 195 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:05:43] [INFO ] Deduced a trap composed of 187 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:05:43] [INFO ] Deduced a trap composed of 185 places in 216 ms of which 1 ms to minimize.
[2023-03-23 00:05:44] [INFO ] Deduced a trap composed of 193 places in 236 ms of which 0 ms to minimize.
[2023-03-23 00:05:44] [INFO ] Deduced a trap composed of 193 places in 232 ms of which 1 ms to minimize.
[2023-03-23 00:05:45] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:05:46] [INFO ] Deduced a trap composed of 199 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:05:46] [INFO ] Deduced a trap composed of 193 places in 237 ms of which 0 ms to minimize.
[2023-03-23 00:05:46] [INFO ] Deduced a trap composed of 195 places in 231 ms of which 0 ms to minimize.
[2023-03-23 00:05:47] [INFO ] Deduced a trap composed of 191 places in 227 ms of which 1 ms to minimize.
[2023-03-23 00:05:47] [INFO ] Deduced a trap composed of 193 places in 232 ms of which 1 ms to minimize.
[2023-03-23 00:05:50] [INFO ] Trap strengthening (SAT) tested/added 68/68 trap constraints in 25363 ms
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 14 ms returned unsat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-23 00:05:50] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 1, 1] Max seen :[1, 3, 1, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1006/1006 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 1004
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 433 transition count 1004
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 433 transition count 983
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 410 transition count 981
Applied a total of 50 rules in 64 ms. Remains 410 /435 variables (removed 25) and now considering 981/1006 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 410/435 places, 981/1006 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:05:50] [INFO ] Computed 62 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 72433 resets, run finished after 8910 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9648 resets, run finished after 1625 ms. (steps per millisecond=615 ) properties (out of 1) seen :3
[2023-03-23 00:06:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:06:01] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-23 00:06:01] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-23 00:06:01] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:01] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-23 00:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:06:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-23 00:06:01] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:01] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-23 00:06:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 181 ms returned sat
[2023-03-23 00:06:02] [INFO ] Deduced a trap composed of 170 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:06:02] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:06:02] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 0 ms to minimize.
[2023-03-23 00:06:03] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 0 ms to minimize.
[2023-03-23 00:06:03] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:06:03] [INFO ] Deduced a trap composed of 181 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:03] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:06:04] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:06:04] [INFO ] Deduced a trap composed of 169 places in 240 ms of which 1 ms to minimize.
[2023-03-23 00:06:04] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 1 ms to minimize.
[2023-03-23 00:06:04] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 2 ms to minimize.
[2023-03-23 00:06:05] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-23 00:06:05] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:06:05] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-23 00:06:06] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-23 00:06:06] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-23 00:06:06] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-23 00:06:06] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-23 00:06:07] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:06:07] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:07] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:07] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-23 00:06:08] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 1 ms to minimize.
[2023-03-23 00:06:08] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-23 00:06:08] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 1 ms to minimize.
[2023-03-23 00:06:09] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2023-03-23 00:06:09] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-23 00:06:09] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-23 00:06:09] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:06:10] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:10] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-23 00:06:10] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 0 ms to minimize.
[2023-03-23 00:06:10] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-23 00:06:11] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:06:11] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 0 ms to minimize.
[2023-03-23 00:06:11] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-23 00:06:12] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 0 ms to minimize.
[2023-03-23 00:06:12] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:06:12] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 1 ms to minimize.
[2023-03-23 00:06:12] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-23 00:06:13] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:06:13] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-23 00:06:13] [INFO ] Deduced a trap composed of 181 places in 210 ms of which 0 ms to minimize.
[2023-03-23 00:06:14] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:06:15] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:15] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 0 ms to minimize.
[2023-03-23 00:06:16] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:06:16] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-23 00:06:17] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:06:17] [INFO ] Deduced a trap composed of 189 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:06:17] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:06:18] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:06:18] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:06:19] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
[2023-03-23 00:06:19] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:06:19] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:06:19] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:22] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 20923 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 00:06:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:06:23] [INFO ] Invariant cache hit.
[2023-03-23 00:06:23] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-23 00:06:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:06:23] [INFO ] Invariant cache hit.
[2023-03-23 00:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:06:24] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2023-03-23 00:06:24] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-23 00:06:24] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:06:24] [INFO ] Invariant cache hit.
[2023-03-23 00:06:25] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1991 ms. Remains : 410/410 places, 981/981 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:06:25] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 717 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-23 00:06:25] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:06:25] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-23 00:06:25] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-23 00:06:25] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-23 00:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:25] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-23 00:06:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:06:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-23 00:06:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:25] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-23 00:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:06:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 190 ms returned sat
[2023-03-23 00:06:26] [INFO ] Deduced a trap composed of 170 places in 232 ms of which 0 ms to minimize.
[2023-03-23 00:06:26] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 0 ms to minimize.
[2023-03-23 00:06:26] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:06:26] [INFO ] Deduced a trap composed of 171 places in 233 ms of which 1 ms to minimize.
[2023-03-23 00:06:27] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:06:27] [INFO ] Deduced a trap composed of 181 places in 229 ms of which 1 ms to minimize.
[2023-03-23 00:06:27] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:28] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 0 ms to minimize.
[2023-03-23 00:06:28] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:06:28] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-23 00:06:28] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 1 ms to minimize.
[2023-03-23 00:06:29] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:06:29] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:29] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-23 00:06:29] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:30] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-23 00:06:30] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-23 00:06:30] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:30] [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) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 00:06:30] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:06:30] [INFO ] Invariant cache hit.
[2023-03-23 00:06:31] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:06:31] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72656 resets, run finished after 8758 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9575 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 1) seen :3
[2023-03-23 00:06:41] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 00:06:41] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-23 00:06:41] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-23 00:06:41] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-23 00:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:41] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-23 00:06:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:06:41] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-23 00:06:41] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 00:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:06:42] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-23 00:06:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:06:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2023-03-23 00:06:42] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-23 00:06:42] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-23 00:06:42] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 0 ms to minimize.
[2023-03-23 00:06:43] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:06:43] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 1 ms to minimize.
[2023-03-23 00:06:43] [INFO ] Deduced a trap composed of 181 places in 229 ms of which 1 ms to minimize.
[2023-03-23 00:06:44] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 1 ms to minimize.
[2023-03-23 00:06:44] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 0 ms to minimize.
[2023-03-23 00:06:44] [INFO ] Deduced a trap composed of 169 places in 238 ms of which 0 ms to minimize.
[2023-03-23 00:06:44] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 0 ms to minimize.
[2023-03-23 00:06:45] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-23 00:06:45] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:06:45] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-23 00:06:45] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:06:46] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:06:46] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:06:46] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-23 00:06:47] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-23 00:06:47] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-23 00:06:47] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-23 00:06:47] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 0 ms to minimize.
[2023-03-23 00:06:48] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-23 00:06:48] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:06:48] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:06:49] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2023-03-23 00:06:49] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2023-03-23 00:06:49] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-23 00:06:49] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-23 00:06:50] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-23 00:06:50] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2023-03-23 00:06:50] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:50] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:06:51] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-23 00:06:51] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2023-03-23 00:06:51] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-23 00:06:52] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-23 00:06:52] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-23 00:06:52] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2023-03-23 00:06:52] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 0 ms to minimize.
[2023-03-23 00:06:53] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2023-03-23 00:06:53] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:06:53] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2023-03-23 00:06:54] [INFO ] Deduced a trap composed of 181 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:06:55] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-23 00:06:55] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-23 00:06:55] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 0 ms to minimize.
[2023-03-23 00:06:56] [INFO ] Deduced a trap composed of 177 places in 212 ms of which 0 ms to minimize.
[2023-03-23 00:06:57] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:06:57] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2023-03-23 00:06:57] [INFO ] Deduced a trap composed of 189 places in 214 ms of which 1 ms to minimize.
[2023-03-23 00:06:58] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-23 00:06:58] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 0 ms to minimize.
[2023-03-23 00:06:58] [INFO ] Deduced a trap composed of 177 places in 201 ms of which 0 ms to minimize.
[2023-03-23 00:06:59] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-23 00:06:59] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2023-03-23 00:06:59] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:07:00] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 0 ms to minimize.
[2023-03-23 00:07:03] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 20867 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 00:07:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:07:03] [INFO ] Invariant cache hit.
[2023-03-23 00:07:03] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-23 00:07:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:07:03] [INFO ] Invariant cache hit.
[2023-03-23 00:07:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:07:05] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
[2023-03-23 00:07:05] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 00:07:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 00:07:05] [INFO ] Invariant cache hit.
[2023-03-23 00:07:05] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2653 ms. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08 in 40748 ms.
[2023-03-23 00:07:06] [INFO ] Flatten gal took : 157 ms
[2023-03-23 00:07:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 00:07:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 981 transitions and 6619 arcs took 8 ms.
Total runtime 154797 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J20
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: 410 places, 981 transitions, 6619 arcs.
Final Score: 58482.061
Took : 26 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4980036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101292 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="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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 r299-tall-167873953300677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;