About the Execution of Marcie+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 |
| 9659.508 | 3600000.00 | 3655034.00 | 10306.50 | 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.r298-tall-167873952000677.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 marciexred
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 r298-tall-167873952000677
=====================================================================
--------------------
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 1679630921025
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 04:08:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 04:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 04:08:42] [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-24 04:08:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 04:08:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2023-03-24 04:08:43] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-24 04:08:43] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 04:08:43] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 04:08:43] [INFO ] Computed 13 place invariants in 10 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-24 04:08:43] [INFO ] Invariant cache hit.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-24 04:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-24 04:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:08:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:43] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-24 04:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
[2023-03-24 04:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-24 04:08:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:43] [INFO ] Added : 36 causal constraints over 8 iterations in 136 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 04:08:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 04:08:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 04:08:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-24 04:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-24 04:08:44] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 04:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:44] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 04:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-24 04:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 04:08:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 04:08:44] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2023-03-24 04:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 04:08:44] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 04:08:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:44] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:44] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-24 04:08:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2023-03-24 04:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-24 04:08:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:45] [INFO ] Added : 22 causal constraints over 5 iterations in 160 ms. Result :sat
Minimization took 33 ms.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-24 04:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
[2023-03-24 04:08:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:45] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 24 ms.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 04:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-24 04:08:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 04:08:45] [INFO ] Added : 15 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 04:08:45] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 04:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-24 04:08:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2023-03-24 04:08:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-24 04:08:45] [INFO ] Added : 36 causal constraints over 8 iterations in 260 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 04:08:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 04:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-24 04:08:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-24 04:08:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-24 04:08:46] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 20 ms.
[2023-03-24 04:08:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 04:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:46] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-24 04:08:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 04:08:46] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-24 04:08:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-24 04:08:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-24 04:08:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 04:08:46] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 13 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-24 04:08:46] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 233 ms.
[2023-03-24 04:08:46] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 25 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 213 ms. (steps per millisecond=46 ) 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 103 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 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 10001 steps, including 105 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 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 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 105 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 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 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 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :8
[2023-03-24 04:08:47] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-24 04:08:47] [INFO ] Computed 72 place invariants in 78 ms
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:48] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-24 04:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-24 04:08:48] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:49] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2023-03-24 04:08:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:08:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 157 ms returned sat
[2023-03-24 04:08:49] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 175 ms.
[2023-03-24 04:08:51] [INFO ] Added : 30 causal constraints over 6 iterations in 1843 ms. Result :sat
Minimization took 521 ms.
[2023-03-24 04:08:51] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-24 04:08:51] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-24 04:08:51] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:51] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 04:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:52] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-24 04:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-24 04:08:52] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-24 04:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:53] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-24 04:08:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 288 ms returned sat
[2023-03-24 04:08:53] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 364 ms.
[2023-03-24 04:08:54] [INFO ] Deduced a trap composed of 226 places in 391 ms of which 1 ms to minimize.
[2023-03-24 04:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2023-03-24 04:08:55] [INFO ] Added : 16 causal constraints over 4 iterations in 1580 ms. Result :sat
Minimization took 577 ms.
[2023-03-24 04:08:55] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-24 04:08:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-24 04:08:55] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 04:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:56] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-24 04:08:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:56] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-24 04:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:56] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-24 04:08:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 04:08:57] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 111 ms.
[2023-03-24 04:08:57] [INFO ] Added : 7 causal constraints over 2 iterations in 350 ms. Result :sat
Minimization took 289 ms.
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned unsat
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:08:58] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-24 04:08:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:08:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-24 04:08:58] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned unsat
[2023-03-24 04:08:58] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-24 04:08:58] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 2147483647, 1, 4, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 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-07 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-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 22 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
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 112 place count 413 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
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 118 place count 410 transition count 1596
Applied a total of 118 rules in 250 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
[2023-03-24 04:08:58] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2023-03-24 04:08:59] [INFO ] Computed 62 place invariants in 53 ms
[2023-03-24 04:08:59] [INFO ] Dead Transitions using invariants and state equation in 583 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 : 410/474 places, 981/1650 transitions.
Applied a total of 0 rules in 31 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 869 ms. Remains : 410/474 places, 981/1650 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:08:59] [INFO ] Computed 62 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 72668 resets, run finished after 9168 ms. (steps per millisecond=109 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9766 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9673 resets, run finished after 1645 ms. (steps per millisecond=607 ) properties (out of 2) seen :4
[2023-03-24 04:09:12] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:09:12] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-24 04:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-24 04:09:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:09:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-24 04:09:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:09:12] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-24 04:09:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:09:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 04:09:13] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:09:13] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-24 04:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:09:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 102 ms returned sat
[2023-03-24 04:09:13] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 4 ms to minimize.
[2023-03-24 04:09:13] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 1 ms to minimize.
[2023-03-24 04:09:14] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:09:14] [INFO ] Deduced a trap composed of 152 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:09:14] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:09:14] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:09:15] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:15] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 0 ms to minimize.
[2023-03-24 04:09:15] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:09:15] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:09:16] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-24 04:09:16] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:09:16] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-24 04:09:16] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 0 ms to minimize.
[2023-03-24 04:09:17] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-24 04:09:17] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-24 04:09:17] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:09:17] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:09:18] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:09:18] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-24 04:09:18] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:09:18] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-24 04:09:19] [INFO ] Deduced a trap composed of 176 places in 211 ms of which 1 ms to minimize.
[2023-03-24 04:09:19] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2023-03-24 04:09:19] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:09:20] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-24 04:09:20] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:20] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:09:20] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:09:21] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:09:21] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-24 04:09:21] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:09:21] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:09:22] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:09:22] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 4 ms to minimize.
[2023-03-24 04:09:22] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:22] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:09:23] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:09:23] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:09:24] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-24 04:09:25] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 5 ms to minimize.
[2023-03-24 04:09:26] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:09:26] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:27] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:09:27] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:09:27] [INFO ] Deduced a trap composed of 177 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:09:27] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:28] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
[2023-03-24 04:09:28] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:31] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 2 ms to minimize.
[2023-03-24 04:09:31] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-24 04:09:32] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2023-03-24 04:09:32] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 4 ms to minimize.
[2023-03-24 04:09:32] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:09:32] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-24 04:09:33] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:09:33] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:09:33] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 0 ms to minimize.
[2023-03-24 04:09:34] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:34] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 1 ms to minimize.
[2023-03-24 04:09:34] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:09:34] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-24 04:09:35] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:09:35] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-24 04:09:35] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-24 04:09:36] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:09:36] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:36] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:37] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:09:37] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:09:37] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 0 ms to minimize.
[2023-03-24 04:09:38] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:09:38] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2023-03-24 04:09:38] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:09:39] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:09:39] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:09:39] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:09:40] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:09:40] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:09:41] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:09:43] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:09:43] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:09:44] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-24 04:09:44] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:09:44] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:09:45] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-24 04:09:45] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:45] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:46] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 1 ms to minimize.
[2023-03-24 04:09:46] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:09:46] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 0 ms to minimize.
[2023-03-24 04:09:47] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2023-03-24 04:09:47] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2023-03-24 04:09:47] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-24 04:09:48] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:09:48] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:09:48] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:09:48] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:49] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:09:49] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:09:50] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 1 ms to minimize.
[2023-03-24 04:09:50] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:09:51] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:09:51] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:09:52] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:09:52] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:09:52] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:09:53] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:09:56] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 42863 ms
Current structural bounds on expressions (after SMT) : [1, 4] Max seen :[1, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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 22 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.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:09:56] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 72865 resets, run finished after 8935 ms. (steps per millisecond=111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9644 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 1) seen :3
[2023-03-24 04:10:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:10:06] [INFO ] Computed 62 place invariants in 29 ms
[2023-03-24 04:10:06] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 04:10:06] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-24 04:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:10:07] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-24 04:10:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:10:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-24 04:10:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:10:07] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-24 04:10:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:10:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 100 ms returned sat
[2023-03-24 04:10:07] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-24 04:10:08] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:08] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:10:08] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:08] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 1 ms to minimize.
[2023-03-24 04:10:08] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-24 04:10:09] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:09] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-24 04:10:09] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:10:09] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:10] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-24 04:10:10] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-24 04:10:10] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:10] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:10:11] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:11] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:10:11] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2023-03-24 04:10:11] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:10:12] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:12] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:10:12] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 1 ms to minimize.
[2023-03-24 04:10:12] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:10:13] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:13] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2023-03-24 04:10:13] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:14] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:14] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:10:14] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:10:14] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:10:15] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:10:15] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:10:15] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-24 04:10:16] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:16] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:16] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:16] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:10:17] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 0 ms to minimize.
[2023-03-24 04:10:17] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:10:17] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:18] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-24 04:10:19] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:10:20] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:20] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:21] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2023-03-24 04:10:21] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:21] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 1 ms to minimize.
[2023-03-24 04:10:21] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:22] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:10:22] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:25] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 1 ms to minimize.
[2023-03-24 04:10:25] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-24 04:10:26] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2023-03-24 04:10:26] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:10:26] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:10:26] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:27] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:10:27] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:27] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:28] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:28] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:28] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:29] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:10:29] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:10:29] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:29] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-24 04:10:30] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:10:30] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-24 04:10:30] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:10:31] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-24 04:10:31] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-24 04:10:31] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:32] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2023-03-24 04:10:32] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:10:32] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:33] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:10:33] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 0 ms to minimize.
[2023-03-24 04:10:33] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-24 04:10:34] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-24 04:10:34] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:10:35] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:37] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-24 04:10:37] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:10:38] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 1 ms to minimize.
[2023-03-24 04:10:38] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:10:39] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 1 ms to minimize.
[2023-03-24 04:10:39] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:39] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:10:39] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:10:40] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:10:40] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:40] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:10:41] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:10:41] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-24 04:10:41] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:42] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:10:42] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:10:42] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:10:43] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:10:43] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:10:43] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 1 ms to minimize.
[2023-03-24 04:10:44] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:10:44] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2023-03-24 04:10:45] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-24 04:10:46] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:10:46] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-24 04:10:46] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-24 04:10:47] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:10:47] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 2 ms to minimize.
[2023-03-24 04:10:50] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 42904 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 30 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 30 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 25 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-24 04:10:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:10:50] [INFO ] Invariant cache hit.
[2023-03-24 04:10:50] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-24 04:10:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:10:50] [INFO ] Invariant cache hit.
[2023-03-24 04:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:10:52] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-24 04:10:52] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-24 04:10:52] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:10:52] [INFO ] Invariant cache hit.
[2023-03-24 04:10:53] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2743 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-24 04:10:53] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 715 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-24 04:10:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:10:53] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-24 04:10:53] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 04:10:53] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-24 04:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:10:53] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-24 04:10:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:10:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 04:10:53] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-24 04:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:10:53] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-24 04:10:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:10:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2023-03-24 04:10:54] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:10:54] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:10:54] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:10:54] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:10:55] [INFO ] Deduced a trap composed of 152 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:10:55] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:55] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:10:55] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:10:56] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:10:56] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:56] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:10:56] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-24 04:10:57] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:10:57] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:10:57] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:10:57] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:10:58] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:10:58] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:10:58] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:10:58] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2023-03-24 04:10:58] [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 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-24 04:10:58] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:10:58] [INFO ] Invariant cache hit.
[2023-03-24 04:10:59] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 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-24 04:10:59] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72564 resets, run finished after 8873 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9624 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 1) seen :3
[2023-03-24 04:11:09] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 04:11:09] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-24 04:11:09] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 04:11:09] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-24 04:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 04:11:10] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-24 04:11:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 04:11:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 04:11:10] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-24 04:11:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 04:11:10] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-24 04:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2023-03-24 04:11:10] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:11:10] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:11:11] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:11:11] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 1 ms to minimize.
[2023-03-24 04:11:11] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:11:11] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:11:12] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:11:12] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:12] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-24 04:11:12] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:13] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:13] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:13] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:11:13] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:14] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:14] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:14] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:14] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:15] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-24 04:11:15] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:15] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:15] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:16] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:16] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:16] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 1 ms to minimize.
[2023-03-24 04:11:17] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:17] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:11:17] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-24 04:11:17] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:18] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:11:18] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:18] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:11:18] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:19] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2023-03-24 04:11:19] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-24 04:11:19] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-24 04:11:19] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-24 04:11:20] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2023-03-24 04:11:20] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:11:20] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:11:22] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:11:23] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2023-03-24 04:11:23] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-24 04:11:23] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 0 ms to minimize.
[2023-03-24 04:11:24] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:24] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:24] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-24 04:11:25] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:11:25] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:28] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 0 ms to minimize.
[2023-03-24 04:11:28] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:28] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:29] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:11:29] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:29] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:30] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:30] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:30] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:30] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:11:31] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2023-03-24 04:11:31] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:31] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:31] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:11:32] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2023-03-24 04:11:32] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:32] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-24 04:11:33] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:33] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2023-03-24 04:11:33] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:11:34] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-24 04:11:34] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:11:34] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:35] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2023-03-24 04:11:35] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-24 04:11:35] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:11:36] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:36] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-24 04:11:36] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2023-03-24 04:11:37] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-24 04:11:37] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-24 04:11:40] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:40] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:40] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-24 04:11:41] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:11:41] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 0 ms to minimize.
[2023-03-24 04:11:41] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-24 04:11:42] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-24 04:11:42] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-24 04:11:42] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:11:43] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-24 04:11:43] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:11:44] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-24 04:11:44] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-24 04:11:44] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:44] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:45] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-24 04:11:45] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-24 04:11:45] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 1 ms to minimize.
[2023-03-24 04:11:45] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:46] [INFO ] Deduced a trap composed of 175 places in 199 ms of which 1 ms to minimize.
[2023-03-24 04:11:47] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-24 04:11:47] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-24 04:11:48] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:48] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-24 04:11:49] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-24 04:11:49] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-24 04:11:49] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-24 04:11:50] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-24 04:11:53] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 42546 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 15 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 16 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-24 04:11:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:11:53] [INFO ] Invariant cache hit.
[2023-03-24 04:11:53] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-24 04:11:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:11:53] [INFO ] Invariant cache hit.
[2023-03-24 04:11:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:11:55] [INFO ] Implicit Places using invariants and state equation in 1864 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2023-03-24 04:11:55] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-24 04:11:55] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 04:11:55] [INFO ] Invariant cache hit.
[2023-03-24 04:11:55] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2613 ms. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08 in 62501 ms.
[2023-03-24 04:11:55] [INFO ] Flatten gal took : 201 ms
[2023-03-24 04:11:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-24 04:11:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 981 transitions and 6619 arcs took 13 ms.
Total runtime 193561 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PolyORBNT_COL_S10J20_unf
(NrP: 410 NrTr: 981 NrArc: 6619)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.057sec
net check time: 0m 0.000sec
init dd package: 0m 2.731sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6483652 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094228 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.003sec
871120 1907506
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="marciexred"
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 marciexred"
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 r298-tall-167873952000677"
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 ;