About the Execution of ITS-Tools for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.176 | 3600000.00 | 3075887.00 | 367266.70 | 4 1 2 1 1 3 1 1 1 4 10 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-167873945700661.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-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945700661
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 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 94K 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678929501905
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-S05J60
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 01:18:23] [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 01:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:18:23] [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 01:18:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 01:18:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2023-03-16 01:18:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-16 01:18:23] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-16 01:18:23] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 01:18:23] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 01:18:24] [INFO ] Invariant cache hit.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-16 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-16 01:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-16 01:18:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:24] [INFO ] Added : 33 causal constraints over 7 iterations in 62 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 01:18:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 01:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-16 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-16 01:18:24] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 7 ms to minimize.
[2023-03-16 01:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 01:18:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:24] [INFO ] Added : 20 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 17 ms.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:18:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:24] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-16 01:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-16 01:18:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:18:25] [INFO ] Added : 36 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 01:18:25] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-16 01:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-16 01:18:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 01:18:25] [INFO ] Added : 21 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 12 ms.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
[2023-03-16 01:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-16 01:18:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:25] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-16 01:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 01:18:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:18:25] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-16 01:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-16 01:18:25] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 20 ms.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 01:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-16 01:18:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:26] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-16 01:18:26] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2023-03-16 01:18:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-16 01:18:26] [INFO ] Added : 36 causal constraints over 8 iterations in 184 ms. Result :sat
Minimization took 14 ms.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:26] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-16 01:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-16 01:18:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:26] [INFO ] Added : 20 causal constraints over 4 iterations in 213 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:18:26] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 01:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 01:18:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 01:18:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-16 01:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-16 01:18:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:18:26] [INFO ] Added : 21 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 172 ms.
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:18:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 01:18:27] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-16 01:18:27] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-16 01:18:27] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2023-03-16 01:18:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 86 ms
[2023-03-16 01:18:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:18:27] [INFO ] Added : 36 causal constraints over 8 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 01:18:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:18:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 01:18:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-16 01:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-16 01:18:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:18:27] [INFO ] Added : 22 causal constraints over 5 iterations in 157 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [5, -1, 2, -1, -1, 3, 1, -1, -1, 4, -1, 10, -1, 4]
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 01:18:27] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 54 ms.
[2023-03-16 01:18:27] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 684 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :26
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :18
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :12
[2023-03-16 01:18:28] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-16 01:18:28] [INFO ] Computed 142 place invariants in 95 ms
[2023-03-16 01:18:28] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-16 01:18:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:28] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-16 01:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:28] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 01:18:28] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 01:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:33] [INFO ] [Nat]Absence check using state equation in 4863 ms returned unknown
[2023-03-16 01:18:33] [INFO ] [Real]Absence check using 135 positive place invariants in 50 ms returned sat
[2023-03-16 01:18:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-16 01:18:33] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:35] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-16 01:18:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:35] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-16 01:18:35] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-16 01:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:35] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2023-03-16 01:18:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:18:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 282 ms returned sat
[2023-03-16 01:18:36] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 106 ms.
[2023-03-16 01:18:37] [INFO ] Added : 16 causal constraints over 4 iterations in 1018 ms. Result :sat
Minimization took 409 ms.
[2023-03-16 01:18:37] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 01:18:37] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 11 ms returned unsat
[2023-03-16 01:18:37] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-16 01:18:37] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:38] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-16 01:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:38] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-16 01:18:38] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:38] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-16 01:18:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 412 ms returned sat
[2023-03-16 01:18:39] [INFO ] Deduced a trap composed of 507 places in 327 ms of which 1 ms to minimize.
[2023-03-16 01:18:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-16 01:18:39] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 83 ms.
[2023-03-16 01:18:40] [INFO ] Added : 19 causal constraints over 4 iterations in 505 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 1, 1, 1, 1, 10, 1, 4] Max seen :[4, 1, 1, 1, 1, 1, 1, 3, 1, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 307 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
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 271 place count 771 transition count 1182
Applied a total of 271 rules in 187 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2023-03-16 01:18:40] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2023-03-16 01:18:40] [INFO ] Computed 137 place invariants in 33 ms
[2023-03-16 01:18:41] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 40 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:18:41] [INFO ] Computed 137 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47381 resets, run finished after 9120 ms. (steps per millisecond=109 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 3321 resets, run finished after 4927 ms. (steps per millisecond=202 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 3377 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000000 steps, including 3480 resets, run finished after 1642 ms. (steps per millisecond=609 ) properties (out of 3) seen :10
[2023-03-16 01:18:59] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:18:59] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-16 01:18:59] [INFO ] [Real]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-16 01:18:59] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 01:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:18:59] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-16 01:18:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:18:59] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-16 01:18:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 01:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:03] [INFO ] [Nat]Absence check using state equation in 3423 ms returned unsat
[2023-03-16 01:19:03] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-16 01:19:03] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:03] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-16 01:19:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:19:03] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-16 01:19:03] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:04] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-16 01:19:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:19:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 239 ms returned sat
[2023-03-16 01:19:04] [INFO ] Deduced a trap composed of 239 places in 249 ms of which 1 ms to minimize.
[2023-03-16 01:19:05] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 1 ms to minimize.
[2023-03-16 01:19:05] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 0 ms to minimize.
[2023-03-16 01:19:05] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 0 ms to minimize.
[2023-03-16 01:19:05] [INFO ] Deduced a trap composed of 233 places in 228 ms of which 0 ms to minimize.
[2023-03-16 01:19:06] [INFO ] Deduced a trap composed of 245 places in 221 ms of which 1 ms to minimize.
[2023-03-16 01:19:06] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 0 ms to minimize.
[2023-03-16 01:19:07] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 1 ms to minimize.
[2023-03-16 01:19:07] [INFO ] Deduced a trap composed of 227 places in 241 ms of which 1 ms to minimize.
[2023-03-16 01:19:07] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 0 ms to minimize.
[2023-03-16 01:19:08] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 1 ms to minimize.
[2023-03-16 01:19:09] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 0 ms to minimize.
[2023-03-16 01:19:10] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-16 01:19:13] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8696 ms
[2023-03-16 01:19:13] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:19:13] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:13] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-16 01:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:19:13] [INFO ] [Nat]Absence check using 130 positive place invariants in 30 ms returned sat
[2023-03-16 01:19:13] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 01:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:14] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-16 01:19:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 268 ms returned sat
[2023-03-16 01:19:14] [INFO ] Deduced a trap composed of 251 places in 239 ms of which 1 ms to minimize.
[2023-03-16 01:19:15] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2023-03-16 01:19:15] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 1 ms to minimize.
[2023-03-16 01:19:15] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 1 ms to minimize.
[2023-03-16 01:19:16] [INFO ] Deduced a trap composed of 245 places in 243 ms of which 1 ms to minimize.
[2023-03-16 01:19:16] [INFO ] Deduced a trap composed of 245 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:19:16] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 3 ms to minimize.
[2023-03-16 01:19:17] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 0 ms to minimize.
[2023-03-16 01:19:17] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 1 ms to minimize.
[2023-03-16 01:19:17] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 1 ms to minimize.
[2023-03-16 01:19:18] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 1 ms to minimize.
[2023-03-16 01:19:18] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 1 ms to minimize.
[2023-03-16 01:19:18] [INFO ] Deduced a trap composed of 255 places in 226 ms of which 1 ms to minimize.
[2023-03-16 01:19:19] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 0 ms to minimize.
[2023-03-16 01:19:19] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2023-03-16 01:19:19] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2023-03-16 01:19:20] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 0 ms to minimize.
[2023-03-16 01:19:21] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:19:21] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 0 ms to minimize.
[2023-03-16 01:19:21] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 1 ms to minimize.
[2023-03-16 01:19:22] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:19:22] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:19:22] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:19:23] [INFO ] Deduced a trap composed of 248 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:19:23] [INFO ] Deduced a trap composed of 236 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:19:24] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 1 ms to minimize.
[2023-03-16 01:19:25] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 1 ms to minimize.
[2023-03-16 01:19:26] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 0 ms to minimize.
[2023-03-16 01:19:29] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 14794 ms
Current structural bounds on expressions (after SMT) : [4, 10, 4] Max seen :[4, 3, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 34 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:19:29] [INFO ] Computed 137 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 47509 resets, run finished after 4434 ms. (steps per millisecond=225 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3381 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3443 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 2) seen :6
[2023-03-16 01:19:36] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:19:36] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-16 01:19:36] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:19:36] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:37] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-16 01:19:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:19:37] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-16 01:19:37] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:37] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-16 01:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:19:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 241 ms returned sat
[2023-03-16 01:19:38] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 1 ms to minimize.
[2023-03-16 01:19:38] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 1 ms to minimize.
[2023-03-16 01:19:38] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 1 ms to minimize.
[2023-03-16 01:19:38] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2023-03-16 01:19:39] [INFO ] Deduced a trap composed of 233 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:19:39] [INFO ] Deduced a trap composed of 245 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:19:39] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 1 ms to minimize.
[2023-03-16 01:19:40] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 1 ms to minimize.
[2023-03-16 01:19:40] [INFO ] Deduced a trap composed of 227 places in 229 ms of which 1 ms to minimize.
[2023-03-16 01:19:41] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 1 ms to minimize.
[2023-03-16 01:19:41] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 1 ms to minimize.
[2023-03-16 01:19:42] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:19:43] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2023-03-16 01:19:46] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8716 ms
[2023-03-16 01:19:46] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-16 01:19:46] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:46] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-16 01:19:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:19:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:19:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 01:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:19:47] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-16 01:19:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 268 ms returned sat
[2023-03-16 01:19:47] [INFO ] Deduced a trap composed of 251 places in 219 ms of which 1 ms to minimize.
[2023-03-16 01:19:48] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 0 ms to minimize.
[2023-03-16 01:19:48] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:19:48] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 1 ms to minimize.
[2023-03-16 01:19:49] [INFO ] Deduced a trap composed of 245 places in 238 ms of which 1 ms to minimize.
[2023-03-16 01:19:49] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:19:49] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-16 01:19:50] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:19:50] [INFO ] Deduced a trap composed of 224 places in 211 ms of which 0 ms to minimize.
[2023-03-16 01:19:50] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:19:51] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 0 ms to minimize.
[2023-03-16 01:19:51] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 4 ms to minimize.
[2023-03-16 01:19:52] [INFO ] Deduced a trap composed of 255 places in 243 ms of which 0 ms to minimize.
[2023-03-16 01:19:52] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 1 ms to minimize.
[2023-03-16 01:19:52] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 0 ms to minimize.
[2023-03-16 01:19:52] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 1 ms to minimize.
[2023-03-16 01:19:54] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 0 ms to minimize.
[2023-03-16 01:19:54] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 1 ms to minimize.
[2023-03-16 01:19:54] [INFO ] Deduced a trap composed of 231 places in 239 ms of which 0 ms to minimize.
[2023-03-16 01:19:54] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 1 ms to minimize.
[2023-03-16 01:19:55] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:19:55] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 0 ms to minimize.
[2023-03-16 01:19:56] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 0 ms to minimize.
[2023-03-16 01:19:56] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:19:57] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 0 ms to minimize.
[2023-03-16 01:19:57] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:19:58] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 0 ms to minimize.
[2023-03-16 01:19:59] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 1 ms to minimize.
[2023-03-16 01:20:02] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 14944 ms
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 30 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-16 01:20:02] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:02] [INFO ] Invariant cache hit.
[2023-03-16 01:20:03] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-16 01:20:03] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:03] [INFO ] Invariant cache hit.
[2023-03-16 01:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:07] [INFO ] Implicit Places using invariants and state equation in 3784 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
[2023-03-16 01:20:07] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-16 01:20:07] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:07] [INFO ] Invariant cache hit.
[2023-03-16 01:20:08] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5355 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:08] [INFO ] Computed 137 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2023-03-16 01:20:08] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:08] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-16 01:20:08] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-16 01:20:08] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:08] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-16 01:20:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:20:08] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:20:08] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:09] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-16 01:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 243 ms returned sat
[2023-03-16 01:20:09] [INFO ] Deduced a trap composed of 239 places in 239 ms of which 1 ms to minimize.
[2023-03-16 01:20:10] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 1 ms to minimize.
[2023-03-16 01:20:10] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 0 ms to minimize.
[2023-03-16 01:20:10] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 1 ms to minimize.
[2023-03-16 01:20:10] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 1 ms to minimize.
[2023-03-16 01:20:11] [INFO ] Deduced a trap composed of 245 places in 225 ms of which 1 ms to minimize.
[2023-03-16 01:20:11] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 0 ms to minimize.
[2023-03-16 01:20:11] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 0 ms to minimize.
[2023-03-16 01:20:12] [INFO ] Deduced a trap composed of 227 places in 232 ms of which 1 ms to minimize.
[2023-03-16 01:20:12] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 1 ms to minimize.
[2023-03-16 01:20:13] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 1 ms to minimize.
[2023-03-16 01:20:13] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 4294 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-16 01:20:13] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:13] [INFO ] Invariant cache hit.
[2023-03-16 01:20:14] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:14] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 47459 resets, run finished after 4369 ms. (steps per millisecond=228 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3285 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties (out of 1) seen :3
[2023-03-16 01:20:20] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:20] [INFO ] Computed 137 place invariants in 21 ms
[2023-03-16 01:20:20] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-16 01:20:20] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 01:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:20] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-16 01:20:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:20:20] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:20:20] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 01:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:21] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-16 01:20:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 234 ms returned sat
[2023-03-16 01:20:21] [INFO ] Deduced a trap composed of 239 places in 222 ms of which 1 ms to minimize.
[2023-03-16 01:20:22] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 1 ms to minimize.
[2023-03-16 01:20:22] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:20:22] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 1 ms to minimize.
[2023-03-16 01:20:22] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 2 ms to minimize.
[2023-03-16 01:20:23] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:20:23] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:20:23] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2023-03-16 01:20:24] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 0 ms to minimize.
[2023-03-16 01:20:24] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-16 01:20:24] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-16 01:20:26] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 1 ms to minimize.
[2023-03-16 01:20:27] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 1 ms to minimize.
[2023-03-16 01:20:30] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 8577 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 24 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-16 01:20:30] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:30] [INFO ] Invariant cache hit.
[2023-03-16 01:20:30] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-16 01:20:30] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:30] [INFO ] Invariant cache hit.
[2023-03-16 01:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:35] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 5073 ms to find 0 implicit places.
[2023-03-16 01:20:35] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 01:20:35] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 01:20:35] [INFO ] Invariant cache hit.
[2023-03-16 01:20:35] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5831 ms. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12 in 27941 ms.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:35] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 10002 steps, including 478 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-16 01:20:36] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 01:20:36] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-16 01:20:36] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-16 01:20:36] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 01:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:36] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-16 01:20:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:20:36] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:20:36] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 01:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:37] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-16 01:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2023-03-16 01:20:37] [INFO ] Deduced a trap composed of 251 places in 219 ms of which 0 ms to minimize.
[2023-03-16 01:20:37] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:20:38] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:20:38] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 1 ms to minimize.
[2023-03-16 01:20:38] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:39] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 1 ms to minimize.
[2023-03-16 01:20:39] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-16 01:20:39] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:40] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:40] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:40] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:41] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 0 ms to minimize.
[2023-03-16 01:20:41] [INFO ] Deduced a trap composed of 255 places in 225 ms of which 0 ms to minimize.
[2023-03-16 01:20:41] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 1 ms to minimize.
[2023-03-16 01:20:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 30 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2023-03-16 01:20:41] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-16 01:20:41] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-16 01:20:42] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2023-03-16 01:20:42] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 52111 resets, run finished after 4626 ms. (steps per millisecond=216 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3371 resets, run finished after 1303 ms. (steps per millisecond=767 ) properties (out of 1) seen :3
[2023-03-16 01:20:48] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-16 01:20:48] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-16 01:20:48] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-16 01:20:48] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-16 01:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:48] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-16 01:20:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:20:49] [INFO ] [Nat]Absence check using 130 positive place invariants in 30 ms returned sat
[2023-03-16 01:20:49] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 01:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:20:49] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-16 01:20:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:20:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 277 ms returned sat
[2023-03-16 01:20:49] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 0 ms to minimize.
[2023-03-16 01:20:50] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 1 ms to minimize.
[2023-03-16 01:20:50] [INFO ] Deduced a trap composed of 239 places in 225 ms of which 0 ms to minimize.
[2023-03-16 01:20:50] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:51] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2023-03-16 01:20:51] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:51] [INFO ] Deduced a trap composed of 251 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:52] [INFO ] Deduced a trap composed of 251 places in 210 ms of which 1 ms to minimize.
[2023-03-16 01:20:52] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 1 ms to minimize.
[2023-03-16 01:20:52] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:20:53] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 1 ms to minimize.
[2023-03-16 01:20:53] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 0 ms to minimize.
[2023-03-16 01:20:54] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 1 ms to minimize.
[2023-03-16 01:20:54] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:55] [INFO ] Deduced a trap composed of 248 places in 207 ms of which 0 ms to minimize.
[2023-03-16 01:20:55] [INFO ] Deduced a trap composed of 248 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:20:56] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 1 ms to minimize.
[2023-03-16 01:20:56] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:57] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 0 ms to minimize.
[2023-03-16 01:20:57] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 1 ms to minimize.
[2023-03-16 01:20:57] [INFO ] Deduced a trap composed of 227 places in 214 ms of which 0 ms to minimize.
[2023-03-16 01:20:57] [INFO ] Deduced a trap composed of 224 places in 209 ms of which 1 ms to minimize.
[2023-03-16 01:20:58] [INFO ] Deduced a trap composed of 233 places in 213 ms of which 1 ms to minimize.
[2023-03-16 01:20:58] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 0 ms to minimize.
[2023-03-16 01:20:59] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2023-03-16 01:20:59] [INFO ] Deduced a trap composed of 233 places in 214 ms of which 1 ms to minimize.
[2023-03-16 01:20:59] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 1 ms to minimize.
[2023-03-16 01:21:00] [INFO ] Deduced a trap composed of 233 places in 209 ms of which 0 ms to minimize.
[2023-03-16 01:21:02] [INFO ] Deduced a trap composed of 239 places in 215 ms of which 1 ms to minimize.
[2023-03-16 01:21:03] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 1 ms to minimize.
[2023-03-16 01:21:04] [INFO ] Deduced a trap composed of 254 places in 219 ms of which 1 ms to minimize.
[2023-03-16 01:21:07] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 17789 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 22 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 21 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-16 01:21:07] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-16 01:21:07] [INFO ] Invariant cache hit.
[2023-03-16 01:21:08] [INFO ] Implicit Places using invariants in 745 ms returned []
[2023-03-16 01:21:08] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-16 01:21:08] [INFO ] Invariant cache hit.
[2023-03-16 01:21:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 01:21:11] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 4209 ms to find 0 implicit places.
[2023-03-16 01:21:11] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 01:21:11] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-16 01:21:11] [INFO ] Invariant cache hit.
[2023-03-16 01:21:12] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4914 ms. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14 in 36432 ms.
[2023-03-16 01:21:12] [INFO ] Flatten gal took : 123 ms
[2023-03-16 01:21:12] [INFO ] Applying decomposition
[2023-03-16 01:21:12] [INFO ] Flatten gal took : 91 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/graph1329828752369208078.txt' '-o' '/tmp/graph1329828752369208078.bin' '-w' '/tmp/graph1329828752369208078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1329828752369208078.bin' '-l' '-1' '-v' '-w' '/tmp/graph1329828752369208078.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:21:13] [INFO ] Decomposing Gal with order
[2023-03-16 01:21:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:21:13] [INFO ] Removed a total of 1081 redundant transitions.
[2023-03-16 01:21:13] [INFO ] Flatten gal took : 489 ms
[2023-03-16 01:21:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 493 labels/synchronizations in 55 ms.
[2023-03-16 01:21:13] [INFO ] Time to serialize gal into /tmp/UpperBounds7630339074561019746.gal : 21 ms
[2023-03-16 01:21:14] [INFO ] Time to serialize properties into /tmp/UpperBounds2501249101442856397.prop : 1 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/UpperBounds7630339074561019746.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2501249101442856397.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 ...283
Loading property file /tmp/UpperBounds2501249101442856397.prop.
Detected timeout of ITS tools.
[2023-03-16 01:42:12] [INFO ] Applying decomposition
[2023-03-16 01:42:12] [INFO ] Flatten gal took : 361 ms
[2023-03-16 01:42:13] [INFO ] Decomposing Gal with order
[2023-03-16 01:42:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:42:26] [INFO ] Removed a total of 3944 redundant transitions.
[2023-03-16 01:42:26] [INFO ] Flatten gal took : 652 ms
[2023-03-16 01:42:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2023-03-16 01:42:26] [INFO ] Time to serialize gal into /tmp/UpperBounds4441440701059337345.gal : 17 ms
[2023-03-16 01:42:26] [INFO ] Time to serialize properties into /tmp/UpperBounds13631963605223174194.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/UpperBounds4441440701059337345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13631963605223174194.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/UpperBounds13631963605223174194.prop.
Detected timeout of ITS tools.
[2023-03-16 02:03:56] [INFO ] Flatten gal took : 288 ms
[2023-03-16 02:03:57] [INFO ] Input system was already deterministic with 1087 transitions.
[2023-03-16 02:03:57] [INFO ] Transformed 771 places.
[2023-03-16 02:03:57] [INFO ] Transformed 1087 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 02:04:27] [INFO ] Time to serialize gal into /tmp/UpperBounds15558825382166735367.gal : 13 ms
[2023-03-16 02:04:27] [INFO ] Time to serialize properties into /tmp/UpperBounds424529644705092877.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/UpperBounds15558825382166735367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds424529644705092877.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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds424529644705092877.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 137768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14388812 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-S05J60"
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-S05J60, 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-167873945700661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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 ;