About the Execution of LTSMin+red for PolyORBNT-COL-S10J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1091.907 | 119403.00 | 136503.00 | 466.00 | 10 1 1 1 1 1 4 10 1 3 4 1 1 1 3 2 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950800709.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-COL-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800709
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679618463450
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 00:41:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 00:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:41:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 00:41:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 00:41:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2023-03-24 00:41:06] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-24 00:41:06] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-24 00:41:06] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 00:41:06] [INFO ] Computed 13 place invariants in 11 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-24 00:41:06] [INFO ] Invariant cache hit.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-24 00:41:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-24 00:41:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:41:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2023-03-24 00:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-24 00:41:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 00:41:06] [INFO ] Added : 15 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-24 00:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-24 00:41:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 00:41:06] [INFO ] Added : 36 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-24 00:41:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-24 00:41:07] [INFO ] Added : 36 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-24 00:41:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-24 00:41:07] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 00:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2023-03-24 00:41:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:41:07] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-24 00:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:07] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-24 00:41:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-24 00:41:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:41:08] [INFO ] Added : 19 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 105 ms.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-24 00:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-24 00:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-24 00:41:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:41:08] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2023-03-24 00:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-24 00:41:08] [INFO ] Added : 36 causal constraints over 8 iterations in 100 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 00:41:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-24 00:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-24 00:41:08] [INFO ] Added : 22 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-24 00:41:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-24 00:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-24 00:41:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:41:09] [INFO ] Added : 20 causal constraints over 4 iterations in 226 ms. Result :sat
Minimization took 74 ms.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-24 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-24 00:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-24 00:41:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 00:41:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2023-03-24 00:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-24 00:41:09] [INFO ] Added : 36 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:41:09] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:41:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-24 00:41:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-24 00:41:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-03-24 00:41:09] [INFO ] Added : 36 causal constraints over 8 iterations in 204 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-24 00:41:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:41:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:41:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:10] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-24 00:41:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:41:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-24 00:41:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-24 00:41:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 00:41:10] [INFO ] Added : 20 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, -1, -1, 1, -1, 10, 10, 1, 3, 4, -1, -1, 1, 3, 2]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 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.
[2023-03-24 00:41:10] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 210 ms.
[2023-03-24 00:41:10] [INFO ] Unfolded 13 HLPN properties in 7 ms.
Deduced a syphon composed of 80 places in 35 ms
Reduce places removed 80 places and 80 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 299 ms. (steps per millisecond=33 ) properties (out of 13) seen :2
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :1
[2023-03-24 00:41:11] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-24 00:41:11] [INFO ] Computed 192 place invariants in 217 ms
[2023-03-24 00:41:11] [INFO ] [Real]Absence check using 185 positive place invariants in 72 ms returned sat
[2023-03-24 00:41:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-24 00:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:12] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-24 00:41:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:13] [INFO ] [Nat]Absence check using 185 positive place invariants in 67 ms returned sat
[2023-03-24 00:41:13] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2023-03-24 00:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:14] [INFO ] [Nat]Absence check using state equation in 1273 ms returned sat
[2023-03-24 00:41:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:41:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2023-03-24 00:41:15] [INFO ] Deduced a trap composed of 453 places in 1166 ms of which 2 ms to minimize.
[2023-03-24 00:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1399 ms
[2023-03-24 00:41:16] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 415 ms.
[2023-03-24 00:41:17] [INFO ] Added : 7 causal constraints over 2 iterations in 896 ms. Result :sat
[2023-03-24 00:41:17] [INFO ] [Real]Absence check using 185 positive place invariants in 65 ms returned sat
[2023-03-24 00:41:17] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned sat
[2023-03-24 00:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:18] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2023-03-24 00:41:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:19] [INFO ] [Nat]Absence check using 185 positive place invariants in 66 ms returned sat
[2023-03-24 00:41:19] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 58 ms returned sat
[2023-03-24 00:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:23] [INFO ] [Nat]Absence check using state equation in 4706 ms returned unknown
[2023-03-24 00:41:24] [INFO ] [Real]Absence check using 185 positive place invariants in 64 ms returned sat
[2023-03-24 00:41:24] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2023-03-24 00:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:26] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2023-03-24 00:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:26] [INFO ] [Nat]Absence check using 185 positive place invariants in 64 ms returned sat
[2023-03-24 00:41:26] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-24 00:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:27] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-24 00:41:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 848 ms returned sat
[2023-03-24 00:41:29] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 310 ms.
[2023-03-24 00:41:30] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 1 ms to minimize.
[2023-03-24 00:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 776 ms
[2023-03-24 00:41:32] [INFO ] Deduced a trap composed of 9 places in 1572 ms of which 2 ms to minimize.
[2023-03-24 00:41:32] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:41:33] [INFO ] [Real]Absence check using 185 positive place invariants in 66 ms returned sat
[2023-03-24 00:41:33] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-24 00:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:34] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2023-03-24 00:41:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:34] [INFO ] [Nat]Absence check using 185 positive place invariants in 63 ms returned sat
[2023-03-24 00:41:34] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-24 00:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:35] [INFO ] [Nat]Absence check using state equation in 1244 ms returned sat
[2023-03-24 00:41:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2023-03-24 00:41:37] [INFO ] Deduced a trap composed of 843 places in 1003 ms of which 1 ms to minimize.
[2023-03-24 00:41:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1284 ms
[2023-03-24 00:41:37] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 294 ms.
[2023-03-24 00:41:38] [INFO ] Added : 8 causal constraints over 2 iterations in 749 ms. Result :sat
[2023-03-24 00:41:38] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-24 00:41:38] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-24 00:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:39] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2023-03-24 00:41:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:39] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2023-03-24 00:41:39] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-24 00:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:41] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2023-03-24 00:41:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2023-03-24 00:41:42] [INFO ] Deduced a trap composed of 399 places in 1110 ms of which 2 ms to minimize.
[2023-03-24 00:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1333 ms
[2023-03-24 00:41:42] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 346 ms.
[2023-03-24 00:41:44] [INFO ] Added : 5 causal constraints over 1 iterations in 2295 ms. Result :unknown
[2023-03-24 00:41:44] [INFO ] [Real]Absence check using 185 positive place invariants in 68 ms returned sat
[2023-03-24 00:41:44] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-24 00:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:46] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2023-03-24 00:41:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:46] [INFO ] [Nat]Absence check using 185 positive place invariants in 70 ms returned sat
[2023-03-24 00:41:46] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 81 ms returned sat
[2023-03-24 00:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:48] [INFO ] [Nat]Absence check using state equation in 2109 ms returned sat
[2023-03-24 00:41:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 875 ms returned sat
[2023-03-24 00:41:50] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 324 ms.
[2023-03-24 00:41:50] [INFO ] Added : 6 causal constraints over 2 iterations in 778 ms. Result :sat
[2023-03-24 00:41:50] [INFO ] [Real]Absence check using 185 positive place invariants in 62 ms returned sat
[2023-03-24 00:41:50] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned sat
[2023-03-24 00:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:52] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2023-03-24 00:41:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:52] [INFO ] [Nat]Absence check using 185 positive place invariants in 61 ms returned sat
[2023-03-24 00:41:52] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned sat
[2023-03-24 00:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:57] [INFO ] [Nat]Absence check using state equation in 4720 ms returned unknown
[2023-03-24 00:41:57] [INFO ] [Real]Absence check using 185 positive place invariants in 54 ms returned sat
[2023-03-24 00:41:57] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-24 00:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:41:58] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2023-03-24 00:41:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:41:59] [INFO ] [Nat]Absence check using 185 positive place invariants in 70 ms returned sat
[2023-03-24 00:41:59] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2023-03-24 00:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:02] [INFO ] [Nat]Absence check using state equation in 2625 ms returned sat
[2023-03-24 00:42:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 220 ms returned sat
[2023-03-24 00:42:02] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 312 ms.
[2023-03-24 00:42:04] [INFO ] Deduced a trap composed of 778 places in 1146 ms of which 1 ms to minimize.
[2023-03-24 00:42:04] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:42:05] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-24 00:42:05] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2023-03-24 00:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:06] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2023-03-24 00:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:42:06] [INFO ] [Nat]Absence check using 185 positive place invariants in 62 ms returned sat
[2023-03-24 00:42:06] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-24 00:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:11] [INFO ] [Nat]Absence check using state equation in 4728 ms returned unknown
[2023-03-24 00:42:11] [INFO ] [Real]Absence check using 185 positive place invariants in 66 ms returned sat
[2023-03-24 00:42:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2023-03-24 00:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:12] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2023-03-24 00:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:42:13] [INFO ] [Nat]Absence check using 185 positive place invariants in 66 ms returned sat
[2023-03-24 00:42:13] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-24 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:18] [INFO ] [Nat]Absence check using state equation in 4717 ms returned unknown
[2023-03-24 00:42:18] [INFO ] [Real]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-24 00:42:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned unsat
[2023-03-24 00:42:18] [INFO ] [Real]Absence check using 185 positive place invariants in 59 ms returned sat
[2023-03-24 00:42:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 52 ms returned sat
[2023-03-24 00:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:19] [INFO ] [Real]Absence check using state equation in 1119 ms returned sat
[2023-03-24 00:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:42:20] [INFO ] [Nat]Absence check using 185 positive place invariants in 67 ms returned sat
[2023-03-24 00:42:20] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-24 00:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:42:21] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2023-03-24 00:42:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1919 ms returned sat
[2023-03-24 00:42:24] [INFO ] Deduced a trap composed of 407 places in 1200 ms of which 1 ms to minimize.
[2023-03-24 00:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1444 ms
[2023-03-24 00:42:24] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 306 ms.
[2023-03-24 00:42:24] [INFO ] Added : 0 causal constraints over 0 iterations in 307 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 2147483647, 2147483647, 1, 2147483647, 10, 1, 3, 4, 2147483647, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 168 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1604 transition count 3306
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 179 place count 1520 transition count 3305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 1519 transition count 3305
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 180 place count 1519 transition count 3220
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 350 place count 1434 transition count 3220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 352 place count 1433 transition count 3219
Applied a total of 352 rules in 630 ms. Remains 1433 /1614 variables (removed 181) and now considering 3219/3390 (removed 171) transitions.
[2023-03-24 00:42:25] [INFO ] Flow matrix only has 3210 transitions (discarded 9 similar events)
// Phase 1: matrix 3210 rows 1433 cols
[2023-03-24 00:42:25] [INFO ] Computed 182 place invariants in 146 ms
[2023-03-24 00:42:28] [INFO ] Dead Transitions using invariants and state equation in 2457 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 : 1433/1614 places, 2604/3390 transitions.
Applied a total of 0 rules in 80 ms. Remains 1433 /1433 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3173 ms. Remains : 1433/1614 places, 2604/3390 transitions.
Normalized transition count is 2595 out of 2604 initially.
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-24 00:42:28] [INFO ] Computed 182 place invariants in 56 ms
Incomplete random walk after 1000000 steps, including 70671 resets, run finished after 15938 ms. (steps per millisecond=62 ) properties (out of 8) seen :17
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6549 resets, run finished after 2612 ms. (steps per millisecond=382 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6504 resets, run finished after 2556 ms. (steps per millisecond=391 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6488 resets, run finished after 2550 ms. (steps per millisecond=392 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 6351 resets, run finished after 3407 ms. (steps per millisecond=293 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 6513 resets, run finished after 3496 ms. (steps per millisecond=286 ) properties (out of 5) seen :8
[2023-03-24 00:42:58] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-24 00:42:58] [INFO ] Computed 182 place invariants in 69 ms
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned unsat
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive place invariants in 55 ms returned sat
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned unsat
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive place invariants in 66 ms returned sat
[2023-03-24 00:42:59] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned unsat
[2023-03-24 00:43:00] [INFO ] [Real]Absence check using 175 positive place invariants in 55 ms returned sat
[2023-03-24 00:43:00] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned unsat
[2023-03-24 00:43:00] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-24 00:43:00] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-24 00:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:43:01] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2023-03-24 00:43:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:43:01] [INFO ] [Nat]Absence check using 175 positive place invariants in 56 ms returned sat
[2023-03-24 00:43:01] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 44 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 1] Max seen :[1, 1, 1, 4, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 116425 ms.
ITS solved all properties within timeout
BK_STOP 1679618582853
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-S10J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J80, 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 r297-tall-167873950800709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;