About the Execution of ITS-Tools for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.907 | 3600000.00 | 2990843.00 | 327943.90 | 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.r293-tall-167873945700677.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 itstools
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 r293-tall-167873945700677
=====================================================================
--------------------
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 1678935637624
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 03:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 03:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:00:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 03:00:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 03:00:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 468 ms
[2023-03-16 03:00:39] [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 4 ms.
[2023-03-16 03:00:39] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-16 03:00:39] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 03:00:39] [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-16 03:00:39] [INFO ] Invariant cache hit.
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-16 03:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 03:00:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:00:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 03:00:39] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 03:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 03:00:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
[2023-03-16 03:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-16 03:00:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:00:40] [INFO ] Added : 36 causal constraints over 8 iterations in 127 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 03:00:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-16 03:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-16 03:00:40] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 17 ms.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-16 03:00:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:00:40] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-16 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 03:00:40] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2023-03-16 03:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-16 03:00:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:00:40] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2023-03-16 03:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-16 03:00:40] [INFO ] Added : 36 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 03:00:40] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-16 03:00:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:00:41] [INFO ] Added : 22 causal constraints over 5 iterations in 177 ms. Result :sat
Minimization took 37 ms.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2023-03-16 03:00:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:00:41] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 25 ms.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-16 03:00:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 03:00:41] [INFO ] Added : 15 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 03:00:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 03:00:41] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-16 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-16 03:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-16 03:00:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:00:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2023-03-16 03:00:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2023-03-16 03:00:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-16 03:00:42] [INFO ] Added : 36 causal constraints over 8 iterations in 242 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 03:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-16 03:00:42] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-16 03:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-16 03:00:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 03:00:42] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 03:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-16 03:00:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 03:00:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-16 03:00:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-16 03:00:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-16 03:00:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 03:00:42] [INFO ] Added : 36 causal constraints over 8 iterations in 36 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-16 03:00:42] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 186 ms.
[2023-03-16 03:00:42] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 27 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 202 ms. (steps per millisecond=49 ) 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 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 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 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 33 ms. (steps per millisecond=303 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 106 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 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 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 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :2
[2023-03-16 03:00:43] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-16 03:00:43] [INFO ] Computed 72 place invariants in 71 ms
[2023-03-16 03:00:43] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-16 03:00:43] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:43] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-16 03:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:00:43] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 03:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:44] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-16 03:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:00:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2023-03-16 03:00:45] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 0 ms to minimize.
[2023-03-16 03:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1083 ms
[2023-03-16 03:00:46] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 155 ms.
[2023-03-16 03:00:48] [INFO ] Added : 5 causal constraints over 1 iterations in 2897 ms. Result :unknown
[2023-03-16 03:00:48] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:00:48] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-16 03:00:49] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-16 03:00:49] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 03:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:49] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-16 03:00:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-16 03:00:49] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-16 03:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:50] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2023-03-16 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2023-03-16 03:00:51] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 350 ms.
[2023-03-16 03:00:52] [INFO ] Added : 30 causal constraints over 6 iterations in 2049 ms. Result :sat
Minimization took 532 ms.
[2023-03-16 03:00:53] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:00:53] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-16 03:00:53] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:00:53] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:53] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-16 03:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:00:53] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:54] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-16 03:00:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 294 ms returned sat
[2023-03-16 03:00:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 109 ms.
[2023-03-16 03:00:55] [INFO ] Deduced a trap composed of 226 places in 345 ms of which 0 ms to minimize.
[2023-03-16 03:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2023-03-16 03:00:56] [INFO ] Added : 16 causal constraints over 4 iterations in 1270 ms. Result :sat
Minimization took 568 ms.
[2023-03-16 03:00:56] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-16 03:00:56] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 03:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:57] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-16 03:00:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:00:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-16 03:00:57] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 03:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:00:57] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-16 03:00:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 487 ms returned sat
[2023-03-16 03:00:58] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 109 ms.
[2023-03-16 03:00:59] [INFO ] Deduced a trap composed of 238 places in 359 ms of which 0 ms to minimize.
[2023-03-16 03:00:59] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 0 ms to minimize.
[2023-03-16 03:00:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 930 ms
[2023-03-16 03:00:59] [INFO ] Added : 32 causal constraints over 7 iterations in 1655 ms. Result :sat
Minimization took 482 ms.
[2023-03-16 03:01:00] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-16 03:01:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 03:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:00] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-16 03:01:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-16 03:01:01] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-16 03:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:01] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-16 03:01:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 03:01:01] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 112 ms.
[2023-03-16 03:01:02] [INFO ] Added : 7 causal constraints over 2 iterations in 345 ms. Result :sat
Minimization took 294 ms.
[2023-03-16 03:01:02] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:01:02] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-16 03:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:02] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-16 03:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:01:03] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 03:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:03] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2023-03-16 03:01:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 209 ms returned sat
[2023-03-16 03:01:04] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 106 ms.
[2023-03-16 03:01:04] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 0 ms to minimize.
[2023-03-16 03:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2023-03-16 03:01:05] [INFO ] Added : 27 causal constraints over 6 iterations in 1094 ms. Result :sat
Minimization took 525 ms.
[2023-03-16 03:01:05] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-16 03:01:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 03:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:06] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2023-03-16 03:01:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-16 03:01:06] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 03:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:06] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-16 03:01:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 275 ms returned sat
[2023-03-16 03:01:07] [INFO ] Deduced a trap composed of 137 places in 290 ms of which 1 ms to minimize.
[2023-03-16 03:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-16 03:01:07] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 103 ms.
[2023-03-16 03:01:09] [INFO ] Added : 36 causal constraints over 8 iterations in 2188 ms. Result :sat
Minimization took 365 ms.
[2023-03-16 03:01:10] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:01:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:10] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-16 03:01:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-16 03:01:10] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 03:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:11] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2023-03-16 03:01:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2023-03-16 03:01:11] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 109 ms.
[2023-03-16 03:01:15] [INFO ] Added : 15 causal constraints over 3 iterations in 3908 ms. Result :unknown
[2023-03-16 03:01:15] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-16 03:01:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 03:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:16] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-16 03:01:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-16 03:01:16] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-16 03:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:16] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-16 03:01:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 394 ms returned sat
[2023-03-16 03:01:17] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 103 ms.
[2023-03-16 03:01:18] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 0 ms to minimize.
[2023-03-16 03:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 538 ms
[2023-03-16 03:01:18] [INFO ] Added : 28 causal constraints over 7 iterations in 1293 ms. Result :sat
Minimization took 482 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 2147483647, 1, 4, 2147483647, 1, 2147483647, 2147483647, 2147483647, 2147483647] Max seen :[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0]
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-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 68 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 464 transition count 1647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 461 transition count 1647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 16 place count 461 transition count 1622
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 66 place count 436 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 435 transition count 1621
Applied a total of 68 rules in 221 ms. Remains 435 /474 variables (removed 39) and now considering 1621/1650 (removed 29) transitions.
[2023-03-16 03:01:19] [INFO ] Flow matrix only has 1612 transitions (discarded 9 similar events)
// Phase 1: matrix 1612 rows 435 cols
[2023-03-16 03:01:20] [INFO ] Computed 62 place invariants in 48 ms
[2023-03-16 03:01:20] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/474 places, 1006/1650 transitions.
Applied a total of 0 rules in 36 ms. Remains 435 /435 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 435/474 places, 1006/1650 transitions.
Normalized transition count is 997 out of 1006 initially.
// Phase 1: matrix 997 rows 435 cols
[2023-03-16 03:01:20] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 70062 resets, run finished after 9705 ms. (steps per millisecond=103 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9576 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9560 resets, run finished after 1914 ms. (steps per millisecond=522 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9724 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9598 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9607 resets, run finished after 1977 ms. (steps per millisecond=505 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9670 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9520 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9791 resets, run finished after 1747 ms. (steps per millisecond=572 ) properties (out of 8) seen :10
[2023-03-16 03:01:44] [INFO ] Flow matrix only has 997 transitions (discarded 9 similar events)
// Phase 1: matrix 997 rows 435 cols
[2023-03-16 03:01:44] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-16 03:01:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:45] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:45] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-16 03:01:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:01:45] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 03:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:01:46] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-16 03:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:01:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-16 03:01:46] [INFO ] Deduced a trap composed of 189 places in 211 ms of which 1 ms to minimize.
[2023-03-16 03:01:46] [INFO ] Deduced a trap composed of 189 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:01:46] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 0 ms to minimize.
[2023-03-16 03:01:47] [INFO ] Deduced a trap composed of 193 places in 215 ms of which 0 ms to minimize.
[2023-03-16 03:01:47] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 0 ms to minimize.
[2023-03-16 03:01:47] [INFO ] Deduced a trap composed of 195 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:01:47] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 0 ms to minimize.
[2023-03-16 03:01:48] [INFO ] Deduced a trap composed of 197 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:01:48] [INFO ] Deduced a trap composed of 185 places in 215 ms of which 0 ms to minimize.
[2023-03-16 03:01:48] [INFO ] Deduced a trap composed of 195 places in 202 ms of which 1 ms to minimize.
[2023-03-16 03:01:48] [INFO ] Deduced a trap composed of 195 places in 210 ms of which 1 ms to minimize.
[2023-03-16 03:01:49] [INFO ] Deduced a trap composed of 199 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:01:49] [INFO ] Deduced a trap composed of 193 places in 214 ms of which 0 ms to minimize.
[2023-03-16 03:01:49] [INFO ] Deduced a trap composed of 191 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:01:49] [INFO ] Deduced a trap composed of 191 places in 198 ms of which 0 ms to minimize.
[2023-03-16 03:01:50] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 0 ms to minimize.
[2023-03-16 03:01:50] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 1 ms to minimize.
[2023-03-16 03:01:50] [INFO ] Deduced a trap composed of 189 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:01:51] [INFO ] Deduced a trap composed of 193 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:01:51] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 1 ms to minimize.
[2023-03-16 03:01:51] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 1 ms to minimize.
[2023-03-16 03:01:51] [INFO ] Deduced a trap composed of 189 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:01:52] [INFO ] Deduced a trap composed of 183 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:01:52] [INFO ] Deduced a trap composed of 191 places in 204 ms of which 1 ms to minimize.
[2023-03-16 03:01:52] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:01:53] [INFO ] Deduced a trap composed of 193 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:01:53] [INFO ] Deduced a trap composed of 187 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:01:53] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 1 ms to minimize.
[2023-03-16 03:01:53] [INFO ] Deduced a trap composed of 194 places in 216 ms of which 1 ms to minimize.
[2023-03-16 03:01:54] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:01:54] [INFO ] Deduced a trap composed of 185 places in 207 ms of which 0 ms to minimize.
[2023-03-16 03:01:54] [INFO ] Deduced a trap composed of 195 places in 213 ms of which 1 ms to minimize.
[2023-03-16 03:01:54] [INFO ] Deduced a trap composed of 187 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:01:55] [INFO ] Deduced a trap composed of 206 places in 217 ms of which 0 ms to minimize.
[2023-03-16 03:01:55] [INFO ] Deduced a trap composed of 187 places in 224 ms of which 4 ms to minimize.
[2023-03-16 03:01:55] [INFO ] Deduced a trap composed of 189 places in 215 ms of which 0 ms to minimize.
[2023-03-16 03:01:56] [INFO ] Deduced a trap composed of 195 places in 216 ms of which 1 ms to minimize.
[2023-03-16 03:01:56] [INFO ] Deduced a trap composed of 191 places in 213 ms of which 1 ms to minimize.
[2023-03-16 03:01:56] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 0 ms to minimize.
[2023-03-16 03:01:57] [INFO ] Deduced a trap composed of 195 places in 204 ms of which 1 ms to minimize.
[2023-03-16 03:01:57] [INFO ] Deduced a trap composed of 189 places in 219 ms of which 1 ms to minimize.
[2023-03-16 03:01:57] [INFO ] Deduced a trap composed of 191 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:01:58] [INFO ] Deduced a trap composed of 193 places in 218 ms of which 1 ms to minimize.
[2023-03-16 03:01:59] [INFO ] Deduced a trap composed of 193 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:01:59] [INFO ] Deduced a trap composed of 199 places in 211 ms of which 1 ms to minimize.
[2023-03-16 03:01:59] [INFO ] Deduced a trap composed of 191 places in 218 ms of which 3 ms to minimize.
[2023-03-16 03:02:00] [INFO ] Deduced a trap composed of 193 places in 213 ms of which 0 ms to minimize.
[2023-03-16 03:02:00] [INFO ] Deduced a trap composed of 189 places in 222 ms of which 0 ms to minimize.
[2023-03-16 03:02:00] [INFO ] Deduced a trap composed of 193 places in 220 ms of which 0 ms to minimize.
[2023-03-16 03:02:00] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 0 ms to minimize.
[2023-03-16 03:02:01] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 0 ms to minimize.
[2023-03-16 03:02:01] [INFO ] Deduced a trap composed of 187 places in 216 ms of which 1 ms to minimize.
[2023-03-16 03:02:01] [INFO ] Deduced a trap composed of 191 places in 210 ms of which 1 ms to minimize.
[2023-03-16 03:02:02] [INFO ] Deduced a trap composed of 197 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:02:02] [INFO ] Deduced a trap composed of 189 places in 205 ms of which 0 ms to minimize.
[2023-03-16 03:02:03] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 0 ms to minimize.
[2023-03-16 03:02:03] [INFO ] Deduced a trap composed of 187 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:02:03] [INFO ] Deduced a trap composed of 195 places in 210 ms of which 1 ms to minimize.
[2023-03-16 03:02:04] [INFO ] Deduced a trap composed of 187 places in 214 ms of which 1 ms to minimize.
[2023-03-16 03:02:04] [INFO ] Deduced a trap composed of 185 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:02:05] [INFO ] Deduced a trap composed of 193 places in 212 ms of which 0 ms to minimize.
[2023-03-16 03:02:05] [INFO ] Deduced a trap composed of 193 places in 211 ms of which 1 ms to minimize.
[2023-03-16 03:02:05] [INFO ] Deduced a trap composed of 191 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:02:06] [INFO ] Deduced a trap composed of 199 places in 217 ms of which 1 ms to minimize.
[2023-03-16 03:02:06] [INFO ] Deduced a trap composed of 193 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:02:07] [INFO ] Deduced a trap composed of 195 places in 215 ms of which 1 ms to minimize.
[2023-03-16 03:02:07] [INFO ] Deduced a trap composed of 191 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:02:07] [INFO ] Deduced a trap composed of 193 places in 211 ms of which 1 ms to minimize.
[2023-03-16 03:02:10] [INFO ] Trap strengthening (SAT) tested/added 68/68 trap constraints in 24538 ms
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:02:10] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 03:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:02:11] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-16 03:02:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:02:11] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-16 03:02:11] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-16 03:02:11] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-16 03:02:11] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 1, 1, 1, 1] Max seen :[1, 1, 3, 1, 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-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1006/1006 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 1004
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 433 transition count 1004
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 4 place count 433 transition count 983
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 410 transition count 981
Applied a total of 50 rules in 54 ms. Remains 410 /435 variables (removed 25) and now considering 981/1006 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 410/435 places, 981/1006 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-16 03:02:11] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 72541 resets, run finished after 8852 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9642 resets, run finished after 1625 ms. (steps per millisecond=615 ) properties (out of 1) seen :3
[2023-03-16 03:02:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-16 03:02:21] [INFO ] Computed 62 place invariants in 23 ms
[2023-03-16 03:02:21] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-16 03:02:21] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 03:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:02:22] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-16 03:02:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:02:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-16 03:02:22] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:02:22] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2023-03-16 03:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:02:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 178 ms returned sat
[2023-03-16 03:02:22] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:02:23] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-16 03:02:23] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 1 ms to minimize.
[2023-03-16 03:02:23] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 0 ms to minimize.
[2023-03-16 03:02:23] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:02:24] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 1 ms to minimize.
[2023-03-16 03:02:24] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 1 ms to minimize.
[2023-03-16 03:02:24] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 0 ms to minimize.
[2023-03-16 03:02:24] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 0 ms to minimize.
[2023-03-16 03:02:25] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-16 03:02:25] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:02:25] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-16 03:02:25] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:02:26] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-16 03:02:26] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:02:26] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-16 03:02:26] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:02:27] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:27] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-16 03:02:27] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:27] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 2 ms to minimize.
[2023-03-16 03:02:28] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:02:28] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:28] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2023-03-16 03:02:29] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:02:29] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:29] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:29] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:02:29] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:02:30] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-16 03:02:30] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:30] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:30] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-16 03:02:31] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:31] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-16 03:02:31] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:02:32] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-16 03:02:32] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-16 03:02:32] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 0 ms to minimize.
[2023-03-16 03:02:32] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2023-03-16 03:02:33] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-16 03:02:33] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2023-03-16 03:02:33] [INFO ] Deduced a trap composed of 181 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:02:34] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-16 03:02:35] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2023-03-16 03:02:35] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:02:36] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:02:36] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-16 03:02:37] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:02:37] [INFO ] Deduced a trap composed of 189 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:02:37] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:38] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:02:38] [INFO ] Deduced a trap composed of 177 places in 212 ms of which 2 ms to minimize.
[2023-03-16 03:02:38] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-16 03:02:39] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:39] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-16 03:02:39] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-16 03:02:42] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19993 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 35 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 35 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 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-16 03:02:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:02:42] [INFO ] Invariant cache hit.
[2023-03-16 03:02:43] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-16 03:02:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:02:43] [INFO ] Invariant cache hit.
[2023-03-16 03:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:02:44] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2023-03-16 03:02:44] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-16 03:02:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:02:44] [INFO ] Invariant cache hit.
[2023-03-16 03:02:44] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1963 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-16 03:02:44] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 736 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-16 03:02:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-16 03:02:44] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-16 03:02:44] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-16 03:02:44] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 03:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:02:45] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-16 03:02:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:02:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-16 03:02:45] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:02:45] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-16 03:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:02:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2023-03-16 03:02:45] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:02:46] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2023-03-16 03:02:46] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-16 03:02:46] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 1 ms to minimize.
[2023-03-16 03:02:46] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:02:46] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 1 ms to minimize.
[2023-03-16 03:02:47] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:02:47] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 1 ms to minimize.
[2023-03-16 03:02:47] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 0 ms to minimize.
[2023-03-16 03:02:47] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:48] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:02:48] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-16 03:02:48] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:02:49] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-16 03:02:49] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-16 03:02:49] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-16 03:02:49] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-16 03:02:49] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:02:50] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-16 03:02:50] [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 35 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-16 03:02:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:02:50] [INFO ] Invariant cache hit.
[2023-03-16 03:02:50] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 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-16 03:02:50] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72782 resets, run finished after 8868 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9718 resets, run finished after 1610 ms. (steps per millisecond=621 ) properties (out of 1) seen :3
[2023-03-16 03:03:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-16 03:03:01] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-16 03:03:01] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-16 03:03:01] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 03:03:01] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-16 03:03:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 03:03:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-16 03:03:01] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 03:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 03:03:01] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-16 03:03:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:03:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 178 ms returned sat
[2023-03-16 03:03:02] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2023-03-16 03:03:02] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-16 03:03:02] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-16 03:03:02] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 1 ms to minimize.
[2023-03-16 03:03:03] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:03:03] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:03:03] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:03:03] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:03:04] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:03:04] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2023-03-16 03:03:04] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-16 03:03:04] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-16 03:03:05] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-16 03:03:05] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:03:05] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-16 03:03:05] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-16 03:03:06] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-16 03:03:06] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:03:06] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:03:06] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-16 03:03:06] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:03:07] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-16 03:03:07] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-16 03:03:07] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2023-03-16 03:03:08] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-16 03:03:08] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:03:08] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-16 03:03:08] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-16 03:03:09] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2023-03-16 03:03:09] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2023-03-16 03:03:09] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-16 03:03:09] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 0 ms to minimize.
[2023-03-16 03:03:10] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2023-03-16 03:03:10] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2023-03-16 03:03:10] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2023-03-16 03:03:10] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-16 03:03:11] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:03:11] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-16 03:03:11] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 0 ms to minimize.
[2023-03-16 03:03:11] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2023-03-16 03:03:12] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-16 03:03:12] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-16 03:03:12] [INFO ] Deduced a trap composed of 181 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:03:13] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-16 03:03:14] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 1 ms to minimize.
[2023-03-16 03:03:14] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 1 ms to minimize.
[2023-03-16 03:03:15] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 0 ms to minimize.
[2023-03-16 03:03:15] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-16 03:03:16] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-16 03:03:16] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 1 ms to minimize.
[2023-03-16 03:03:16] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-16 03:03:17] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 0 ms to minimize.
[2023-03-16 03:03:17] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 1 ms to minimize.
[2023-03-16 03:03:18] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-16 03:03:18] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 1 ms to minimize.
[2023-03-16 03:03:18] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-16 03:03:18] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-16 03:03:21] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19923 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 15 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 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-16 03:03:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:03:21] [INFO ] Invariant cache hit.
[2023-03-16 03:03:22] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-16 03:03:22] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:03:22] [INFO ] Invariant cache hit.
[2023-03-16 03:03:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:03:23] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2023-03-16 03:03:23] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 03:03:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-16 03:03:23] [INFO ] Invariant cache hit.
[2023-03-16 03:03:23] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1866 ms. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08 in 38996 ms.
[2023-03-16 03:03:23] [INFO ] Flatten gal took : 151 ms
[2023-03-16 03:03:23] [INFO ] Applying decomposition
[2023-03-16 03:03:24] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6125022726143759050.txt' '-o' '/tmp/graph6125022726143759050.bin' '-w' '/tmp/graph6125022726143759050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6125022726143759050.bin' '-l' '-1' '-v' '-w' '/tmp/graph6125022726143759050.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:03:24] [INFO ] Decomposing Gal with order
[2023-03-16 03:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:03:24] [INFO ] Removed a total of 2740 redundant transitions.
[2023-03-16 03:03:24] [INFO ] Flatten gal took : 193 ms
[2023-03-16 03:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 48 ms.
[2023-03-16 03:03:24] [INFO ] Time to serialize gal into /tmp/UpperBounds2930799387130077925.gal : 16 ms
[2023-03-16 03:03:24] [INFO ] Time to serialize properties into /tmp/UpperBounds14028525221187798966.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2930799387130077925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14028525221187798966.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds14028525221187798966.prop.
Detected timeout of ITS tools.
[2023-03-16 03:24:42] [INFO ] Applying decomposition
[2023-03-16 03:24:43] [INFO ] Flatten gal took : 995 ms
[2023-03-16 03:24:43] [INFO ] Decomposing Gal with order
[2023-03-16 03:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:24:54] [INFO ] Removed a total of 5759 redundant transitions.
[2023-03-16 03:24:54] [INFO ] Flatten gal took : 365 ms
[2023-03-16 03:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2023-03-16 03:24:54] [INFO ] Time to serialize gal into /tmp/UpperBounds16225454197650320177.gal : 25 ms
[2023-03-16 03:24:54] [INFO ] Time to serialize properties into /tmp/UpperBounds3311539258250636599.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16225454197650320177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3311539258250636599.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds3311539258250636599.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.55311e+10,1006.95,12425284,4.90025e+06,30,2.99525e+07,4995,1820,2.347e+07,48,4749,0
Total reachable state count : 15531111405
Verifying 1 reachability properties.
Detected timeout of ITS tools.
[2023-03-16 03:45:49] [INFO ] Flatten gal took : 53 ms
[2023-03-16 03:45:49] [INFO ] Input system was already deterministic with 981 transitions.
[2023-03-16 03:45:49] [INFO ] Transformed 410 places.
[2023-03-16 03:45:49] [INFO ] Transformed 981 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 03:46:19] [INFO ] Time to serialize gal into /tmp/UpperBounds3246288988447111503.gal : 18 ms
[2023-03-16 03:46:19] [INFO ] Time to serialize properties into /tmp/UpperBounds13853657710755912900.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3246288988447111503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13853657710755912900.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13853657710755912900.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 138628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15253312 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r293-tall-167873945700677"
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 ;