fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873948300709
Last Updated
May 14, 2023

About the Execution of LoLa+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
866.552 65740.00 82426.00 392.60 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.r295-tall-167873948300709.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 lolaxred
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 r295-tall-167873948300709
=====================================================================

--------------------
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 1678892346110

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 14:59:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 14:59:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:59:07] [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-15 14:59:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:59:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2023-03-15 14:59:08] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-15 14:59:08] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-15 14:59:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 14:59:08] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 14:59:08] [INFO ] Invariant cache hit.
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-15 14:59:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 14:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:59:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:08] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
[2023-03-15 14:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-15 14:59:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 14:59:08] [INFO ] Added : 15 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 14:59:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 14:59:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:08] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-15 14:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-15 14:59:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:09] [INFO ] Added : 36 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 14:59:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 14:59:09] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 14:59:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-15 14:59:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-15 14:59:09] [INFO ] Added : 36 causal constraints over 8 iterations in 140 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 14:59:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2023-03-15 14:59:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:09] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 14:59:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 14:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 14:59:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-15 14:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 14:59:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:10] [INFO ] Added : 19 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 92 ms.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 14:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2023-03-15 14:59:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 14:59:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:10] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2023-03-15 14:59:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-15 14:59:10] [INFO ] Added : 36 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 14:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:10] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2023-03-15 14:59:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 14:59:10] [INFO ] Added : 22 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 14:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 14:59:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:10] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-15 14:59:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-15 14:59:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 14:59:11] [INFO ] Added : 20 causal constraints over 4 iterations in 221 ms. Result :sat
Minimization took 74 ms.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 14:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 14:59:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-15 14:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-15 14:59:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:11] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2023-03-15 14:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-15 14:59:11] [INFO ] Added : 36 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 14:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 14:59:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 14:59:11] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 14:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 14:59:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-15 14:59:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2023-03-15 14:59:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-15 14:59:11] [INFO ] Added : 36 causal constraints over 8 iterations in 182 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 14:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-15 14:59:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 14:59:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-15 14:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 14:59:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 14:59:12] [INFO ] Added : 20 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 14 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-15 14:59:12] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 209 ms.
[2023-03-15 14:59:12] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 28 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 560 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 13) seen :2
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 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 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :10
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :1
[2023-03-15 14:59:13] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 14:59:13] [INFO ] Computed 192 place invariants in 240 ms
[2023-03-15 14:59:13] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 14:59:13] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-15 14:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:14] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2023-03-15 14:59:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:14] [INFO ] [Nat]Absence check using 185 positive place invariants in 66 ms returned sat
[2023-03-15 14:59:14] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 14:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:15] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2023-03-15 14:59:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:59:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2023-03-15 14:59:16] [INFO ] Deduced a trap composed of 453 places in 909 ms of which 2 ms to minimize.
[2023-03-15 14:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1119 ms
[2023-03-15 14:59:17] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 391 ms.
[2023-03-15 14:59:17] [INFO ] Added : 7 causal constraints over 2 iterations in 832 ms. Result :sat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive place invariants in 53 ms returned sat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned unsat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned unsat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned unsat
[2023-03-15 14:59:18] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 14:59:19] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:19] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-15 14:59:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:20] [INFO ] [Nat]Absence check using 185 positive place invariants in 64 ms returned sat
[2023-03-15 14:59:20] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:22] [INFO ] [Nat]Absence check using state equation in 2456 ms returned sat
[2023-03-15 14:59:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1807 ms returned sat
[2023-03-15 14:59:24] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 272 ms.
[2023-03-15 14:59:25] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1186)
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-15 14:59:25] [INFO ] [Real]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 14:59:25] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 14:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:26] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2023-03-15 14:59:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:26] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 14:59:26] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 14:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:28] [INFO ] [Nat]Absence check using state equation in 2281 ms returned sat
[2023-03-15 14:59:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 206 ms returned sat
[2023-03-15 14:59:29] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 252 ms.
[2023-03-15 14:59:31] [INFO ] Deduced a trap composed of 778 places in 919 ms of which 2 ms to minimize.
[2023-03-15 14:59:31] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1120 ms
[2023-03-15 14:59:32] [INFO ] Deduced a trap composed of 9 places in 1149 ms of which 1 ms to minimize.
[2023-03-15 14:59: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 5
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-15 14:59:32] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2023-03-15 14:59:32] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 58 ms returned sat
[2023-03-15 14:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:33] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2023-03-15 14:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:34] [INFO ] [Nat]Absence check using 185 positive place invariants in 56 ms returned sat
[2023-03-15 14:59:34] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-15 14:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:38] [INFO ] [Nat]Absence check using state equation in 4784 ms returned unknown
[2023-03-15 14:59:39] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2023-03-15 14:59:39] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 50 ms returned sat
[2023-03-15 14:59:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:40] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2023-03-15 14:59:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:59:40] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2023-03-15 14:59:40] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 14:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:45] [INFO ] [Nat]Absence check using state equation in 4776 ms returned unknown
[2023-03-15 14:59:45] [INFO ] [Real]Absence check using 185 positive place invariants in 53 ms returned sat
[2023-03-15 14:59:45] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 10, 3, 4, 2147483647, 1] Max seen :[0, 1, 1, 1, 2, 0, 0, 0, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-12 1 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
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 164 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1604 transition count 3304
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 182 place count 1518 transition count 3304
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 182 place count 1518 transition count 3219
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 352 place count 1433 transition count 3219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 353 place count 1432 transition count 3218
Iterating global reduction 2 with 1 rules applied. Total rules applied 354 place count 1432 transition count 3218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 358 place count 1430 transition count 3216
Applied a total of 358 rules in 654 ms. Remains 1430 /1614 variables (removed 184) and now considering 3216/3390 (removed 174) transitions.
[2023-03-15 14:59:46] [INFO ] Flow matrix only has 3207 transitions (discarded 9 similar events)
// Phase 1: matrix 3207 rows 1430 cols
[2023-03-15 14:59:46] [INFO ] Computed 182 place invariants in 135 ms
[2023-03-15 14:59:48] [INFO ] Dead Transitions using invariants and state equation in 1864 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 : 1430/1614 places, 2601/3390 transitions.
Applied a total of 0 rules in 79 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2603 ms. Remains : 1430/1614 places, 2601/3390 transitions.
Normalized transition count is 2592 out of 2601 initially.
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 14:59:48] [INFO ] Computed 182 place invariants in 62 ms
Incomplete random walk after 1000000 steps, including 72761 resets, run finished after 14315 ms. (steps per millisecond=69 ) properties (out of 4) seen :12
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 6524 resets, run finished after 3308 ms. (steps per millisecond=302 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 6450 resets, run finished after 3360 ms. (steps per millisecond=297 ) properties (out of 2) seen :5
[2023-03-15 15:00:09] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 15:00:09] [INFO ] Computed 182 place invariants in 59 ms
[2023-03-15 15:00:09] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 15:00:09] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 21 ms returned unsat
[2023-03-15 15:00:09] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-15 15:00:09] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 15:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:00:10] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2023-03-15 15:00:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:00:10] [INFO ] [Nat]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 15:00:10] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1] Max seen :[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
All properties solved without resorting to model-checking.
Total runtime 63387 ms.
ITS solved all properties within timeout

BK_STOP 1678892411850

--------------------
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="lolaxred"
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 lolaxred"
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 r295-tall-167873948300709"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;