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

About the Execution of LTSMin+red for PolyORBLF-COL-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1413.000 3600000.00 14159427.00 563.30 1 1 1 4 4 1 1 4 1 1 5 1 1 ? 2 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950500445.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 PolyORBLF-COL-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950500445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679527150253

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=PolyORBLF-COL-S06J04T04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 23:19:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 23:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:19:12] [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-22 23:19:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 23:19:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2023-03-22 23:19:12] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 23:19:12] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 23:19:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 23:19:12] [INFO ] Computed 26 place invariants in 15 ms
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 23:19:13] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 23:19:13] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 23:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 23:19:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:19:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 23:19:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:13] [INFO ] Added : 3 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 23:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 23:19:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 23:19:13] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 4 ms to minimize.
[2023-03-22 23:19:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-22 23:19:13] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2023-03-22 23:19:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2023-03-22 23:19:13] [INFO ] Added : 57 causal constraints over 12 iterations in 300 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 23:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 21 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 23:19:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 23:19:14] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 29 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-22 23:19:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 23:19:14] [INFO ] Added : 27 causal constraints over 6 iterations in 49 ms. Result :sat
Minimization took 98 ms.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 23:19:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 23:19:14] [INFO ] Added : 60 causal constraints over 12 iterations in 133 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-22 23:19:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:14] [INFO ] Added : 28 causal constraints over 6 iterations in 49 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:14] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-22 23:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 23:19:15] [INFO ] Added : 10 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 23:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:15] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 23:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-22 23:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 23:19:15] [INFO ] Added : 60 causal constraints over 12 iterations in 114 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 23:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 23:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:15] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 23:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:15] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 23:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 23:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:16] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2023-03-22 23:19:16] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2023-03-22 23:19:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-22 23:19:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 149 ms
[2023-03-22 23:19:16] [INFO ] Added : 59 causal constraints over 14 iterations in 272 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 23:19:16] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2023-03-22 23:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 23:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:19:16] [INFO ] Added : 23 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 23:19:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-22 23:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 23:19:16] [INFO ] Added : 10 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 23:19:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 23:19:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2023-03-22 23:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 23:19:16] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2023-03-22 23:19:17] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2023-03-22 23:19:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2023-03-22 23:19:17] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2023-03-22 23:19:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 183 ms
[2023-03-22 23:19:17] [INFO ] Added : 57 causal constraints over 12 iterations in 279 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 33, 5, 4, 4, 33, 1, 1, 87, 4, 4, 5, 4]
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2023-03-22 23:19:17] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 130 ms.
[2023-03-22 23:19:17] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :29
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :25
[2023-03-22 23:19:17] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2023-03-22 23:19:17] [INFO ] Computed 50 place invariants in 70 ms
[2023-03-22 23:19:17] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-22 23:19:17] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2023-03-22 23:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:19] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-22 23:19:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:19] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned sat
[2023-03-22 23:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:19] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-22 23:19:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:19:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 1892 ms returned sat
[2023-03-22 23:19:22] [INFO ] Deduced a trap composed of 190 places in 382 ms of which 1 ms to minimize.
[2023-03-22 23:19:23] [INFO ] Deduced a trap composed of 85 places in 363 ms of which 0 ms to minimize.
[2023-03-22 23:19:24] [INFO ] Deduced a trap composed of 85 places in 352 ms of which 1 ms to minimize.
[2023-03-22 23:19:24] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-22 23:19:24] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:24] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2023-03-22 23:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:24] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-22 23:19:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:25] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2023-03-22 23:19:25] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 4, 1, 1, 4, 5, 1, 4, 2, 1] Max seen :[1, 4, 4, 1, 1, 4, 5, 1, 2, 2, 1]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 251 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
[2023-03-22 23:19:25] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2023-03-22 23:19:25] [INFO ] Computed 44 place invariants in 44 ms
[2023-03-22 23:19:26] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/454 places, 862/1614 transitions.
Applied a total of 0 rules in 19 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1012 ms. Remains : 308/454 places, 862/1614 transitions.
Normalized transition count is 838 out of 862 initially.
// Phase 1: matrix 838 rows 308 cols
[2023-03-22 23:19:26] [INFO ] Computed 44 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 10729 resets, run finished after 5157 ms. (steps per millisecond=193 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 432 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 1) seen :2
[2023-03-22 23:19:33] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 308 cols
[2023-03-22 23:19:33] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-22 23:19:33] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 23:19:33] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 23:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:34] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-22 23:19:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 23:19:34] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-22 23:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:34] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-22 23:19:34] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:19:35] [INFO ] [Nat]Added 112 Read/Feed constraints in 771 ms returned sat
[2023-03-22 23:19:35] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 0 ms to minimize.
[2023-03-22 23:19:35] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 0 ms to minimize.
[2023-03-22 23:19:36] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2023-03-22 23:19:36] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2023-03-22 23:19:36] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 1 ms to minimize.
[2023-03-22 23:19:37] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 1 ms to minimize.
[2023-03-22 23:19:37] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 1 ms to minimize.
[2023-03-22 23:19:37] [INFO ] Deduced a trap composed of 153 places in 219 ms of which 1 ms to minimize.
[2023-03-22 23:19:38] [INFO ] Deduced a trap composed of 152 places in 285 ms of which 1 ms to minimize.
[2023-03-22 23:19:38] [INFO ] Deduced a trap composed of 140 places in 221 ms of which 1 ms to minimize.
[2023-03-22 23:19:38] [INFO ] Deduced a trap composed of 132 places in 215 ms of which 0 ms to minimize.
[2023-03-22 23:19:38] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2023-03-22 23:19:39] [INFO ] Deduced a trap composed of 152 places in 227 ms of which 1 ms to minimize.
[2023-03-22 23:19:39] [INFO ] Deduced a trap composed of 147 places in 213 ms of which 0 ms to minimize.
[2023-03-22 23:19:40] [INFO ] Deduced a trap composed of 140 places in 212 ms of which 1 ms to minimize.
[2023-03-22 23:19:40] [INFO ] Deduced a trap composed of 134 places in 211 ms of which 0 ms to minimize.
[2023-03-22 23:19:40] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 0 ms to minimize.
[2023-03-22 23:19:42] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 0 ms to minimize.
[2023-03-22 23:19:45] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 9821 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 862/862 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 17 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2023-03-22 23:19:45] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
[2023-03-22 23:19:45] [INFO ] Invariant cache hit.
[2023-03-22 23:19:45] [INFO ] Implicit Places using invariants in 320 ms returned [262, 263, 264, 265]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 328 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 862/862 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 300 transition count 858
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 300 transition count 858
Applied a total of 8 rules in 26 ms. Remains 300 /304 variables (removed 4) and now considering 858/862 (removed 4) transitions.
[2023-03-22 23:19:45] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:19:45] [INFO ] Computed 40 place invariants in 12 ms
[2023-03-22 23:19:46] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-22 23:19:46] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:19:46] [INFO ] Invariant cache hit.
[2023-03-22 23:19:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:19:50] [INFO ] Implicit Places using invariants and state equation in 4389 ms returned []
Implicit Place search using SMT with State Equation took 4843 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/308 places, 858/862 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5215 ms. Remains : 300/308 places, 858/862 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:19:50] [INFO ] Computed 40 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 11059 resets, run finished after 5043 ms. (steps per millisecond=198 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 452 resets, run finished after 2394 ms. (steps per millisecond=417 ) properties (out of 1) seen :2
[2023-03-22 23:19:58] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:19:58] [INFO ] Computed 40 place invariants in 21 ms
[2023-03-22 23:19:58] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 23:19:58] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-22 23:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:58] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-22 23:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:19:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 23:19:58] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-22 23:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:19:58] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-22 23:19:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:19:59] [INFO ] [Nat]Added 112 Read/Feed constraints in 549 ms returned sat
[2023-03-22 23:19:59] [INFO ] Deduced a trap composed of 127 places in 218 ms of which 0 ms to minimize.
[2023-03-22 23:19:59] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 1 ms to minimize.
[2023-03-22 23:20:00] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 2 ms to minimize.
[2023-03-22 23:20:00] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-22 23:20:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1088 ms
[2023-03-22 23:20:00] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 75 ms.
[2023-03-22 23:20:01] [INFO ] Added : 69 causal constraints over 14 iterations in 1215 ms. Result :sat
Minimization took 1152 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 23:20:03] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:03] [INFO ] Invariant cache hit.
[2023-03-22 23:20:04] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-22 23:20:04] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:04] [INFO ] Invariant cache hit.
[2023-03-22 23:20:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:20:08] [INFO ] Implicit Places using invariants and state equation in 4107 ms returned []
Implicit Place search using SMT with State Equation took 4537 ms to find 0 implicit places.
[2023-03-22 23:20:08] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-22 23:20:08] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:08] [INFO ] Invariant cache hit.
[2023-03-22 23:20:08] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5042 ms. Remains : 300/300 places, 858/858 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:20:08] [INFO ] Computed 40 place invariants in 11 ms
Incomplete random walk after 10001 steps, including 102 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :2
[2023-03-22 23:20:08] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:20:08] [INFO ] Computed 40 place invariants in 28 ms
[2023-03-22 23:20:08] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 23:20:08] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-22 23:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:20:09] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-22 23:20:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:20:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 23:20:09] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-22 23:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:20:09] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-22 23:20:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:20:10] [INFO ] [Nat]Added 112 Read/Feed constraints in 551 ms returned sat
[2023-03-22 23:20:10] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 0 ms to minimize.
[2023-03-22 23:20:10] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 1 ms to minimize.
[2023-03-22 23:20:10] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 1 ms to minimize.
[2023-03-22 23:20:11] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-22 23:20:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1065 ms
[2023-03-22 23:20:11] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 57 ms.
[2023-03-22 23:20:12] [INFO ] Added : 69 causal constraints over 14 iterations in 1145 ms. Result :sat
Minimization took 1112 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 23:20:14] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:14] [INFO ] Invariant cache hit.
[2023-03-22 23:20:14] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 300/300 places, 858/858 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:20:14] [INFO ] Computed 40 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 10886 resets, run finished after 5148 ms. (steps per millisecond=194 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 462 resets, run finished after 2343 ms. (steps per millisecond=426 ) properties (out of 1) seen :2
[2023-03-22 23:20:22] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 23:20:22] [INFO ] Computed 40 place invariants in 19 ms
[2023-03-22 23:20:22] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 23:20:22] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 17 ms returned sat
[2023-03-22 23:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:20:22] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-22 23:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:20:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 23:20:22] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 11 ms returned sat
[2023-03-22 23:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:20:23] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-22 23:20:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:20:23] [INFO ] [Nat]Added 112 Read/Feed constraints in 553 ms returned sat
[2023-03-22 23:20:23] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 0 ms to minimize.
[2023-03-22 23:20:24] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 1 ms to minimize.
[2023-03-22 23:20:24] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 0 ms to minimize.
[2023-03-22 23:20:24] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2023-03-22 23:20:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1044 ms
[2023-03-22 23:20:24] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 60 ms.
[2023-03-22 23:20:25] [INFO ] Added : 69 causal constraints over 14 iterations in 1145 ms. Result :sat
Minimization took 1079 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 23:20:27] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:27] [INFO ] Invariant cache hit.
[2023-03-22 23:20:28] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-22 23:20:28] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:28] [INFO ] Invariant cache hit.
[2023-03-22 23:20:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 23:20:33] [INFO ] Implicit Places using invariants and state equation in 4734 ms returned []
Implicit Place search using SMT with State Equation took 5274 ms to find 0 implicit places.
[2023-03-22 23:20:33] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 23:20:33] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 23:20:33] [INFO ] Invariant cache hit.
[2023-03-22 23:20:33] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5757 ms. Remains : 300/300 places, 858/858 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13 in 24838 ms.
[2023-03-22 23:20:33] [INFO ] Flatten gal took : 206 ms
[2023-03-22 23:20:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-22 23:20:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 858 transitions and 5294 arcs took 11 ms.
Total runtime 81722 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/797/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14727776 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093032 kB

BK_TIME_CONFINEMENT_REACHED

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

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="PolyORBLF-COL-S06J04T04"
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 PolyORBLF-COL-S06J04T04, 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-167873950500445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 ;