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-167873945400389.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-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945400389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 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-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678844975038

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-S02J06T10
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-15 01:49:36] [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 01:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:49:36] [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 01:49:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 01:49:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2023-03-15 01:49:37] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 01:49:37] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-15 01:49:37] [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 01:49:37] [INFO ] Computed 26 place invariants in 16 ms
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 01:49:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 01:49:37] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 01:49:37] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-15 01:49:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:37] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-15 01:49:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 01:49:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 01:49:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
[2023-03-15 01:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 01:49:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 01:49:37] [INFO ] Added : 22 causal constraints over 5 iterations in 72 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 01:49:37] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-15 01:49:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-15 01:49:38] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2023-03-15 01:49:38] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2023-03-15 01:49:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2023-03-15 01:49:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 01:49:38] [INFO ] Added : 57 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 01:49:38] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2023-03-15 01:49:38] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2023-03-15 01:49:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-15 01:49:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 01:49:38] [INFO ] Added : 57 causal constraints over 12 iterations in 101 ms. Result :sat
Minimization took 31 ms.
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 01:49:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-15 01:49:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 01:49:39] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2023-03-15 01:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-15 01:49:39] [INFO ] Added : 57 causal constraints over 12 iterations in 161 ms. Result :sat
Minimization took 36 ms.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 01:49:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 01:49:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 01:49:39] [INFO ] Added : 58 causal constraints over 12 iterations in 97 ms. Result :sat
Minimization took 32 ms.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 01:49:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2023-03-15 01:49:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 01:49:39] [INFO ] Added : 24 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 41 ms.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 01:49:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-15 01:49:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 01:49:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:39] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-15 01:49:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 01:49:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-15 01:49:40] [INFO ] Added : 44 causal constraints over 10 iterations in 117 ms. Result :sat
Minimization took 31 ms.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 01:49:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-15 01:49:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2023-03-15 01:49:40] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2023-03-15 01:49:40] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2023-03-15 01:49:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2023-03-15 01:49:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 01:49:40] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2023-03-15 01:49:40] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-03-15 01:49:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-15 01:49:40] [INFO ] Added : 44 causal constraints over 9 iterations in 187 ms. Result :sat
Minimization took 48 ms.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 01:49:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 01:49:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 01:49:40] [INFO ] Added : 10 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 01:49:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:40] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-15 01:49:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 01:49:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 01:49:41] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 01:49:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 01:49:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2023-03-15 01:49:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 01:49:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-15 01:49:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 01:49:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2023-03-15 01:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-15 01:49:41] [INFO ] Added : 24 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 01:49:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:41] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-15 01:49:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-15 01:49:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 01:49:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2023-03-15 01:49:41] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2023-03-15 01:49:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-15 01:49:41] [INFO ] Added : 61 causal constraints over 15 iterations in 218 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 2, 2, 3, 30, 9, 172, 10, 10, 2, 9, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 9 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 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-15 01:49:41] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 38 ms.
[2023-03-15 01:49:41] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :18
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :20
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :12
[2023-03-15 01:49:42] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2023-03-15 01:49:42] [INFO ] Computed 58 place invariants in 78 ms
[2023-03-15 01:49:42] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:42] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned unsat
[2023-03-15 01:49:42] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:42] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned sat
[2023-03-15 01:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:43] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2023-03-15 01:49:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:43] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 41 ms returned sat
[2023-03-15 01:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:44] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-15 01:49:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 01:49:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 1182 ms returned sat
[2023-03-15 01:49:45] [INFO ] Deduced a trap composed of 99 places in 342 ms of which 1 ms to minimize.
[2023-03-15 01:49:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 392 ms
[2023-03-15 01:49:45] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:45] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned sat
[2023-03-15 01:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:46] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-15 01:49:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:46] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 47 ms returned unsat
[2023-03-15 01:49:46] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:46] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 34 ms returned sat
[2023-03-15 01:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:47] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2023-03-15 01:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:49:47] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned sat
[2023-03-15 01:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:48] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2023-03-15 01:49:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:49:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 3432 ms returned sat
[2023-03-15 01:49:52] [INFO ] Deduced a trap composed of 442 places in 355 ms of which 1 ms to minimize.
[2023-03-15 01:49:52] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 636 ms
[2023-03-15 01:49:52] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-15 01:49:52] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 34 ms returned sat
[2023-03-15 01:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:53] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2023-03-15 01:49:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:49:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-15 01:49:53] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 30 ms returned sat
[2023-03-15 01:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:54] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-15 01:49:55] [INFO ] [Nat]Added 120 Read/Feed constraints in 1134 ms returned sat
[2023-03-15 01:49:55] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 129 ms.
[2023-03-15 01:49:57] [INFO ] Deduced a trap composed of 463 places in 372 ms of which 1 ms to minimize.
[2023-03-15 01:49:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 675 ms
[2023-03-15 01:49:57] [INFO ] Added : 55 causal constraints over 11 iterations in 2246 ms. Result :sat
Minimization took 976 ms.
[2023-03-15 01:49:58] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 01:49:58] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 26 ms returned unsat
[2023-03-15 01:49:58] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 01:49:58] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned sat
[2023-03-15 01:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:49:59] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2023-03-15 01:49:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:50:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-15 01:50:00] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned sat
[2023-03-15 01:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:50:00] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2023-03-15 01:50:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 1820 ms returned sat
[2023-03-15 01:50:02] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 101 ms.
[2023-03-15 01:50:05] [INFO ] Deduced a trap composed of 434 places in 373 ms of which 1 ms to minimize.
[2023-03-15 01:50:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 01:50:05] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 01:50:05] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 25 ms returned unsat
[2023-03-15 01:50:05] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 01:50:05] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 3, 30, 2, 10, 1, 1] Max seen :[1, 1, 1, 0, 2, 2, 4, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 30 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 14 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 522 place count 582 transition count 1392
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 542 place count 582 transition count 1372
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 562 place count 562 transition count 1372
Applied a total of 562 rules in 239 ms. Remains 562 /844 variables (removed 282) and now considering 1372/1652 (removed 280) transitions.
[2023-03-15 01:50:05] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 562 cols
[2023-03-15 01:50:05] [INFO ] Computed 56 place invariants in 34 ms
[2023-03-15 01:50:06] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/844 places, 1262/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 560 transition count 1242
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 550 transition count 1222
Deduced a syphon composed of 10 places in 2 ms
Applied a total of 12 rules in 43 ms. Remains 550 /562 variables (removed 12) and now considering 1222/1262 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 881 ms. Remains : 550/844 places, 1222/1652 transitions.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1202 out of 1222 initially.
// Phase 1: matrix 1202 rows 540 cols
[2023-03-15 01:50:06] [INFO ] Computed 56 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 349 resets, run finished after 3617 ms. (steps per millisecond=276 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 96 resets, run finished after 1556 ms. (steps per millisecond=642 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1501 ms. (steps per millisecond=666 ) properties (out of 2) seen :11
[2023-03-15 01:50:13] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 540 cols
[2023-03-15 01:50:13] [INFO ] Computed 56 place invariants in 23 ms
[2023-03-15 01:50:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:50:13] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 15 ms returned unsat
[2023-03-15 01:50:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:50:13] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 19 ms returned sat
[2023-03-15 01:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:50:13] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-15 01:50:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:50:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-15 01:50:14] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 18 ms returned sat
[2023-03-15 01:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:50:14] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-15 01:50:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 01:50:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 511 ms returned sat
[2023-03-15 01:50:15] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2023-03-15 01:50:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 247 ms
Current structural bounds on expressions (after SMT) : [2, 9, 10] Max seen :[2, 9, 4]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38402 ms.

BK_STOP 1678845019468

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../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-S02J06T10"
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-S02J06T10, 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-167873945400389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;