About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.911 | 3600000.00 | 2562029.00 | 742361.80 | 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.r293-tall-167873945400445.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 itstools
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 r293-tall-167873945400445
=====================================================================
--------------------
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 1678862753668
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-15 06:45:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 06:45:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 06:45:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 06:45:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 06:45:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 519 ms
[2023-03-15 06:45:55] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 06:45:55] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-15 06:45:55] [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-15 06:45:55] [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-15 06:45:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 06:45:56] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-15 06:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-15 06:45:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 06:45:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 06:45:56] [INFO ] Added : 3 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 06:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 06:45:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 06:45:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 3 ms to minimize.
[2023-03-15 06:45:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-15 06:45:56] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2023-03-15 06:45:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-15 06:45:56] [INFO ] Added : 57 causal constraints over 12 iterations in 418 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 06:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 26 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 06:45:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 06:45:57] [INFO ] Added : 12 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 06:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 27 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 06:45:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 06:45:57] [INFO ] Added : 27 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 101 ms.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 06:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 06:45:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 06:45:57] [INFO ] Added : 60 causal constraints over 12 iterations in 100 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 06:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:57] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 06:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-15 06:45:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 06:45:57] [INFO ] Added : 28 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 06:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 20 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-15 06:45:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 06:45:58] [INFO ] Added : 10 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 06:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 0 ms returned sat
[2023-03-15 06:45:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 06:45:58] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 06:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-15 06:45:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 06:45:58] [INFO ] Added : 60 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 25 ms.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 06:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 06:45:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 06:45:58] [INFO ] Added : 5 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 06:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:58] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-15 06:45:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-15 06:45:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 06:45:59] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2023-03-15 06:45:59] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2023-03-15 06:45:59] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2023-03-15 06:45:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 108 ms
[2023-03-15 06:45:59] [INFO ] Added : 59 causal constraints over 14 iterations in 248 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 06:45:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2023-03-15 06:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-15 06:45:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 06:45:59] [INFO ] Added : 23 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 40 ms.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 06:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-15 06:45:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 06:45:59] [INFO ] Added : 10 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 17 ms.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 06:45:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:45:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 06:45:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2023-03-15 06:45:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 06:45:59] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2023-03-15 06:46:00] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2023-03-15 06:46:00] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2023-03-15 06:46:00] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
[2023-03-15 06:46:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2023-03-15 06:46:00] [INFO ] Added : 57 causal constraints over 12 iterations in 245 ms. Result :sat
Minimization took 19 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-15 06:46:00] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 122 ms.
[2023-03-15 06:46:00] [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 49 resets, run finished after 77 ms. (steps per millisecond=129 ) 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 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :26
[2023-03-15 06:46:00] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2023-03-15 06:46:00] [INFO ] Computed 50 place invariants in 64 ms
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-15 06:46:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-15 06:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:01] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-15 06:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-15 06:46:02] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2023-03-15 06:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:02] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-15 06:46:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 1905 ms returned sat
[2023-03-15 06:46:04] [INFO ] Deduced a trap composed of 190 places in 314 ms of which 0 ms to minimize.
[2023-03-15 06:46:06] [INFO ] Deduced a trap composed of 85 places in 314 ms of which 1 ms to minimize.
[2023-03-15 06:46:06] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 0 ms to minimize.
[2023-03-15 06:46:06] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2620 ms
[2023-03-15 06:46:06] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:07] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2023-03-15 06:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:07] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-15 06:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-15 06:46:07] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2023-03-15 06:46:07] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:07] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 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 232 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
[2023-03-15 06:46:08] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2023-03-15 06:46:08] [INFO ] Computed 44 place invariants in 42 ms
[2023-03-15 06:46:08] [INFO ] Dead Transitions using invariants and state equation in 630 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 20 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 884 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-15 06:46:08] [INFO ] Computed 44 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 10933 resets, run finished after 3848 ms. (steps per millisecond=259 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 408 resets, run finished after 1859 ms. (steps per millisecond=537 ) properties (out of 1) seen :2
[2023-03-15 06:46:14] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 308 cols
[2023-03-15 06:46:14] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 06:46:14] [INFO ] [Real]Absence check using 17 positive place invariants in 155 ms returned sat
[2023-03-15 06:46:14] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-15 06:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:15] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-15 06:46:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-15 06:46:15] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-15 06:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:15] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-03-15 06:46:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 760 ms returned sat
[2023-03-15 06:46:16] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 0 ms to minimize.
[2023-03-15 06:46:16] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 0 ms to minimize.
[2023-03-15 06:46:16] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2023-03-15 06:46:17] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2023-03-15 06:46:17] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 0 ms to minimize.
[2023-03-15 06:46:17] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 0 ms to minimize.
[2023-03-15 06:46:17] [INFO ] Deduced a trap composed of 126 places in 181 ms of which 0 ms to minimize.
[2023-03-15 06:46:18] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 1 ms to minimize.
[2023-03-15 06:46:18] [INFO ] Deduced a trap composed of 152 places in 193 ms of which 0 ms to minimize.
[2023-03-15 06:46:18] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 0 ms to minimize.
[2023-03-15 06:46:19] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 1 ms to minimize.
[2023-03-15 06:46:19] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2023-03-15 06:46:19] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 1 ms to minimize.
[2023-03-15 06:46:20] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 0 ms to minimize.
[2023-03-15 06:46:20] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 1 ms to minimize.
[2023-03-15 06:46:20] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 0 ms to minimize.
[2023-03-15 06:46:20] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 1 ms to minimize.
[2023-03-15 06:46:22] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 1 ms to minimize.
[2023-03-15 06:46:25] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 9113 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 28 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 28 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-15 06:46:25] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
[2023-03-15 06:46:25] [INFO ] Invariant cache hit.
[2023-03-15 06:46:25] [INFO ] Implicit Places using invariants in 300 ms returned [262, 263, 264, 265]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 303 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-15 06:46:25] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-15 06:46:25] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-15 06:46:26] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-15 06:46:26] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:46:26] [INFO ] Invariant cache hit.
[2023-03-15 06:46:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:30] [INFO ] Implicit Places using invariants and state equation in 4608 ms returned []
Implicit Place search using SMT with State Equation took 4962 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 5309 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-15 06:46:30] [INFO ] Computed 40 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 11066 resets, run finished after 3762 ms. (steps per millisecond=265 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 473 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 1) seen :2
[2023-03-15 06:46:36] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-15 06:46:36] [INFO ] Computed 40 place invariants in 16 ms
[2023-03-15 06:46:36] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 06:46:36] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-15 06:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:36] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-15 06:46:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 06:46:36] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 19 ms returned sat
[2023-03-15 06:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:37] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-15 06:46:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:37] [INFO ] [Nat]Added 112 Read/Feed constraints in 531 ms returned sat
[2023-03-15 06:46:37] [INFO ] Deduced a trap composed of 127 places in 179 ms of which 0 ms to minimize.
[2023-03-15 06:46:37] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 1 ms to minimize.
[2023-03-15 06:46:38] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
[2023-03-15 06:46:38] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-15 06:46:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 947 ms
[2023-03-15 06:46:38] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 64 ms.
[2023-03-15 06:46:39] [INFO ] Added : 69 causal constraints over 14 iterations in 1098 ms. Result :sat
Minimization took 1047 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 15 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 15 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-15 06:46:41] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:46:41] [INFO ] Invariant cache hit.
[2023-03-15 06:46:41] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-15 06:46:41] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:46:41] [INFO ] Invariant cache hit.
[2023-03-15 06:46:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:44] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 3322 ms to find 0 implicit places.
[2023-03-15 06:46:44] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-15 06:46:44] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:46:44] [INFO ] Invariant cache hit.
[2023-03-15 06:46:45] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3756 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-15 06:46:45] [INFO ] Computed 40 place invariants in 14 ms
Incomplete random walk after 10002 steps, including 113 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :2
[2023-03-15 06:46:45] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-15 06:46:45] [INFO ] Computed 40 place invariants in 17 ms
[2023-03-15 06:46:45] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 06:46:45] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-15 06:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:45] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-15 06:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 06:46:45] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 10 ms returned sat
[2023-03-15 06:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:45] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-15 06:46:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 540 ms returned sat
[2023-03-15 06:46:46] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 0 ms to minimize.
[2023-03-15 06:46:46] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 0 ms to minimize.
[2023-03-15 06:46:46] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 1 ms to minimize.
[2023-03-15 06:46:47] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2023-03-15 06:46:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 947 ms
[2023-03-15 06:46:47] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 46 ms.
[2023-03-15 06:46:48] [INFO ] Added : 69 causal constraints over 14 iterations in 1114 ms. Result :sat
Minimization took 1081 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.
[2023-03-15 06:46:50] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:46:50] [INFO ] Invariant cache hit.
[2023-03-15 06:46:50] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 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-15 06:46:50] [INFO ] Computed 40 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 10812 resets, run finished after 3803 ms. (steps per millisecond=262 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 430 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties (out of 1) seen :2
[2023-03-15 06:46:56] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-15 06:46:56] [INFO ] Computed 40 place invariants in 14 ms
[2023-03-15 06:46:56] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 06:46:56] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 14 ms returned sat
[2023-03-15 06:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:56] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-15 06:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 06:46:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 06:46:56] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 11 ms returned sat
[2023-03-15 06:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 06:46:57] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-15 06:46:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:46:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 545 ms returned sat
[2023-03-15 06:46:57] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 0 ms to minimize.
[2023-03-15 06:46:57] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 0 ms to minimize.
[2023-03-15 06:46:58] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 0 ms to minimize.
[2023-03-15 06:46:58] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-15 06:46:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 943 ms
[2023-03-15 06:46:58] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 49 ms.
[2023-03-15 06:46:59] [INFO ] Added : 69 causal constraints over 14 iterations in 1132 ms. Result :sat
Minimization took 1106 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 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 13 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-15 06:47:01] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:47:01] [INFO ] Invariant cache hit.
[2023-03-15 06:47:01] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-15 06:47:01] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:47:01] [INFO ] Invariant cache hit.
[2023-03-15 06:47:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 06:47:05] [INFO ] Implicit Places using invariants and state equation in 3282 ms returned []
Implicit Place search using SMT with State Equation took 3709 ms to find 0 implicit places.
[2023-03-15 06:47:05] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 06:47:05] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-15 06:47:05] [INFO ] Invariant cache hit.
[2023-03-15 06:47:05] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4106 ms. Remains : 300/300 places, 858/858 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13 in 20463 ms.
[2023-03-15 06:47:05] [INFO ] Flatten gal took : 124 ms
[2023-03-15 06:47:05] [INFO ] Applying decomposition
[2023-03-15 06:47:05] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7280498868699923698.txt' '-o' '/tmp/graph7280498868699923698.bin' '-w' '/tmp/graph7280498868699923698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7280498868699923698.bin' '-l' '-1' '-v' '-w' '/tmp/graph7280498868699923698.weights' '-q' '0' '-e' '0.001'
[2023-03-15 06:47:06] [INFO ] Decomposing Gal with order
[2023-03-15 06:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 06:47:06] [INFO ] Removed a total of 607 redundant transitions.
[2023-03-15 06:47:06] [INFO ] Flatten gal took : 208 ms
[2023-03-15 06:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 36 ms.
[2023-03-15 06:47:06] [INFO ] Time to serialize gal into /tmp/UpperBounds1279001110029312379.gal : 17 ms
[2023-03-15 06:47:06] [INFO ] Time to serialize properties into /tmp/UpperBounds7433752996736280725.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1279001110029312379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7433752996736280725.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds7433752996736280725.prop.
Detected timeout of ITS tools.
[2023-03-15 07:07:52] [INFO ] Applying decomposition
[2023-03-15 07:07:52] [INFO ] Flatten gal took : 274 ms
[2023-03-15 07:07:52] [INFO ] Decomposing Gal with order
[2023-03-15 07:07:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:07:53] [INFO ] Removed a total of 4201 redundant transitions.
[2023-03-15 07:07:53] [INFO ] Flatten gal took : 253 ms
[2023-03-15 07:07:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 58 ms.
[2023-03-15 07:07:53] [INFO ] Time to serialize gal into /tmp/UpperBounds5701532034118679333.gal : 60 ms
[2023-03-15 07:07:53] [INFO ] Time to serialize properties into /tmp/UpperBounds2755942798327559319.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5701532034118679333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2755942798327559319.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds2755942798327559319.prop.
Detected timeout of ITS tools.
[2023-03-15 07:28:39] [INFO ] Flatten gal took : 754 ms
[2023-03-15 07:28:41] [INFO ] Input system was already deterministic with 858 transitions.
[2023-03-15 07:28:41] [INFO ] Transformed 300 places.
[2023-03-15 07:28:41] [INFO ] Transformed 858 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 07:29:11] [INFO ] Time to serialize gal into /tmp/UpperBounds8516485959983867389.gal : 34 ms
[2023-03-15 07:29:11] [INFO ] Time to serialize properties into /tmp/UpperBounds17193243369583319511.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8516485959983867389.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17193243369583319511.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17193243369583319511.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 144252 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11983552 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r293-tall-167873945400445"
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 '
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 ;