About the Execution of 2023-gold for PolyORBNT-COL-S10J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.264 | 3600000.00 | 3514717.00 | 204898.60 | 1 1 10 1 1 1 10 4 1 1 3 4 ? 1 2 41 | normal |
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-171654460800261.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-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 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-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717129097075
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-S10J40
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 04:18:18] [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:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:18:18] [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:18:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:18:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2024-05-31 04:18:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-31 04:18:19] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-31 04:18:19] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:18:19] [INFO ] Computed 13 invariants in 6 ms
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 04:18:19] [INFO ] Invariant cache hit.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 04:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:18:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
[2024-05-31 04:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 04:18:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:18:19] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 04:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 04:18:19] [INFO ] Added : 36 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 04:18:19] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:19] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 04:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 31 ms returned sat
[2024-05-31 04:18:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 04:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 04:18:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:18:20] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2024-05-31 04:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-31 04:18:20] [INFO ] Added : 36 causal constraints over 8 iterations in 317 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:18:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:18:20] [INFO ] Added : 33 causal constraints over 7 iterations in 121 ms. Result :sat
Minimization took 64 ms.
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 04:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:20] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 04:18:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-31 04:18:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-31 04:18:20] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-31 04:18:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
[2024-05-31 04:18:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:18:21] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 20 ms.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-31 04:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:18:21] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-31 04:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-31 04:18:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:18:21] [INFO ] Added : 19 causal constraints over 4 iterations in 242 ms. Result :sat
Minimization took 145 ms.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 04:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:21] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:18:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 04:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 04:18:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:18:22] [INFO ] Added : 22 causal constraints over 5 iterations in 203 ms. Result :sat
Minimization took 70 ms.
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:18:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 04:18:22] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-31 04:18:22] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-31 04:18:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-31 04:18:22] [INFO ] Added : 36 causal constraints over 8 iterations in 229 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 04:18:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:18:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-31 04:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 04:18:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-31 04:18:22] [INFO ] Added : 20 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 1, 10, -1, -1, 3, 10, 4, -1, 2]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:18:23] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 394 ms.
[2024-05-31 04:18:23] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 63 ms
Reduce places removed 40 places and 40 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 341 ms. (steps per millisecond=29 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :2
[2024-05-31 04:18:24] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-31 04:18:24] [INFO ] Computed 112 invariants in 120 ms
[2024-05-31 04:18:24] [INFO ] [Real]Absence check using 105 positive place invariants in 26 ms returned sat
[2024-05-31 04:18:24] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:25] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-31 04:18:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:25] [INFO ] [Nat]Absence check using 105 positive place invariants in 27 ms returned sat
[2024-05-31 04:18:25] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 04:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:27] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2024-05-31 04:18:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:18:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 149 ms returned sat
[2024-05-31 04:18:27] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 286 ms.
[2024-05-31 04:18:27] [INFO ] Added : 7 causal constraints over 2 iterations in 601 ms. Result :sat
Minimization took 196 ms.
[2024-05-31 04:18:28] [INFO ] [Real]Absence check using 105 positive place invariants in 24 ms returned sat
[2024-05-31 04:18:28] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned unsat
[2024-05-31 04:18:28] [INFO ] [Real]Absence check using 105 positive place invariants in 27 ms returned sat
[2024-05-31 04:18:28] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:29] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2024-05-31 04:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:29] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2024-05-31 04:18:29] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:30] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-05-31 04:18:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2024-05-31 04:18:30] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 513 ms.
[2024-05-31 04:18:31] [INFO ] Added : 8 causal constraints over 2 iterations in 803 ms. Result :sat
Minimization took 384 ms.
[2024-05-31 04:18:31] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2024-05-31 04:18:31] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 04:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:32] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2024-05-31 04:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:32] [INFO ] [Nat]Absence check using 105 positive place invariants in 41 ms returned sat
[2024-05-31 04:18:32] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:34] [INFO ] [Nat]Absence check using state equation in 1640 ms returned sat
[2024-05-31 04:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 575 ms returned sat
[2024-05-31 04:18:35] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 216 ms.
[2024-05-31 04:18:36] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 1 ms to minimize.
[2024-05-31 04:18:37] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1629 ms
[2024-05-31 04:18:38] [INFO ] Deduced a trap composed of 3 places in 834 ms of which 1 ms to minimize.
[2024-05-31 04:18:38] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
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:18:38] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-05-31 04:18:38] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:39] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2024-05-31 04:18:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:39] [INFO ] [Nat]Absence check using 105 positive place invariants in 26 ms returned sat
[2024-05-31 04:18:39] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 04:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:40] [INFO ] [Nat]Absence check using state equation in 948 ms returned sat
[2024-05-31 04:18:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 297 ms returned sat
[2024-05-31 04:18:41] [INFO ] Deduced a trap composed of 194 places in 501 ms of which 1 ms to minimize.
[2024-05-31 04:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 666 ms
[2024-05-31 04:18:41] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 217 ms.
[2024-05-31 04:18:42] [INFO ] Deduced a trap composed of 19 places in 613 ms of which 1 ms to minimize.
[2024-05-31 04:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 969 ms
[2024-05-31 04:18:43] [INFO ] Added : 23 causal constraints over 5 iterations in 1852 ms. Result :sat
Minimization took 1069 ms.
[2024-05-31 04:18:44] [INFO ] [Real]Absence check using 105 positive place invariants in 43 ms returned sat
[2024-05-31 04:18:44] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 28 ms returned unsat
[2024-05-31 04:18:44] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-05-31 04:18:44] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 04:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:45] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-31 04:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:45] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2024-05-31 04:18:45] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:46] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2024-05-31 04:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 68 ms returned sat
[2024-05-31 04:18:46] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 244 ms.
[2024-05-31 04:18:47] [INFO ] Added : 6 causal constraints over 2 iterations in 726 ms. Result :sat
Minimization took 2902 ms.
[2024-05-31 04:18:50] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-05-31 04:18:50] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:51] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2024-05-31 04:18:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:51] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2024-05-31 04:18:51] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 04:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:53] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2024-05-31 04:18:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 264 ms returned sat
[2024-05-31 04:18:53] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 195 ms.
[2024-05-31 04:18:54] [INFO ] Added : 11 causal constraints over 3 iterations in 713 ms. Result :sat
Minimization took 515 ms.
[2024-05-31 04:18:54] [INFO ] [Real]Absence check using 105 positive place invariants in 25 ms returned sat
[2024-05-31 04:18:54] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-31 04:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:55] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2024-05-31 04:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:18:55] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2024-05-31 04:18:55] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:18:56] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2024-05-31 04:18:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 876 ms returned sat
[2024-05-31 04:18:57] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 216 ms.
[2024-05-31 04:18:58] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 566 ms
[2024-05-31 04:18:59] [INFO ] Added : 27 causal constraints over 6 iterations in 1715 ms. Result :sat
Minimization took 1241 ms.
[2024-05-31 04:19:00] [INFO ] [Real]Absence check using 105 positive place invariants in 34 ms returned sat
[2024-05-31 04:19:00] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 04:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:01] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2024-05-31 04:19:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:19:01] [INFO ] [Nat]Absence check using 105 positive place invariants in 26 ms returned sat
[2024-05-31 04:19:01] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 04:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:02] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2024-05-31 04:19:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 149 ms returned sat
[2024-05-31 04:19:02] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 167 ms.
[2024-05-31 04:19:03] [INFO ] Deduced a trap composed of 413 places in 470 ms of which 1 ms to minimize.
[2024-05-31 04:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2024-05-31 04:19:04] [INFO ] Added : 11 causal constraints over 3 iterations in 1336 ms. Result :sat
Minimization took 2127 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 10, 2147483647, 1, 10, 4, 2147483647, 2] Max seen :[0, 1, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 495 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 844 transition count 2227
Reduce places removed 3 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 44 rules applied. Total rules applied 57 place count 841 transition count 2186
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 98 place count 800 transition count 2186
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 98 place count 800 transition count 2181
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 795 transition count 2181
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 3 with 4 rules applied. Total rules applied 112 place count 793 transition count 2179
Applied a total of 112 rules in 256 ms. Remains 793 /854 variables (removed 61) and now considering 2179/2230 (removed 51) transitions.
[2024-05-31 04:19:06] [INFO ] Flow matrix only has 2170 transitions (discarded 9 similar events)
// Phase 1: matrix 2170 rows 793 cols
[2024-05-31 04:19:07] [INFO ] Computed 102 invariants in 79 ms
[2024-05-31 04:19:08] [INFO ] Dead Transitions using invariants and state equation in 1454 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 : 793/854 places, 1564/2230 transitions.
Applied a total of 0 rules in 35 ms. Remains 793 /793 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1751 ms. Remains : 793/854 places, 1564/2230 transitions.
Normalized transition count is 1555 out of 1564 initially.
// Phase 1: matrix 1555 rows 793 cols
[2024-05-31 04:19:08] [INFO ] Computed 102 invariants in 20 ms
Incomplete random walk after 1000000 steps, including 70864 resets, run finished after 15256 ms. (steps per millisecond=65 ) properties (out of 6) seen :15
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 709417 steps, including 6071 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=141 )
Incomplete Best-First random walk after 1000001 steps, including 8219 resets, run finished after 2592 ms. (steps per millisecond=385 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 8320 resets, run finished after 3026 ms. (steps per millisecond=330 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000000 steps, including 8134 resets, run finished after 2543 ms. (steps per millisecond=393 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 8270 resets, run finished after 2929 ms. (steps per millisecond=341 ) properties (out of 5) seen :13
[2024-05-31 04:19:39] [INFO ] Flow matrix only has 1555 transitions (discarded 9 similar events)
// Phase 1: matrix 1555 rows 793 cols
[2024-05-31 04:19:39] [INFO ] Computed 102 invariants in 47 ms
[2024-05-31 04:19:40] [INFO ] [Real]Absence check using 96 positive place invariants in 30 ms returned sat
[2024-05-31 04:19:40] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-31 04:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:40] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-05-31 04:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:19:40] [INFO ] [Nat]Absence check using 96 positive place invariants in 24 ms returned sat
[2024-05-31 04:19:40] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-31 04:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:41] [INFO ] [Nat]Absence check using state equation in 750 ms returned unsat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned unsat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive place invariants in 23 ms returned sat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 8 ms returned unsat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-31 04:19:41] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-31 04:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:42] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2024-05-31 04:19:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:19:42] [INFO ] [Nat]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-31 04:19:42] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 21 ms returned sat
[2024-05-31 04:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:19:42] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-05-31 04:19:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:19:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 160 ms returned sat
[2024-05-31 04:19:43] [INFO ] Deduced a trap composed of 354 places in 417 ms of which 1 ms to minimize.
[2024-05-31 04:19:44] [INFO ] Deduced a trap composed of 356 places in 461 ms of which 1 ms to minimize.
[2024-05-31 04:19:44] [INFO ] Deduced a trap composed of 360 places in 434 ms of which 1 ms to minimize.
[2024-05-31 04:19:45] [INFO ] Deduced a trap composed of 356 places in 411 ms of which 2 ms to minimize.
[2024-05-31 04:19:45] [INFO ] Deduced a trap composed of 358 places in 459 ms of which 1 ms to minimize.
[2024-05-31 04:19:46] [INFO ] Deduced a trap composed of 354 places in 446 ms of which 1 ms to minimize.
[2024-05-31 04:19:46] [INFO ] Deduced a trap composed of 350 places in 459 ms of which 1 ms to minimize.
[2024-05-31 04:19:47] [INFO ] Deduced a trap composed of 356 places in 423 ms of which 0 ms to minimize.
[2024-05-31 04:19:47] [INFO ] Deduced a trap composed of 356 places in 397 ms of which 0 ms to minimize.
[2024-05-31 04:19:48] [INFO ] Deduced a trap composed of 354 places in 442 ms of which 1 ms to minimize.
[2024-05-31 04:19:48] [INFO ] Deduced a trap composed of 346 places in 407 ms of which 1 ms to minimize.
[2024-05-31 04:19:49] [INFO ] Deduced a trap composed of 356 places in 438 ms of which 0 ms to minimize.
[2024-05-31 04:19:50] [INFO ] Deduced a trap composed of 348 places in 455 ms of which 1 ms to minimize.
[2024-05-31 04:19:50] [INFO ] Deduced a trap composed of 360 places in 465 ms of which 1 ms to minimize.
[2024-05-31 04:19:51] [INFO ] Deduced a trap composed of 364 places in 444 ms of which 1 ms to minimize.
[2024-05-31 04:19:51] [INFO ] Deduced a trap composed of 348 places in 443 ms of which 13 ms to minimize.
[2024-05-31 04:19:52] [INFO ] Deduced a trap composed of 356 places in 399 ms of which 3 ms to minimize.
[2024-05-31 04:19:52] [INFO ] Deduced a trap composed of 364 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:19:53] [INFO ] Deduced a trap composed of 350 places in 387 ms of which 1 ms to minimize.
[2024-05-31 04:19:53] [INFO ] Deduced a trap composed of 356 places in 410 ms of which 0 ms to minimize.
[2024-05-31 04:19:53] [INFO ] Deduced a trap composed of 358 places in 373 ms of which 1 ms to minimize.
[2024-05-31 04:19:54] [INFO ] Deduced a trap composed of 358 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:19:54] [INFO ] Deduced a trap composed of 355 places in 391 ms of which 0 ms to minimize.
[2024-05-31 04:19:56] [INFO ] Deduced a trap composed of 354 places in 470 ms of which 1 ms to minimize.
[2024-05-31 04:19:57] [INFO ] Deduced a trap composed of 340 places in 484 ms of which 1 ms to minimize.
[2024-05-31 04:19:58] [INFO ] Deduced a trap composed of 356 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:19:59] [INFO ] Deduced a trap composed of 356 places in 450 ms of which 1 ms to minimize.
[2024-05-31 04:19:59] [INFO ] Deduced a trap composed of 354 places in 397 ms of which 1 ms to minimize.
[2024-05-31 04:20:00] [INFO ] Deduced a trap composed of 362 places in 375 ms of which 0 ms to minimize.
[2024-05-31 04:20:00] [INFO ] Deduced a trap composed of 364 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:20:01] [INFO ] Deduced a trap composed of 352 places in 440 ms of which 1 ms to minimize.
[2024-05-31 04:20:01] [INFO ] Deduced a trap composed of 350 places in 375 ms of which 1 ms to minimize.
[2024-05-31 04:20:02] [INFO ] Deduced a trap composed of 352 places in 413 ms of which 2 ms to minimize.
[2024-05-31 04:20:03] [INFO ] Deduced a trap composed of 343 places in 481 ms of which 1 ms to minimize.
[2024-05-31 04:20:03] [INFO ] Deduced a trap composed of 331 places in 477 ms of which 1 ms to minimize.
[2024-05-31 04:20:05] [INFO ] Deduced a trap composed of 359 places in 481 ms of which 1 ms to minimize.
[2024-05-31 04:20:05] [INFO ] Deduced a trap composed of 360 places in 466 ms of which 1 ms to minimize.
[2024-05-31 04:20:06] [INFO ] Deduced a trap composed of 364 places in 468 ms of which 1 ms to minimize.
[2024-05-31 04:20:08] [INFO ] Deduced a trap composed of 348 places in 500 ms of which 7 ms to minimize.
[2024-05-31 04:20:08] [INFO ] Deduced a trap composed of 352 places in 377 ms of which 1 ms to minimize.
[2024-05-31 04:20:11] [INFO ] Deduced a trap composed of 360 places in 355 ms of which 0 ms to minimize.
[2024-05-31 04:20:11] [INFO ] Deduced a trap composed of 358 places in 488 ms of which 1 ms to minimize.
[2024-05-31 04:20:12] [INFO ] Deduced a trap composed of 356 places in 345 ms of which 0 ms to minimize.
[2024-05-31 04:20:14] [INFO ] Deduced a trap composed of 356 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:20:14] [INFO ] Deduced a trap composed of 358 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:20:14] [INFO ] Deduced a trap composed of 358 places in 286 ms of which 0 ms to minimize.
[2024-05-31 04:20:15] [INFO ] Deduced a trap composed of 364 places in 318 ms of which 1 ms to minimize.
[2024-05-31 04:20:16] [INFO ] Deduced a trap composed of 356 places in 496 ms of which 2 ms to minimize.
[2024-05-31 04:20:16] [INFO ] Deduced a trap composed of 364 places in 411 ms of which 0 ms to minimize.
[2024-05-31 04:20:17] [INFO ] Deduced a trap composed of 356 places in 530 ms of which 6 ms to minimize.
[2024-05-31 04:20:18] [INFO ] Deduced a trap composed of 354 places in 497 ms of which 1 ms to minimize.
[2024-05-31 04:20:18] [INFO ] Deduced a trap composed of 362 places in 465 ms of which 0 ms to minimize.
[2024-05-31 04:20:20] [INFO ] Deduced a trap composed of 346 places in 464 ms of which 0 ms to minimize.
[2024-05-31 04:20:23] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 39938 ms
[2024-05-31 04:20:23] [INFO ] [Real]Absence check using 96 positive place invariants in 22 ms returned sat
[2024-05-31 04:20:23] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 4, 4, 1] Max seen :[4, 1, 4, 3, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 793 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 793/793 places, 1564/1564 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 793 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 792 transition count 1563
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 792 transition count 1522
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 751 transition count 1522
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 750 transition count 1521
Applied a total of 86 rules in 173 ms. Remains 750 /793 variables (removed 43) and now considering 1521/1564 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 750/793 places, 1521/1564 transitions.
Normalized transition count is 1512 out of 1521 initially.
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:20:23] [INFO ] Computed 102 invariants in 36 ms
Incomplete random walk after 1000000 steps, including 72746 resets, run finished after 9643 ms. (steps per millisecond=103 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8302 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 1) seen :3
[2024-05-31 04:20:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:20:34] [INFO ] Computed 102 invariants in 51 ms
[2024-05-31 04:20:34] [INFO ] [Real]Absence check using 95 positive place invariants in 31 ms returned sat
[2024-05-31 04:20:35] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 04:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:20:35] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-31 04:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:20:35] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-31 04:20:35] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:20:35] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2024-05-31 04:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:20:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 202 ms returned sat
[2024-05-31 04:20:36] [INFO ] Deduced a trap composed of 294 places in 365 ms of which 1 ms to minimize.
[2024-05-31 04:20:36] [INFO ] Deduced a trap composed of 296 places in 444 ms of which 1 ms to minimize.
[2024-05-31 04:20:37] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 1 ms to minimize.
[2024-05-31 04:20:38] [INFO ] Deduced a trap composed of 300 places in 461 ms of which 1 ms to minimize.
[2024-05-31 04:20:38] [INFO ] Deduced a trap composed of 296 places in 454 ms of which 1 ms to minimize.
[2024-05-31 04:20:39] [INFO ] Deduced a trap composed of 302 places in 444 ms of which 1 ms to minimize.
[2024-05-31 04:20:39] [INFO ] Deduced a trap composed of 294 places in 438 ms of which 1 ms to minimize.
[2024-05-31 04:20:40] [INFO ] Deduced a trap composed of 304 places in 464 ms of which 1 ms to minimize.
[2024-05-31 04:20:41] [INFO ] Deduced a trap composed of 300 places in 742 ms of which 1 ms to minimize.
[2024-05-31 04:20:41] [INFO ] Deduced a trap composed of 302 places in 412 ms of which 5 ms to minimize.
[2024-05-31 04:20:42] [INFO ] Deduced a trap composed of 304 places in 442 ms of which 1 ms to minimize.
[2024-05-31 04:20:42] [INFO ] Deduced a trap composed of 294 places in 446 ms of which 1 ms to minimize.
[2024-05-31 04:20:43] [INFO ] Deduced a trap composed of 306 places in 436 ms of which 1 ms to minimize.
[2024-05-31 04:20:43] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 0 ms to minimize.
[2024-05-31 04:20:44] [INFO ] Deduced a trap composed of 296 places in 475 ms of which 1 ms to minimize.
[2024-05-31 04:20:44] [INFO ] Deduced a trap composed of 298 places in 477 ms of which 1 ms to minimize.
[2024-05-31 04:20:45] [INFO ] Deduced a trap composed of 298 places in 447 ms of which 1 ms to minimize.
[2024-05-31 04:20:46] [INFO ] Deduced a trap composed of 302 places in 415 ms of which 1 ms to minimize.
[2024-05-31 04:20:46] [INFO ] Deduced a trap composed of 301 places in 370 ms of which 1 ms to minimize.
[2024-05-31 04:20:46] [INFO ] Deduced a trap composed of 300 places in 413 ms of which 0 ms to minimize.
[2024-05-31 04:20:47] [INFO ] Deduced a trap composed of 298 places in 365 ms of which 0 ms to minimize.
[2024-05-31 04:20:48] [INFO ] Deduced a trap composed of 290 places in 432 ms of which 1 ms to minimize.
[2024-05-31 04:20:48] [INFO ] Deduced a trap composed of 294 places in 423 ms of which 1 ms to minimize.
[2024-05-31 04:20:49] [INFO ] Deduced a trap composed of 306 places in 412 ms of which 1 ms to minimize.
[2024-05-31 04:20:49] [INFO ] Deduced a trap composed of 300 places in 446 ms of which 1 ms to minimize.
[2024-05-31 04:20:50] [INFO ] Deduced a trap composed of 304 places in 438 ms of which 1 ms to minimize.
[2024-05-31 04:20:50] [INFO ] Deduced a trap composed of 302 places in 437 ms of which 0 ms to minimize.
[2024-05-31 04:20:51] [INFO ] Deduced a trap composed of 304 places in 440 ms of which 1 ms to minimize.
[2024-05-31 04:20:52] [INFO ] Deduced a trap composed of 300 places in 451 ms of which 1 ms to minimize.
[2024-05-31 04:20:52] [INFO ] Deduced a trap composed of 306 places in 457 ms of which 1 ms to minimize.
[2024-05-31 04:20:53] [INFO ] Deduced a trap composed of 298 places in 453 ms of which 1 ms to minimize.
[2024-05-31 04:20:53] [INFO ] Deduced a trap composed of 302 places in 425 ms of which 1 ms to minimize.
[2024-05-31 04:20:54] [INFO ] Deduced a trap composed of 302 places in 414 ms of which 1 ms to minimize.
[2024-05-31 04:20:54] [INFO ] Deduced a trap composed of 308 places in 420 ms of which 0 ms to minimize.
[2024-05-31 04:20:55] [INFO ] Deduced a trap composed of 312 places in 423 ms of which 1 ms to minimize.
[2024-05-31 04:20:55] [INFO ] Deduced a trap composed of 304 places in 426 ms of which 1 ms to minimize.
[2024-05-31 04:20:56] [INFO ] Deduced a trap composed of 302 places in 426 ms of which 1 ms to minimize.
[2024-05-31 04:20:56] [INFO ] Deduced a trap composed of 296 places in 385 ms of which 0 ms to minimize.
[2024-05-31 04:20:57] [INFO ] Deduced a trap composed of 300 places in 385 ms of which 0 ms to minimize.
[2024-05-31 04:20:58] [INFO ] Deduced a trap composed of 302 places in 426 ms of which 1 ms to minimize.
[2024-05-31 04:20:58] [INFO ] Deduced a trap composed of 304 places in 432 ms of which 0 ms to minimize.
[2024-05-31 04:20:59] [INFO ] Deduced a trap composed of 300 places in 445 ms of which 1 ms to minimize.
[2024-05-31 04:21:00] [INFO ] Deduced a trap composed of 306 places in 427 ms of which 0 ms to minimize.
[2024-05-31 04:21:00] [INFO ] Deduced a trap composed of 300 places in 392 ms of which 1 ms to minimize.
[2024-05-31 04:21:01] [INFO ] Deduced a trap composed of 296 places in 435 ms of which 1 ms to minimize.
[2024-05-31 04:21:02] [INFO ] Deduced a trap composed of 292 places in 424 ms of which 2 ms to minimize.
[2024-05-31 04:21:03] [INFO ] Deduced a trap composed of 296 places in 374 ms of which 0 ms to minimize.
[2024-05-31 04:21:05] [INFO ] Deduced a trap composed of 300 places in 462 ms of which 1 ms to minimize.
[2024-05-31 04:21:05] [INFO ] Deduced a trap composed of 294 places in 386 ms of which 1 ms to minimize.
[2024-05-31 04:21:06] [INFO ] Deduced a trap composed of 298 places in 410 ms of which 1 ms to minimize.
[2024-05-31 04:21:06] [INFO ] Deduced a trap composed of 295 places in 341 ms of which 0 ms to minimize.
[2024-05-31 04:21:07] [INFO ] Deduced a trap composed of 300 places in 386 ms of which 1 ms to minimize.
[2024-05-31 04:21:08] [INFO ] Deduced a trap composed of 296 places in 474 ms of which 1 ms to minimize.
[2024-05-31 04:21:08] [INFO ] Deduced a trap composed of 302 places in 456 ms of which 1 ms to minimize.
[2024-05-31 04:21:10] [INFO ] Deduced a trap composed of 302 places in 499 ms of which 0 ms to minimize.
[2024-05-31 04:21:10] [INFO ] Deduced a trap composed of 298 places in 460 ms of which 1 ms to minimize.
[2024-05-31 04:21:11] [INFO ] Deduced a trap composed of 296 places in 425 ms of which 1 ms to minimize.
[2024-05-31 04:21:12] [INFO ] Deduced a trap composed of 296 places in 450 ms of which 1 ms to minimize.
[2024-05-31 04:21:15] [INFO ] Deduced a trap composed of 306 places in 469 ms of which 1 ms to minimize.
[2024-05-31 04:21:16] [INFO ] Deduced a trap composed of 308 places in 447 ms of which 2 ms to minimize.
[2024-05-31 04:21:16] [INFO ] Deduced a trap composed of 302 places in 478 ms of which 1 ms to minimize.
[2024-05-31 04:21:17] [INFO ] Deduced a trap composed of 300 places in 414 ms of which 0 ms to minimize.
[2024-05-31 04:21:17] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2024-05-31 04:21:18] [INFO ] Deduced a trap composed of 306 places in 360 ms of which 0 ms to minimize.
[2024-05-31 04:21:18] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 1 ms to minimize.
[2024-05-31 04:21:20] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 44353 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 49 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 61 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 04:21:20] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:21:20] [INFO ] Invariant cache hit.
[2024-05-31 04:21:21] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-31 04:21:21] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:21:21] [INFO ] Invariant cache hit.
[2024-05-31 04:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:21:23] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
[2024-05-31 04:21:23] [INFO ] Redundant transitions in 122 ms returned []
[2024-05-31 04:21:23] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:21:23] [INFO ] Invariant cache hit.
[2024-05-31 04:21:24] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4221 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-12
Normalized transition count is 1512 out of 1521 initially.
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:21:24] [INFO ] Computed 102 invariants in 19 ms
Incomplete random walk after 10000 steps, including 722 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2024-05-31 04:21:24] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:21:24] [INFO ] Computed 102 invariants in 22 ms
[2024-05-31 04:21:25] [INFO ] [Real]Absence check using 95 positive place invariants in 17 ms returned sat
[2024-05-31 04:21:25] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:21:25] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-31 04:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:21:25] [INFO ] [Nat]Absence check using 95 positive place invariants in 17 ms returned sat
[2024-05-31 04:21:25] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:21:25] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-31 04:21:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:21:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 201 ms returned sat
[2024-05-31 04:21:26] [INFO ] Deduced a trap composed of 294 places in 398 ms of which 0 ms to minimize.
[2024-05-31 04:21:26] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 0 ms to minimize.
[2024-05-31 04:21:27] [INFO ] Deduced a trap composed of 296 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:21:27] [INFO ] Deduced a trap composed of 300 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:21:28] [INFO ] Deduced a trap composed of 296 places in 342 ms of which 0 ms to minimize.
[2024-05-31 04:21:28] [INFO ] Deduced a trap composed of 302 places in 379 ms of which 0 ms to minimize.
[2024-05-31 04:21:28] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 2 ms to minimize.
[2024-05-31 04:21:29] [INFO ] Deduced a trap composed of 304 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:21:29] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 0 ms to minimize.
[2024-05-31 04:21:30] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2024-05-31 04:21:30] [INFO ] Deduced a trap composed of 304 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:21:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 43 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 04:21:30] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:21:30] [INFO ] Invariant cache hit.
[2024-05-31 04:21:31] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 750/750 places, 1521/1521 transitions.
Normalized transition count is 1512 out of 1521 initially.
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:21:31] [INFO ] Computed 102 invariants in 34 ms
Incomplete random walk after 1000000 steps, including 72668 resets, run finished after 12121 ms. (steps per millisecond=82 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8137 resets, run finished after 2422 ms. (steps per millisecond=412 ) properties (out of 1) seen :3
[2024-05-31 04:21:45] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 04:21:46] [INFO ] Computed 102 invariants in 45 ms
[2024-05-31 04:21:46] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-31 04:21:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:21:46] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-05-31 04:21:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:21:46] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-31 04:21:46] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 04:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:21:47] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-31 04:21:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:21:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 220 ms returned sat
[2024-05-31 04:21:47] [INFO ] Deduced a trap composed of 294 places in 362 ms of which 0 ms to minimize.
[2024-05-31 04:21:48] [INFO ] Deduced a trap composed of 296 places in 344 ms of which 1 ms to minimize.
[2024-05-31 04:21:48] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:21:48] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 0 ms to minimize.
[2024-05-31 04:21:49] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:21:49] [INFO ] Deduced a trap composed of 302 places in 266 ms of which 1 ms to minimize.
[2024-05-31 04:21:49] [INFO ] Deduced a trap composed of 294 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:21:50] [INFO ] Deduced a trap composed of 304 places in 318 ms of which 0 ms to minimize.
[2024-05-31 04:21:50] [INFO ] Deduced a trap composed of 300 places in 349 ms of which 0 ms to minimize.
[2024-05-31 04:21:51] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:21:51] [INFO ] Deduced a trap composed of 304 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:21:51] [INFO ] Deduced a trap composed of 294 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:21:52] [INFO ] Deduced a trap composed of 306 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:21:52] [INFO ] Deduced a trap composed of 300 places in 281 ms of which 1 ms to minimize.
[2024-05-31 04:21:53] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 0 ms to minimize.
[2024-05-31 04:21:53] [INFO ] Deduced a trap composed of 298 places in 288 ms of which 0 ms to minimize.
[2024-05-31 04:21:53] [INFO ] Deduced a trap composed of 298 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:21:54] [INFO ] Deduced a trap composed of 302 places in 262 ms of which 0 ms to minimize.
[2024-05-31 04:21:54] [INFO ] Deduced a trap composed of 301 places in 291 ms of which 1 ms to minimize.
[2024-05-31 04:21:54] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:21:55] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2024-05-31 04:21:55] [INFO ] Deduced a trap composed of 290 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:21:56] [INFO ] Deduced a trap composed of 294 places in 381 ms of which 1 ms to minimize.
[2024-05-31 04:21:57] [INFO ] Deduced a trap composed of 306 places in 436 ms of which 0 ms to minimize.
[2024-05-31 04:21:57] [INFO ] Deduced a trap composed of 300 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:21:57] [INFO ] Deduced a trap composed of 304 places in 276 ms of which 0 ms to minimize.
[2024-05-31 04:21:58] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2024-05-31 04:21:58] [INFO ] Deduced a trap composed of 304 places in 349 ms of which 0 ms to minimize.
[2024-05-31 04:21:59] [INFO ] Deduced a trap composed of 300 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:21:59] [INFO ] Deduced a trap composed of 306 places in 367 ms of which 0 ms to minimize.
[2024-05-31 04:21:59] [INFO ] Deduced a trap composed of 298 places in 324 ms of which 1 ms to minimize.
[2024-05-31 04:22:00] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 0 ms to minimize.
[2024-05-31 04:22:00] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 0 ms to minimize.
[2024-05-31 04:22:01] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 0 ms to minimize.
[2024-05-31 04:22:01] [INFO ] Deduced a trap composed of 312 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:22:01] [INFO ] Deduced a trap composed of 304 places in 329 ms of which 1 ms to minimize.
[2024-05-31 04:22:02] [INFO ] Deduced a trap composed of 302 places in 279 ms of which 0 ms to minimize.
[2024-05-31 04:22:02] [INFO ] Deduced a trap composed of 296 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:22:02] [INFO ] Deduced a trap composed of 300 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:22:03] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2024-05-31 04:22:03] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:22:04] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 0 ms to minimize.
[2024-05-31 04:22:04] [INFO ] Deduced a trap composed of 306 places in 339 ms of which 0 ms to minimize.
[2024-05-31 04:22:05] [INFO ] Deduced a trap composed of 300 places in 344 ms of which 0 ms to minimize.
[2024-05-31 04:22:06] [INFO ] Deduced a trap composed of 296 places in 379 ms of which 1 ms to minimize.
[2024-05-31 04:22:06] [INFO ] Deduced a trap composed of 292 places in 368 ms of which 0 ms to minimize.
[2024-05-31 04:22:07] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:22:08] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 1 ms to minimize.
[2024-05-31 04:22:09] [INFO ] Deduced a trap composed of 294 places in 364 ms of which 1 ms to minimize.
[2024-05-31 04:22:09] [INFO ] Deduced a trap composed of 298 places in 325 ms of which 0 ms to minimize.
[2024-05-31 04:22:10] [INFO ] Deduced a trap composed of 295 places in 380 ms of which 0 ms to minimize.
[2024-05-31 04:22:10] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 0 ms to minimize.
[2024-05-31 04:22:11] [INFO ] Deduced a trap composed of 296 places in 394 ms of which 0 ms to minimize.
[2024-05-31 04:22:12] [INFO ] Deduced a trap composed of 302 places in 394 ms of which 1 ms to minimize.
[2024-05-31 04:22:13] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:22:13] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:22:14] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 0 ms to minimize.
[2024-05-31 04:22:14] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 0 ms to minimize.
[2024-05-31 04:22:17] [INFO ] Deduced a trap composed of 306 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:22:18] [INFO ] Deduced a trap composed of 308 places in 372 ms of which 0 ms to minimize.
[2024-05-31 04:22:18] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:22:19] [INFO ] Deduced a trap composed of 300 places in 390 ms of which 1 ms to minimize.
[2024-05-31 04:22:19] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:22:20] [INFO ] Deduced a trap composed of 306 places in 389 ms of which 1 ms to minimize.
[2024-05-31 04:22:20] [INFO ] Deduced a trap composed of 296 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:22:23] [INFO ] Deduced a trap composed of 294 places in 379 ms of which 1 ms to minimize.
[2024-05-31 04:22:24] [INFO ] Deduced a trap composed of 296 places in 351 ms of which 1 ms to minimize.
[2024-05-31 04:22:25] [INFO ] Deduced a trap composed of 298 places in 350 ms of which 1 ms to minimize.
[2024-05-31 04:22:26] [INFO ] Deduced a trap composed of 298 places in 366 ms of which 1 ms to minimize.
[2024-05-31 04:22:26] [INFO ] Deduced a trap composed of 300 places in 329 ms of which 0 ms to minimize.
[2024-05-31 04:22:27] [INFO ] Deduced a trap composed of 294 places in 346 ms of which 1 ms to minimize.
[2024-05-31 04:22:27] [INFO ] Deduced a trap composed of 300 places in 283 ms of which 0 ms to minimize.
[2024-05-31 04:22:28] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 1 ms to minimize.
[2024-05-31 04:22:28] [INFO ] Deduced a trap composed of 300 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:22:29] [INFO ] Deduced a trap composed of 306 places in 346 ms of which 1 ms to minimize.
[2024-05-31 04:22:29] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:22:30] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:22:30] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:22:31] [INFO ] Deduced a trap composed of 298 places in 386 ms of which 1 ms to minimize.
[2024-05-31 04:22:31] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 44307 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 47 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 36 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 04:22:31] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:22:31] [INFO ] Invariant cache hit.
[2024-05-31 04:22:32] [INFO ] Implicit Places using invariants in 718 ms returned []
[2024-05-31 04:22:32] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:22:32] [INFO ] Invariant cache hit.
[2024-05-31 04:22:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:22:34] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
[2024-05-31 04:22:34] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-31 04:22:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 04:22:34] [INFO ] Invariant cache hit.
[2024-05-31 04:22:35] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3414 ms. Remains : 750/750 places, 1521/1521 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-12 in 70420 ms.
[2024-05-31 04:22:35] [INFO ] Flatten gal took : 383 ms
[2024-05-31 04:22:35] [INFO ] Applying decomposition
[2024-05-31 04:22:36] [INFO ] Flatten gal took : 198 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/graph8238519513306354075.txt' '-o' '/tmp/graph8238519513306354075.bin' '-w' '/tmp/graph8238519513306354075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8238519513306354075.bin' '-l' '-1' '-v' '-w' '/tmp/graph8238519513306354075.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:22:36] [INFO ] Decomposing Gal with order
[2024-05-31 04:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:22:37] [INFO ] Removed a total of 3400 redundant transitions.
[2024-05-31 04:22:37] [INFO ] Flatten gal took : 409 ms
[2024-05-31 04:22:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 98 ms.
[2024-05-31 04:22:37] [INFO ] Time to serialize gal into /tmp/UpperBounds5475210484959639229.gal : 48 ms
[2024-05-31 04:22:37] [INFO ] Time to serialize properties into /tmp/UpperBounds13436713442928045437.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/UpperBounds5475210484959639229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13436713442928045437.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 ...284
Loading property file /tmp/UpperBounds13436713442928045437.prop.
Detected timeout of ITS tools.
[2024-05-31 04:44:07] [INFO ] Applying decomposition
[2024-05-31 04:44:07] [INFO ] Flatten gal took : 637 ms
[2024-05-31 04:44:08] [INFO ] Decomposing Gal with order
[2024-05-31 04:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:44:09] [INFO ] Removed a total of 7679 redundant transitions.
[2024-05-31 04:44:09] [INFO ] Flatten gal took : 1564 ms
[2024-05-31 04:44:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 44 ms.
[2024-05-31 04:44:10] [INFO ] Time to serialize gal into /tmp/UpperBounds6931182018677263413.gal : 136 ms
[2024-05-31 04:44:10] [INFO ] Time to serialize properties into /tmp/UpperBounds14009001127429550331.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/UpperBounds6931182018677263413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14009001127429550331.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 ...284
Loading property file /tmp/UpperBounds14009001127429550331.prop.
Detected timeout of ITS tools.
[2024-05-31 05:05:38] [INFO ] Flatten gal took : 833 ms
[2024-05-31 05:05:40] [INFO ] Input system was already deterministic with 1521 transitions.
[2024-05-31 05:05:40] [INFO ] Transformed 750 places.
[2024-05-31 05:05:40] [INFO ] Transformed 1521 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 05:06:11] [INFO ] Time to serialize gal into /tmp/UpperBounds4599084914910083711.gal : 25 ms
[2024-05-31 05:06:11] [INFO ] Time to serialize properties into /tmp/UpperBounds4952638959873233814.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/UpperBounds4599084914910083711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4952638959873233814.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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4952638959873233814.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 3460412 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16249184 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-S10J40"
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-S10J40, 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-171654460800261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;