About the Execution of Smart+red for PolyORBLF-COL-S04J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
306.680 | 10098.00 | 18099.00 | 264.60 | 4 1 9 1 1 1 10 4 4 4 3 1 2 1 10 4 | 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.r299-tall-167873953000437.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 smartxred
Input is PolyORBLF-COL-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953000437
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.9K Feb 26 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K 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.5K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:19 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-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679489691875
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 12:54:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 12:54:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:54:53] [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 12:54:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 12:54:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 664 ms
[2023-03-22 12:54:54] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 966 PT places and 5456.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 12:54:54] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-22 12:54:54] [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 12:54:54] [INFO ] Computed 26 place invariants in 11 ms
[2023-03-22 12:54:54] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 12:54:54] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 16 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 12:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 12:54:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 12:54:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-22 12:54:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 12:54:54] [INFO ] Added : 10 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 12:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:54] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 12:54:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 12:54:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
[2023-03-22 12:54:54] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2023-03-22 12:54:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-22 12:54:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2023-03-22 12:54:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-22 12:54:55] [INFO ] Added : 57 causal constraints over 12 iterations in 205 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 12:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 3 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 12:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2023-03-22 12:54:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 12:54:55] [INFO ] Added : 61 causal constraints over 14 iterations in 130 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 12:54:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 12:54:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 12:54:55] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-22 12:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 12:54:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:54:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-22 12:54:56] [INFO ] Added : 59 causal constraints over 12 iterations in 149 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 12:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-22 12:54:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 12:54:56] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2023-03-22 12:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-22 12:54:56] [INFO ] Added : 34 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 12:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-22 12:54:56] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2023-03-22 12:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 12:54:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:54:56] [INFO ] Added : 42 causal constraints over 10 iterations in 93 ms. Result :sat
Minimization took 99 ms.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 12:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 12:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 12:54:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:54:57] [INFO ] Added : 3 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 12:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 12:54:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:54:57] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 12:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-22 12:54:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 12:54:57] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 77 ms.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 12:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 12:54:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:54:57] [INFO ] Added : 58 causal constraints over 12 iterations in 91 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 12:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:54:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 277 ms
[2023-03-22 12:54:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:54:58] [INFO ] Added : 60 causal constraints over 13 iterations in 91 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 12:54:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:54:58] [INFO ] Added : 61 causal constraints over 13 iterations in 111 ms. Result :sat
Minimization took 95 ms.
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 12:54:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 12:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:59] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 12:54:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 12:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-22 12:54:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 12:54:59] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2023-03-22 12:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 12:54:59] [INFO ] Added : 55 causal constraints over 12 iterations in 149 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 12:54:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 12:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:54:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:54:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 12:54:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 12:54:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 12:54:59] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [4, 10, 9, 10, 4, 1, 10, 4, 4, 30, 3, 10, 2, 1, 11, 4]
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-02 9 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 12:54:59] [INFO ] Unfolded HLPN to a Petri net with 966 places and 5354 transitions 36134 arcs in 92 ms.
[2023-03-22 12:54:59] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :45
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :26
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :17
[2023-03-22 12:54:59] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2023-03-22 12:55:00] [INFO ] Computed 62 place invariants in 134 ms
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 41 ms returned unsat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 76 ms returned unsat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 41 ms returned unsat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 21 ms returned unsat
[2023-03-22 12:55:00] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-22 12:55:01] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 43 ms returned unsat
[2023-03-22 12:55:01] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-22 12:55:01] [INFO ] [Real]Absence check using 14 positive and 48 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 1, 10] Max seen :[1, 1, 1, 4, 1, 10]
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7851 ms.
ITS solved all properties within timeout
BK_STOP 1679489701973
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBLF-COL-S04J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBLF-COL-S04J06T10, 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 r299-tall-167873953000437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T10.tgz
mv PolyORBLF-COL-S04J06T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;