Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800256.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 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-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717128548751

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 04:09:10] [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]
[2024-05-31 04:09:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:09:10] [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.
[2024-05-31 04:09:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:09:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 563 ms
[2024-05-31 04:09:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-31 04:09:11] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-31 04:09:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:09:11] [INFO ] Computed 13 invariants in 5 ms
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 04:09:11] [INFO ] Invariant cache hit.
[2024-05-31 04:09:11] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-31 04:09:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:11] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 04:09:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:09:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:11] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 04:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2024-05-31 04:09:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 04:09:12] [INFO ] Added : 36 causal constraints over 8 iterations in 68 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 04:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 40 ms returned sat
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 04:09:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:12] [INFO ] Added : 20 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 04:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:12] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 04:09:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:12] [INFO ] Added : 22 causal constraints over 5 iterations in 158 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 04:09:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-31 04:09:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 04:09:13] [INFO ] Added : 36 causal constraints over 8 iterations in 158 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 04:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 04:09:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-31 04:09:13] [INFO ] Added : 36 causal constraints over 8 iterations in 135 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 04:09:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:09:13] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 04:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:13] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 04:09:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-31 04:09:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-05-31 04:09:14] [INFO ] Added : 36 causal constraints over 8 iterations in 247 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:09:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 04:09:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:14] [INFO ] Added : 15 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:09:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:09:14] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 04:09:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 04:09:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 04:09:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-31 04:09:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 04:09:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:14] [INFO ] Added : 19 causal constraints over 4 iterations in 237 ms. Result :sat
Minimization took 143 ms.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 04:09:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 04:09:15] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 04:09:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:09:15] [INFO ] Added : 21 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 55 ms.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 04:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-31 04:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 04:09:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 04:09:15] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 04:09:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:09:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:09:15] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, 2, 4, 1, 1, -1, 10, -1, 1, -1, 10, 1, 3, -1, -1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:09:16] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 229 ms.
[2024-05-31 04:09:16] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 36 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 14) seen :15
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
[2024-05-31 04:09:16] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-31 04:09:17] [INFO ] Computed 92 invariants in 164 ms
[2024-05-31 04:09:17] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-05-31 04:09:17] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned unsat
[2024-05-31 04:09:17] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2024-05-31 04:09:17] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 04:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:18] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2024-05-31 04:09:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:18] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-05-31 04:09:18] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:20] [INFO ] [Nat]Absence check using state equation in 1871 ms returned sat
[2024-05-31 04:09:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2024-05-31 04:09:20] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 294 ms.
[2024-05-31 04:09:21] [INFO ] Deduced a trap composed of 324 places in 596 ms of which 1 ms to minimize.
[2024-05-31 04:09:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 799 ms
[2024-05-31 04:09:22] [INFO ] Added : 11 causal constraints over 3 iterations in 1736 ms. Result :sat
Minimization took 986 ms.
[2024-05-31 04:09:23] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-31 04:09:23] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 04:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:23] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2024-05-31 04:09:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:24] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-31 04:09:24] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:09:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:24] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-31 04:09:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 408 ms returned sat
[2024-05-31 04:09:25] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 544 ms.
[2024-05-31 04:09:26] [INFO ] Added : 12 causal constraints over 3 iterations in 1119 ms. Result :sat
Minimization took 926 ms.
[2024-05-31 04:09:27] [INFO ] [Real]Absence check using 85 positive place invariants in 50 ms returned sat
[2024-05-31 04:09:27] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 04:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:27] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2024-05-31 04:09:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:28] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-31 04:09:28] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 04:09:28] [INFO ] [Real]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-05-31 04:09:28] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:28] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2024-05-31 04:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:29] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-31 04:09:29] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:30] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2024-05-31 04:09:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2024-05-31 04:09:30] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 179 ms.
[2024-05-31 04:09:31] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 1 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 0 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1401 ms
[2024-05-31 04:09:33] [INFO ] Added : 32 causal constraints over 7 iterations in 2646 ms. Result :sat
Minimization took 813 ms.
[2024-05-31 04:09:34] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-31 04:09:34] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned unsat
[2024-05-31 04:09:34] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-05-31 04:09:34] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:34] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2024-05-31 04:09:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:35] [INFO ] [Nat]Absence check using 85 positive place invariants in 31 ms returned sat
[2024-05-31 04:09:35] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:36] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2024-05-31 04:09:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-05-31 04:09:36] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 163 ms.
[2024-05-31 04:09:36] [INFO ] Added : 6 causal constraints over 2 iterations in 563 ms. Result :sat
Minimization took 537 ms.
[2024-05-31 04:09:37] [INFO ] [Real]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-05-31 04:09:37] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:38] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-31 04:09:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:38] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-05-31 04:09:38] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 04:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:39] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2024-05-31 04:09:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 282 ms returned sat
[2024-05-31 04:09:39] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 181 ms.
[2024-05-31 04:09:40] [INFO ] Deduced a trap composed of 292 places in 588 ms of which 1 ms to minimize.
[2024-05-31 04:09:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 835 ms
[2024-05-31 04:09:41] [INFO ] Added : 11 causal constraints over 3 iterations in 1701 ms. Result :sat
Minimization took 1010 ms.
[2024-05-31 04:09:42] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-05-31 04:09:42] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 04:09:42] [INFO ] [Real]Absence check using 85 positive place invariants in 20 ms returned sat
[2024-05-31 04:09:42] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2, 4, 1, 2147483647, 1, 10, 3, 1, 1] Max seen :[1, 0, 3, 1, 0, 1, 3, 0, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 35 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1866
Applied a total of 158 rules in 371 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
[2024-05-31 04:09:43] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-31 04:09:43] [INFO ] Computed 82 invariants in 43 ms
[2024-05-31 04:09:44] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/664 places, 1251/1940 transitions.
Applied a total of 0 rules in 71 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1401 ms. Remains : 580/664 places, 1251/1940 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:09:44] [INFO ] Computed 82 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 72639 resets, run finished after 9109 ms. (steps per millisecond=109 ) properties (out of 5) seen :13
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9018 resets, run finished after 1623 ms. (steps per millisecond=616 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 8994 resets, run finished after 1610 ms. (steps per millisecond=621 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9073 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 3) seen :8
[2024-05-31 04:09:58] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:09:58] [INFO ] Computed 82 invariants in 23 ms
[2024-05-31 04:09:58] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2024-05-31 04:09:58] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:58] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-31 04:09:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:58] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-05-31 04:09:58] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:59] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2024-05-31 04:09:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 153 ms returned sat
[2024-05-31 04:09:59] [INFO ] Deduced a trap composed of 228 places in 303 ms of which 0 ms to minimize.
[2024-05-31 04:10:00] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:10:00] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:10:00] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2024-05-31 04:10:00] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 1 ms to minimize.
[2024-05-31 04:10:01] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:10:01] [INFO ] Deduced a trap composed of 238 places in 324 ms of which 1 ms to minimize.
[2024-05-31 04:10:02] [INFO ] Deduced a trap composed of 230 places in 382 ms of which 1 ms to minimize.
[2024-05-31 04:10:02] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:10:02] [INFO ] Deduced a trap composed of 236 places in 362 ms of which 0 ms to minimize.
[2024-05-31 04:10:03] [INFO ] Deduced a trap composed of 247 places in 362 ms of which 1 ms to minimize.
[2024-05-31 04:10:03] [INFO ] Deduced a trap composed of 236 places in 345 ms of which 2 ms to minimize.
[2024-05-31 04:10:04] [INFO ] Deduced a trap composed of 232 places in 333 ms of which 4 ms to minimize.
[2024-05-31 04:10:05] [INFO ] Deduced a trap composed of 230 places in 393 ms of which 1 ms to minimize.
[2024-05-31 04:10:05] [INFO ] Deduced a trap composed of 234 places in 396 ms of which 0 ms to minimize.
[2024-05-31 04:10:05] [INFO ] Deduced a trap composed of 237 places in 398 ms of which 1 ms to minimize.
[2024-05-31 04:10:06] [INFO ] Deduced a trap composed of 237 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:10:06] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 0 ms to minimize.
[2024-05-31 04:10:07] [INFO ] Deduced a trap composed of 230 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:10:07] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2024-05-31 04:10:07] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 0 ms to minimize.
[2024-05-31 04:10:08] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 0 ms to minimize.
[2024-05-31 04:10:08] [INFO ] Deduced a trap composed of 228 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:10:08] [INFO ] Deduced a trap composed of 224 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:10:09] [INFO ] Deduced a trap composed of 232 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:10:09] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 0 ms to minimize.
[2024-05-31 04:10:10] [INFO ] Deduced a trap composed of 232 places in 348 ms of which 0 ms to minimize.
[2024-05-31 04:10:10] [INFO ] Deduced a trap composed of 234 places in 362 ms of which 1 ms to minimize.
[2024-05-31 04:10:10] [INFO ] Deduced a trap composed of 226 places in 353 ms of which 2 ms to minimize.
[2024-05-31 04:10:11] [INFO ] Deduced a trap composed of 230 places in 362 ms of which 0 ms to minimize.
[2024-05-31 04:10:11] [INFO ] Deduced a trap composed of 232 places in 315 ms of which 0 ms to minimize.
[2024-05-31 04:10:12] [INFO ] Deduced a trap composed of 234 places in 365 ms of which 1 ms to minimize.
[2024-05-31 04:10:12] [INFO ] Deduced a trap composed of 236 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:10:12] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:10:13] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:10:13] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:10:13] [INFO ] Deduced a trap composed of 224 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:10:14] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:10:15] [INFO ] Deduced a trap composed of 236 places in 373 ms of which 1 ms to minimize.
[2024-05-31 04:10:15] [INFO ] Deduced a trap composed of 230 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:10:15] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:10:16] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:10:16] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:10:16] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 3 ms to minimize.
[2024-05-31 04:10:17] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2024-05-31 04:10:17] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2024-05-31 04:10:17] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 3 ms to minimize.
[2024-05-31 04:10:17] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:10:18] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:10:18] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:10:19] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 0 ms to minimize.
[2024-05-31 04:10:19] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 0 ms to minimize.
[2024-05-31 04:10:19] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:10:20] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:10:20] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:10:21] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:10:21] [INFO ] Deduced a trap composed of 224 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:10:22] [INFO ] Deduced a trap composed of 236 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:10:23] [INFO ] Deduced a trap composed of 226 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:10:25] [INFO ] Deduced a trap composed of 228 places in 373 ms of which 1 ms to minimize.
[2024-05-31 04:10:26] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:10:26] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:10:27] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2024-05-31 04:10:27] [INFO ] Deduced a trap composed of 234 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:10:28] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:10:28] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 1 ms to minimize.
[2024-05-31 04:10:29] [INFO ] Deduced a trap composed of 228 places in 367 ms of which 1 ms to minimize.
[2024-05-31 04:10:29] [INFO ] Deduced a trap composed of 238 places in 328 ms of which 1 ms to minimize.
[2024-05-31 04:10:30] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:10:30] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:10:30] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:10:31] [INFO ] Deduced a trap composed of 239 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:10:32] [INFO ] Deduced a trap composed of 235 places in 266 ms of which 0 ms to minimize.
[2024-05-31 04:10:32] [INFO ] Deduced a trap composed of 228 places in 331 ms of which 0 ms to minimize.
[2024-05-31 04:10:33] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:10:33] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:10:34] [INFO ] Deduced a trap composed of 222 places in 284 ms of which 1 ms to minimize.
[2024-05-31 04:10:35] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:10:35] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 0 ms to minimize.
[2024-05-31 04:10:36] [INFO ] Deduced a trap composed of 238 places in 365 ms of which 0 ms to minimize.
[2024-05-31 04:10:36] [INFO ] Deduced a trap composed of 230 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:10:37] [INFO ] Deduced a trap composed of 224 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:10:38] [INFO ] Deduced a trap composed of 236 places in 366 ms of which 0 ms to minimize.
[2024-05-31 04:10:39] [INFO ] Deduced a trap composed of 234 places in 362 ms of which 1 ms to minimize.
[2024-05-31 04:10:41] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 0 ms to minimize.
[2024-05-31 04:10:41] [INFO ] Deduced a trap composed of 242 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:10:42] [INFO ] Deduced a trap composed of 222 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:10:44] [INFO ] Deduced a trap composed of 232 places in 366 ms of which 1 ms to minimize.
[2024-05-31 04:10:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 04:10:44] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 04:10:44] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned unsat
[2024-05-31 04:10:44] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-05-31 04:10:44] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 4] Max seen :[3, 1, 4]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 54 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 580/580 places, 1251/1251 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:10:44] [INFO ] Computed 82 invariants in 37 ms
Incomplete random walk after 1000000 steps, including 72648 resets, run finished after 9681 ms. (steps per millisecond=103 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8893 resets, run finished after 2236 ms. (steps per millisecond=447 ) properties (out of 1) seen :3
[2024-05-31 04:10:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:10:56] [INFO ] Computed 82 invariants in 25 ms
[2024-05-31 04:10:56] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-05-31 04:10:56] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:10:56] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-31 04:10:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:10:56] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2024-05-31 04:10:56] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:10:57] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-31 04:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:10:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 126 ms returned sat
[2024-05-31 04:10:57] [INFO ] Deduced a trap composed of 228 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:10:57] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2024-05-31 04:10:58] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:10:58] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2024-05-31 04:10:58] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:10:59] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2024-05-31 04:10:59] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:10:59] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2024-05-31 04:11:00] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2024-05-31 04:11:00] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 0 ms to minimize.
[2024-05-31 04:11:00] [INFO ] Deduced a trap composed of 247 places in 267 ms of which 1 ms to minimize.
[2024-05-31 04:11:01] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:11:01] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 13 ms to minimize.
[2024-05-31 04:11:02] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:11:02] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:11:02] [INFO ] Deduced a trap composed of 237 places in 254 ms of which 0 ms to minimize.
[2024-05-31 04:11:03] [INFO ] Deduced a trap composed of 237 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:11:03] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2024-05-31 04:11:03] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2024-05-31 04:11:04] [INFO ] Deduced a trap composed of 238 places in 300 ms of which 0 ms to minimize.
[2024-05-31 04:11:04] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:11:04] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2024-05-31 04:11:04] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2024-05-31 04:11:05] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 0 ms to minimize.
[2024-05-31 04:11:05] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2024-05-31 04:11:05] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:11:06] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2024-05-31 04:11:06] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2024-05-31 04:11:07] [INFO ] Deduced a trap composed of 226 places in 312 ms of which 0 ms to minimize.
[2024-05-31 04:11:07] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2024-05-31 04:11:07] [INFO ] Deduced a trap composed of 232 places in 357 ms of which 0 ms to minimize.
[2024-05-31 04:11:08] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:11:08] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 2 ms to minimize.
[2024-05-31 04:11:08] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:11:08] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2024-05-31 04:11:09] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 0 ms to minimize.
[2024-05-31 04:11:09] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 1 ms to minimize.
[2024-05-31 04:11:09] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2024-05-31 04:11:10] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:11:10] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2024-05-31 04:11:11] [INFO ] Deduced a trap composed of 234 places in 292 ms of which 1 ms to minimize.
[2024-05-31 04:11:11] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:11:11] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 0 ms to minimize.
[2024-05-31 04:11:12] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2024-05-31 04:11:12] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2024-05-31 04:11:12] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2024-05-31 04:11:12] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 2 ms to minimize.
[2024-05-31 04:11:13] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2024-05-31 04:11:13] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:11:13] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2024-05-31 04:11:14] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2024-05-31 04:11:14] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:11:14] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 0 ms to minimize.
[2024-05-31 04:11:15] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:11:15] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2024-05-31 04:11:15] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:11:16] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 0 ms to minimize.
[2024-05-31 04:11:17] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 0 ms to minimize.
[2024-05-31 04:11:17] [INFO ] Deduced a trap composed of 226 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:11:19] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2024-05-31 04:11:20] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:11:20] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:11:21] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2024-05-31 04:11:21] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 0 ms to minimize.
[2024-05-31 04:11:22] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:11:22] [INFO ] Deduced a trap composed of 228 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:11:23] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:11:23] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 1 ms to minimize.
[2024-05-31 04:11:23] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2024-05-31 04:11:24] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2024-05-31 04:11:24] [INFO ] Deduced a trap composed of 238 places in 234 ms of which 0 ms to minimize.
[2024-05-31 04:11:25] [INFO ] Deduced a trap composed of 239 places in 320 ms of which 1 ms to minimize.
[2024-05-31 04:11:25] [INFO ] Deduced a trap composed of 235 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:11:26] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 0 ms to minimize.
[2024-05-31 04:11:26] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 0 ms to minimize.
[2024-05-31 04:11:27] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 1 ms to minimize.
[2024-05-31 04:11:27] [INFO ] Deduced a trap composed of 222 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:11:28] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2024-05-31 04:11:28] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 0 ms to minimize.
[2024-05-31 04:11:29] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 0 ms to minimize.
[2024-05-31 04:11:29] [INFO ] Deduced a trap composed of 230 places in 352 ms of which 1 ms to minimize.
[2024-05-31 04:11:30] [INFO ] Deduced a trap composed of 224 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:11:31] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 0 ms to minimize.
[2024-05-31 04:11:31] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:11:33] [INFO ] Deduced a trap composed of 228 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:11:33] [INFO ] Deduced a trap composed of 242 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:11:34] [INFO ] Deduced a trap composed of 222 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:11:36] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:11:36] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:11:37] [INFO ] Deduced a trap composed of 228 places in 313 ms of which 0 ms to minimize.
[2024-05-31 04:11:39] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 1 ms to minimize.
[2024-05-31 04:11:39] [INFO ] Deduced a trap composed of 226 places in 354 ms of which 1 ms to minimize.
[2024-05-31 04:11:42] [INFO ] Deduced a trap composed of 228 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:11:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 56 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 04:11:42] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:11:42] [INFO ] Invariant cache hit.
[2024-05-31 04:11:42] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-31 04:11:42] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:11:42] [INFO ] Invariant cache hit.
[2024-05-31 04:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:45] [INFO ] Implicit Places using invariants and state equation in 2270 ms returned []
Implicit Place search using SMT with State Equation took 3075 ms to find 0 implicit places.
[2024-05-31 04:11:45] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-31 04:11:45] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:11:45] [INFO ] Invariant cache hit.
[2024-05-31 04:11:45] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3766 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:11:45] [INFO ] Computed 82 invariants in 12 ms
Incomplete random walk after 10000 steps, including 730 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2024-05-31 04:11:46] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:11:46] [INFO ] Computed 82 invariants in 13 ms
[2024-05-31 04:11:46] [INFO ] [Real]Absence check using 75 positive place invariants in 12 ms returned sat
[2024-05-31 04:11:46] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:11:46] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-31 04:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:11:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 13 ms returned sat
[2024-05-31 04:11:46] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:11:46] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-31 04:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 118 ms returned sat
[2024-05-31 04:11:47] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 0 ms to minimize.
[2024-05-31 04:11:47] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:11:47] [INFO ] Deduced a trap composed of 224 places in 310 ms of which 0 ms to minimize.
[2024-05-31 04:11:48] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:11:48] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 0 ms to minimize.
[2024-05-31 04:11:48] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 0 ms to minimize.
[2024-05-31 04:11:48] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 1 ms to minimize.
[2024-05-31 04:11:49] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2024-05-31 04:11:49] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2024-05-31 04:11:49] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:11:49] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 0 ms to minimize.
[2024-05-31 04:11:50] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2024-05-31 04:11:50] [INFO ] Deduced a trap composed of 232 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:11:51] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 0 ms to minimize.
[2024-05-31 04:11:51] [INFO ] Deduced a trap composed of 234 places in 310 ms of which 0 ms to minimize.
[2024-05-31 04:11:51] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 04:11:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:11:51] [INFO ] Invariant cache hit.
[2024-05-31 04:11:52] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 580/580 places, 1251/1251 transitions.
Normalized transition count is 1242 out of 1251 initially.
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:11:52] [INFO ] Computed 82 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 72706 resets, run finished after 9758 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 9041 resets, run finished after 2004 ms. (steps per millisecond=499 ) properties (out of 1) seen :3
[2024-05-31 04:12:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:12:04] [INFO ] Computed 82 invariants in 32 ms
[2024-05-31 04:12:04] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-31 04:12:04] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:12:04] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-31 04:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:12:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 12 ms returned sat
[2024-05-31 04:12:04] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:12:04] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-31 04:12:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:12:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 1 ms to minimize.
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:12:06] [INFO ] Deduced a trap composed of 234 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:12:06] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2024-05-31 04:12:06] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 1 ms to minimize.
[2024-05-31 04:12:07] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 0 ms to minimize.
[2024-05-31 04:12:07] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:12:07] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 0 ms to minimize.
[2024-05-31 04:12:07] [INFO ] Deduced a trap composed of 247 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:12:08] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 0 ms to minimize.
[2024-05-31 04:12:08] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 0 ms to minimize.
[2024-05-31 04:12:09] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 2 ms to minimize.
[2024-05-31 04:12:09] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:12:09] [INFO ] Deduced a trap composed of 237 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:12:10] [INFO ] Deduced a trap composed of 237 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:12:10] [INFO ] Deduced a trap composed of 224 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:12:11] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:12:11] [INFO ] Deduced a trap composed of 238 places in 363 ms of which 0 ms to minimize.
[2024-05-31 04:12:12] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:12:12] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:12:12] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2024-05-31 04:12:13] [INFO ] Deduced a trap composed of 224 places in 291 ms of which 0 ms to minimize.
[2024-05-31 04:12:13] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:12:13] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:12:14] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:12:14] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 0 ms to minimize.
[2024-05-31 04:12:15] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 1 ms to minimize.
[2024-05-31 04:12:15] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:12:15] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 2 ms to minimize.
[2024-05-31 04:12:16] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:12:16] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:12:16] [INFO ] Deduced a trap composed of 232 places in 317 ms of which 0 ms to minimize.
[2024-05-31 04:12:17] [INFO ] Deduced a trap composed of 236 places in 303 ms of which 2 ms to minimize.
[2024-05-31 04:12:17] [INFO ] Deduced a trap composed of 228 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:12:17] [INFO ] Deduced a trap composed of 224 places in 320 ms of which 1 ms to minimize.
[2024-05-31 04:12:18] [INFO ] Deduced a trap composed of 234 places in 307 ms of which 2 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 0 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 230 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 234 places in 354 ms of which 0 ms to minimize.
[2024-05-31 04:12:20] [INFO ] Deduced a trap composed of 224 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:12:20] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2024-05-31 04:12:20] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 0 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 0 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 0 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 0 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 1 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:12:23] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2024-05-31 04:12:23] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:12:23] [INFO ] Deduced a trap composed of 226 places in 225 ms of which 1 ms to minimize.
[2024-05-31 04:12:24] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2024-05-31 04:12:24] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:12:25] [INFO ] Deduced a trap composed of 236 places in 345 ms of which 0 ms to minimize.
[2024-05-31 04:12:26] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 1 ms to minimize.
[2024-05-31 04:12:28] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:12:28] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2024-05-31 04:12:29] [INFO ] Deduced a trap composed of 228 places in 338 ms of which 0 ms to minimize.
[2024-05-31 04:12:29] [INFO ] Deduced a trap composed of 234 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:12:30] [INFO ] Deduced a trap composed of 234 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:12:30] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:12:31] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 1 ms to minimize.
[2024-05-31 04:12:31] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:12:32] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 1 ms to minimize.
[2024-05-31 04:12:32] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:12:32] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 0 ms to minimize.
[2024-05-31 04:12:33] [INFO ] Deduced a trap composed of 238 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:12:33] [INFO ] Deduced a trap composed of 239 places in 223 ms of which 1 ms to minimize.
[2024-05-31 04:12:34] [INFO ] Deduced a trap composed of 235 places in 286 ms of which 1 ms to minimize.
[2024-05-31 04:12:34] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2024-05-31 04:12:35] [INFO ] Deduced a trap composed of 230 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:12:35] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:12:35] [INFO ] Deduced a trap composed of 222 places in 208 ms of which 0 ms to minimize.
[2024-05-31 04:12:36] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 0 ms to minimize.
[2024-05-31 04:12:37] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 0 ms to minimize.
[2024-05-31 04:12:37] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 1 ms to minimize.
[2024-05-31 04:12:37] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:12:38] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 0 ms to minimize.
[2024-05-31 04:12:38] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 1 ms to minimize.
[2024-05-31 04:12:39] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 1 ms to minimize.
[2024-05-31 04:12:40] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:12:41] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:12:41] [INFO ] Deduced a trap composed of 222 places in 276 ms of which 0 ms to minimize.
[2024-05-31 04:12:42] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2024-05-31 04:12:43] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 0 ms to minimize.
[2024-05-31 04:12:44] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2024-05-31 04:12:46] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 0 ms to minimize.
[2024-05-31 04:12:46] [INFO ] Deduced a trap composed of 226 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:12:48] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 1 ms to minimize.
[2024-05-31 04:12:49] [INFO ] Trap strengthening (SAT) tested/added 93/93 trap constraints in 44591 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 52 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 69 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 04:12:49] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:12:49] [INFO ] Invariant cache hit.
[2024-05-31 04:12:50] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-31 04:12:50] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:12:50] [INFO ] Invariant cache hit.
[2024-05-31 04:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:12:52] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2024-05-31 04:12:52] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-31 04:12:52] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:12:52] [INFO ] Invariant cache hit.
[2024-05-31 04:12:53] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3509 ms. Remains : 580/580 places, 1251/1251 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02 in 67161 ms.
[2024-05-31 04:12:53] [INFO ] Flatten gal took : 376 ms
[2024-05-31 04:12:53] [INFO ] Applying decomposition
[2024-05-31 04:12:53] [INFO ] Flatten gal took : 170 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15223170168006321373.txt' '-o' '/tmp/graph15223170168006321373.bin' '-w' '/tmp/graph15223170168006321373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15223170168006321373.bin' '-l' '-1' '-v' '-w' '/tmp/graph15223170168006321373.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:12:54] [INFO ] Decomposing Gal with order
[2024-05-31 04:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:12:54] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-31 04:12:54] [INFO ] Flatten gal took : 373 ms
[2024-05-31 04:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 329 labels/synchronizations in 122 ms.
[2024-05-31 04:12:55] [INFO ] Time to serialize gal into /tmp/UpperBounds2141267395499330488.gal : 29 ms
[2024-05-31 04:12:55] [INFO ] Time to serialize properties into /tmp/UpperBounds6604868947411419890.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2141267395499330488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6604868947411419890.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6604868947411419890.prop.
Detected timeout of ITS tools.
[2024-05-31 04:34:15] [INFO ] Applying decomposition
[2024-05-31 04:34:16] [INFO ] Flatten gal took : 836 ms
[2024-05-31 04:34:17] [INFO ] Decomposing Gal with order
[2024-05-31 04:34:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:34:18] [INFO ] Removed a total of 6719 redundant transitions.
[2024-05-31 04:34:18] [INFO ] Flatten gal took : 1107 ms
[2024-05-31 04:34:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 449 ms.
[2024-05-31 04:34:19] [INFO ] Time to serialize gal into /tmp/UpperBounds8806046327816339176.gal : 80 ms
[2024-05-31 04:34:19] [INFO ] Time to serialize properties into /tmp/UpperBounds2571027928655740241.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8806046327816339176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2571027928655740241.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds2571027928655740241.prop.
Detected timeout of ITS tools.
[2024-05-31 04:55:36] [INFO ] Flatten gal took : 864 ms
[2024-05-31 04:55:37] [INFO ] Input system was already deterministic with 1251 transitions.
[2024-05-31 04:55:38] [INFO ] Transformed 580 places.
[2024-05-31 04:55:38] [INFO ] Transformed 1251 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
[2024-05-31 04:56:08] [INFO ] Time to serialize gal into /tmp/UpperBounds13491417855751329475.gal : 22 ms
[2024-05-31 04:56:08] [INFO ] Time to serialize properties into /tmp/UpperBounds11617214809354956150.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13491417855751329475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11617214809354956150.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11617214809354956150.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 225284 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16160864 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S10J30, 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 r307-tajo-171654460800256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;