Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080200381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SafeBus-COL-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080200381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 SafeBus-COL-15-UpperBounds-00
FORMULA_NAME SafeBus-COL-15-UpperBounds-01
FORMULA_NAME SafeBus-COL-15-UpperBounds-02
FORMULA_NAME SafeBus-COL-15-UpperBounds-03
FORMULA_NAME SafeBus-COL-15-UpperBounds-04
FORMULA_NAME SafeBus-COL-15-UpperBounds-05
FORMULA_NAME SafeBus-COL-15-UpperBounds-06
FORMULA_NAME SafeBus-COL-15-UpperBounds-07
FORMULA_NAME SafeBus-COL-15-UpperBounds-08
FORMULA_NAME SafeBus-COL-15-UpperBounds-09
FORMULA_NAME SafeBus-COL-15-UpperBounds-10
FORMULA_NAME SafeBus-COL-15-UpperBounds-11
FORMULA_NAME SafeBus-COL-15-UpperBounds-12
FORMULA_NAME SafeBus-COL-15-UpperBounds-13
FORMULA_NAME SafeBus-COL-15-UpperBounds-14
FORMULA_NAME SafeBus-COL-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717222753076

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:19:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:19:14] [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.
[2024-06-01 06:19:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:19:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2024-06-01 06:19:14] [INFO ] Detected 1 constant HL places corresponding to 15 PT places.
[2024-06-01 06:19:15] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 636 PT places and 59206.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-06-01 06:19:15] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-06-01 06:19:15] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 06:19:15] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 15, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0] Max Struct:[15, 15, 1, 1, 5, 1, 1, 15, 15, 1, 15, 1, 1, 3, 1, 1]
FORMULA SafeBus-COL-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-15-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 06:19:15] [INFO ] Invariant cache hit.
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:19:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:19:15] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:19:15] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 06:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 06:19:15] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 36 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:15] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 06:19:15] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:15] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 06:19:15] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 06:19:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:15] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:15] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 06:19:16] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 06:19:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 06:19:16] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 06:19:16] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
Domain [It(15), It(15)] of place AMC breaks symmetries in sort It
[2024-06-01 06:19:16] [INFO ] Unfolded HLPN to a Petri net with 636 places and 4801 transitions 34264 arcs in 100 ms.
[2024-06-01 06:19:16] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 30 places and 30 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
[2024-06-01 06:19:16] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-06-01 06:19:16] [INFO ] Computed 65 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 5, 1, 15, 15, 1, 15, 1, 3, 1]
RANDOM walk for 10000 steps (2 resets) in 353 ms. (28 steps per ms)
FORMULA SafeBus-COL-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-08 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 1, 14, 1] Max Struct:[15, 5, 15, 3]
[2024-06-01 06:19:17] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:19:17] [INFO ] Invariant cache hit.
[2024-06-01 06:19:17] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-06-01 06:19:17] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 17 ms returned sat
[2024-06-01 06:19:18] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-06-01 06:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-06-01 06:19:18] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2024-06-01 06:19:18] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-06-01 06:19:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:19:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:19:19] [INFO ] [Nat]Added 241 Read/Feed constraints in 1059 ms returned unknown
[2024-06-01 06:19:19] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-06-01 06:19:19] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned unsat
[2024-06-01 06:19:19] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-06-01 06:19:19] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-06-01 06:19:20] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-06-01 06:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-06-01 06:19:20] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 16 ms returned sat
[2024-06-01 06:19:20] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-06-01 06:19:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:19:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 1067 ms returned unknown
[2024-06-01 06:19:21] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-06-01 06:19:21] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[8, 1, 14, 1] Max Struct:[15, 1, 15, 1]
FORMULA SafeBus-COL-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 14] Max Struct:[15, 15]
Support contains 30 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1186 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1200 ms. Remains : 606/606 places, 4771/4771 transitions.
[2024-06-01 06:19:23] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:19:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11709 ms. (85 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 4675 ms. (427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14] Max Struct:[15, 15]
[2024-06-01 06:19:39] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:19:39] [INFO ] Invariant cache hit.
[2024-06-01 06:19:39] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2024-06-01 06:19:39] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-06-01 06:19:40] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-06-01 06:19:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:19:40] [INFO ] [Real]Added 241 Read/Feed constraints in 288 ms returned sat
[2024-06-01 06:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2024-06-01 06:19:40] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 14 ms returned sat
[2024-06-01 06:19:41] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2024-06-01 06:19:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 1048 ms returned sat
[2024-06-01 06:19:42] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 285 ms.
[2024-06-01 06:19:43] [INFO ] Added : 0 causal constraints over 0 iterations in 417 ms. Result :sat
Minimization took 3208 ms.
[2024-06-01 06:19:46] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-06-01 06:19:46] [INFO ] [Real]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2024-06-01 06:19:46] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-06-01 06:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:19:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2024-06-01 06:19:46] [INFO ] [Nat]Absence check using 31 positive and 34 generalized place invariants in 15 ms returned sat
[2024-06-01 06:19:47] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-06-01 06:19:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 1479 ms returned sat
[2024-06-01 06:19:48] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 198 ms.
[2024-06-01 06:19:49] [INFO ] Added : 0 causal constraints over 0 iterations in 340 ms. Result :sat
Minimization took 3758 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14] Max Struct:[15, 15]
Support contains 30 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 989 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 989 ms. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 987 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-06-01 06:19:55] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:19:55] [INFO ] Invariant cache hit.
[2024-06-01 06:19:57] [INFO ] Implicit Places using invariants in 1318 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1331 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1063 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3387 ms. Remains : 591/606 places, 4771/4771 transitions.
[2024-06-01 06:19:58] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2024-06-01 06:19:58] [INFO ] Computed 50 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11427 ms. (87 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 4199 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14] Max Struct:[15, 15]
[2024-06-01 06:20:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:20:14] [INFO ] Invariant cache hit.
[2024-06-01 06:20:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 06:20:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-06-01 06:20:14] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-06-01 06:20:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:20:14] [INFO ] [Real]Added 241 Read/Feed constraints in 270 ms returned sat
[2024-06-01 06:20:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:20:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 06:20:14] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-06-01 06:20:15] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-06-01 06:20:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 1223 ms returned sat
[2024-06-01 06:20:16] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 160 ms.
[2024-06-01 06:20:16] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 6366 ms.
[2024-06-01 06:20:23] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 06:20:23] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-06-01 06:20:23] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-06-01 06:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:20:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 06:20:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned sat
[2024-06-01 06:20:24] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-06-01 06:20:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 3306 ms returned sat
[2024-06-01 06:20:27] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 176 ms.
[2024-06-01 06:20:28] [INFO ] Added : 0 causal constraints over 0 iterations in 289 ms. Result :sat
Minimization took 6314 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 1024 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 591/591 places, 4771/4771 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4771/4771 transitions.
Applied a total of 0 rules in 1012 ms. Remains 591 /591 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2024-06-01 06:20:36] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:20:36] [INFO ] Invariant cache hit.
[2024-06-01 06:20:37] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-06-01 06:20:37] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:20:37] [INFO ] Invariant cache hit.
[2024-06-01 06:20:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:20:43] [INFO ] Implicit Places using invariants and state equation in 6281 ms returned []
Implicit Place search using SMT with State Equation took 7455 ms to find 0 implicit places.
[2024-06-01 06:20:44] [INFO ] Redundant transitions in 332 ms returned []
Running 4756 sub problems to find dead transitions.
[2024-06-01 06:20:44] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 06:20:44] [INFO ] Invariant cache hit.
[2024-06-01 06:20:44] [INFO ] State equation strengthened by 241 read => feed constraints.
Problem TDEAD211 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2911 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3361 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 timeout
0.0)
(s322 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 15 solved, 4741 unsolved
SMT process timed out in 60723ms, After SMT, problems are : Problem set: 15 solved, 4741 unsolved
Search for dead transitions found 15 dead transitions in 60893ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 591/591 places, 4756/4771 transitions.
Applied a total of 0 rules in 962 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 06:21:46] [INFO ] Redundant transitions in 315 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71027 ms. Remains : 591/591 places, 4756/4771 transitions.
[2024-06-01 06:21:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:21:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12, 14] Max Struct:[15, 15]
RANDOM walk for 1000000 steps (2 resets) in 11162 ms. (89 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 4340 ms. (460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 14] Max Struct:[15, 15]
[2024-06-01 06:22:01] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:22:01] [INFO ] Invariant cache hit.
[2024-06-01 06:22:02] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-06-01 06:22:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2024-06-01 06:22:02] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-06-01 06:22:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:22:02] [INFO ] [Real]Added 241 Read/Feed constraints in 299 ms returned sat
[2024-06-01 06:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:22:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:02] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-06-01 06:22:03] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-06-01 06:22:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 1259 ms returned sat
[2024-06-01 06:22:04] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 180 ms.
[2024-06-01 06:22:05] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 6399 ms.
[2024-06-01 06:22:11] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-06-01 06:22:11] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-06-01 06:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:22:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 06:22:12] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-06-01 06:22:12] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2024-06-01 06:22:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 2297 ms returned sat
[2024-06-01 06:22:15] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 158 ms.
[2024-06-01 06:22:15] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 6381 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 14] Max Struct:[15, 15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 14] Max Struct:[15, 15]
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 929 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 929 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 929 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 06:22:23] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:22:23] [INFO ] Invariant cache hit.
[2024-06-01 06:22:24] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2024-06-01 06:22:24] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:22:24] [INFO ] Invariant cache hit.
[2024-06-01 06:22:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:22:31] [INFO ] Implicit Places using invariants and state equation in 6708 ms returned []
Implicit Place search using SMT with State Equation took 7853 ms to find 0 implicit places.
[2024-06-01 06:22:31] [INFO ] Redundant transitions in 196 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 06:22:31] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:22:31] [INFO ] Invariant cache hit.
[2024-06-01 06:22:31] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 62150ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 62198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71200 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1549 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 101299 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 101299 steps, saw 60099 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 06:23:37] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:23:37] [INFO ] Invariant cache hit.
[2024-06-01 06:23:37] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:23:38] [INFO ] Deduced a trap composed of 46 places in 443 ms of which 32 ms to minimize.
[2024-06-01 06:23:39] [INFO ] Deduced a trap composed of 61 places in 406 ms of which 4 ms to minimize.
[2024-06-01 06:23:39] [INFO ] Deduced a trap composed of 61 places in 394 ms of which 4 ms to minimize.
[2024-06-01 06:23:39] [INFO ] Deduced a trap composed of 61 places in 384 ms of which 4 ms to minimize.
[2024-06-01 06:23:40] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 4 ms to minimize.
[2024-06-01 06:23:40] [INFO ] Deduced a trap composed of 61 places in 386 ms of which 3 ms to minimize.
[2024-06-01 06:23:41] [INFO ] Deduced a trap composed of 61 places in 383 ms of which 4 ms to minimize.
[2024-06-01 06:23:41] [INFO ] Deduced a trap composed of 61 places in 357 ms of which 4 ms to minimize.
[2024-06-01 06:23:41] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 4 ms to minimize.
[2024-06-01 06:23:42] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 3 ms to minimize.
[2024-06-01 06:23:42] [INFO ] Deduced a trap composed of 359 places in 347 ms of which 3 ms to minimize.
[2024-06-01 06:23:42] [INFO ] Deduced a trap composed of 302 places in 351 ms of which 3 ms to minimize.
SMT process timed out in 5189ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 977 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 591/591 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 747 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 121386 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 121386 steps, saw 71012 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 06:23:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:23:47] [INFO ] Invariant cache hit.
[2024-06-01 06:23:47] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 46 places in 397 ms of which 4 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 61 places in 382 ms of which 3 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 61 places in 408 ms of which 4 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 3 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 4 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 4 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 61 places in 382 ms of which 4 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 61 places in 375 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 61 places in 364 ms of which 5 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 61 places in 384 ms of which 4 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 359 places in 326 ms of which 3 ms to minimize.
[2024-06-01 06:23:52] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 12/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 58/588 variables, 31/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/589 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1411/2000 variables, 589/650 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2000 variables, 240/890 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2000 variables, 0/890 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/2003 variables, 2/892 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2003 variables, 1/893 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 1/894 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2003 variables, 0/894 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2003 variables, 0/894 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 894 constraints, problems are : Problem set: 1 solved, 3 unsolved in 6857 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 499/529 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 12/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 06:23:54] [INFO ] Deduced a trap composed of 61 places in 366 ms of which 3 ms to minimize.
[2024-06-01 06:23:55] [INFO ] Deduced a trap composed of 61 places in 376 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 06:23:55] [INFO ] Deduced a trap composed of 321 places in 303 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/530 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 58/588 variables, 31/63 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/589 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1411/2000 variables, 589/653 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2000 variables, 240/893 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/2000 variables, 3/896 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2000 variables, 0/896 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/2003 variables, 2/898 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/899 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 1/900 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2003 variables, 0/900 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2003 variables, 0/900 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 900 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 591/591 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 9980ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 574 ms.
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4741
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4741
Applied a total of 30 rules in 976 ms. Remains 576 /591 variables (removed 15) and now considering 4741/4756 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 977 ms. Remains : 576/591 places, 4741/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 163351 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 163351 steps, saw 103742 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 06:24:02] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-06-01 06:24:02] [INFO ] Computed 50 invariants in 23 ms
[2024-06-01 06:24:02] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/529 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/573 variables, 30/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:24:02] [INFO ] Deduced a trap composed of 74 places in 567 ms of which 4 ms to minimize.
[2024-06-01 06:24:03] [INFO ] Deduced a trap composed of 72 places in 625 ms of which 3 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 70 places in 618 ms of which 3 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 72 places in 619 ms of which 3 ms to minimize.
[2024-06-01 06:24:05] [INFO ] Deduced a trap composed of 87 places in 615 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1396/1970 variables, 574/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 240/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1973 variables, 2/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1973 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1973 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4324 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 513/528 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 3 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 46 places in 381 ms of which 4 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 7 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 327 places in 356 ms of which 3 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 327 places in 338 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/573 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:24:09] [INFO ] Deduced a trap composed of 101 places in 591 ms of which 3 ms to minimize.
[2024-06-01 06:24:09] [INFO ] Deduced a trap composed of 93 places in 573 ms of which 3 ms to minimize.
[2024-06-01 06:24:10] [INFO ] Deduced a trap composed of 99 places in 565 ms of which 3 ms to minimize.
[2024-06-01 06:24:11] [INFO ] Deduced a trap composed of 103 places in 587 ms of which 4 ms to minimize.
[2024-06-01 06:24:11] [INFO ] Deduced a trap composed of 102 places in 613 ms of which 3 ms to minimize.
[2024-06-01 06:24:12] [INFO ] Deduced a trap composed of 105 places in 587 ms of which 4 ms to minimize.
[2024-06-01 06:24:12] [INFO ] Deduced a trap composed of 102 places in 606 ms of which 3 ms to minimize.
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 103 places in 647 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/574 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1396/1970 variables, 574/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 240/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1973 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1973 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8117 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 12513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 690 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 1006 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1006 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 1028 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-06-01 06:24:17] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:24:17] [INFO ] Invariant cache hit.
[2024-06-01 06:24:18] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-06-01 06:24:18] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:24:18] [INFO ] Invariant cache hit.
[2024-06-01 06:24:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:24:24] [INFO ] Implicit Places using invariants and state equation in 5755 ms returned []
Implicit Place search using SMT with State Equation took 6877 ms to find 0 implicit places.
[2024-06-01 06:24:24] [INFO ] Redundant transitions in 188 ms returned []
Running 4726 sub problems to find dead transitions.
[2024-06-01 06:24:24] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:24:24] [INFO ] Invariant cache hit.
[2024-06-01 06:24:24] [INFO ] State equation strengthened by 241 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4726 unsolved
SMT process timed out in 61656ms, After SMT, problems are : Problem set: 0 solved, 4726 unsolved
Search for dead transitions found 0 dead transitions in 61708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69821 ms. Remains : 576/576 places, 4741/4741 transitions.
FORMULA SafeBus-COL-15-UpperBounds-10 14 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[12] Max Struct:[15]
Starting property specific reduction for SafeBus-COL-15-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2024-06-01 06:25:26] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2024-06-01 06:25:26] [INFO ] Computed 50 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 128 ms. (77 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[15]
[2024-06-01 06:25:26] [INFO ] Flow matrix only has 1412 transitions (discarded 3344 similar events)
[2024-06-01 06:25:26] [INFO ] Invariant cache hit.
[2024-06-01 06:25:26] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 06:25:26] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2024-06-01 06:25:26] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-06-01 06:25:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:25:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 06:25:26] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-06-01 06:25:27] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-06-01 06:25:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:25:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 06:25:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 1004 ms returned sat
[2024-06-01 06:25:29] [INFO ] Deduced a trap composed of 74 places in 716 ms of which 116 ms to minimize.
[2024-06-01 06:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 801 ms
[2024-06-01 06:25:29] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 151 ms.
[2024-06-01 06:25:29] [INFO ] Added : 0 causal constraints over 0 iterations in 263 ms. Result :sat
Minimization took 555 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4741
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4741
Applied a total of 30 rules in 971 ms. Remains 576 /591 variables (removed 15) and now considering 4741/4756 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 576/591 places, 4741/4756 transitions.
[2024-06-01 06:25:31] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-06-01 06:25:31] [INFO ] Computed 50 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 12374 ms. (80 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2381 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-06-01 06:25:45] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:25:45] [INFO ] Invariant cache hit.
[2024-06-01 06:25:46] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-06-01 06:25:46] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 11 ms returned sat
[2024-06-01 06:25:46] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-06-01 06:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:25:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-06-01 06:25:46] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 10 ms returned sat
[2024-06-01 06:25:47] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-06-01 06:25:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:25:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 974 ms returned sat
[2024-06-01 06:25:48] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 142 ms.
[2024-06-01 06:25:48] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Minimization took 5236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 919 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 919 ms. Remains : 576/576 places, 4741/4741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4741/4741 transitions.
Applied a total of 0 rules in 904 ms. Remains 576 /576 variables (removed 0) and now considering 4741/4741 (removed 0) transitions.
[2024-06-01 06:25:55] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:25:55] [INFO ] Invariant cache hit.
[2024-06-01 06:25:56] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2024-06-01 06:25:56] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:25:56] [INFO ] Invariant cache hit.
[2024-06-01 06:25:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:26:02] [INFO ] Implicit Places using invariants and state equation in 5766 ms returned []
Implicit Place search using SMT with State Equation took 6870 ms to find 0 implicit places.
[2024-06-01 06:26:02] [INFO ] Redundant transitions in 199 ms returned []
Running 4726 sub problems to find dead transitions.
[2024-06-01 06:26:02] [INFO ] Flow matrix only has 1397 transitions (discarded 3344 similar events)
[2024-06-01 06:26:02] [INFO ] Invariant cache hit.
[2024-06-01 06:26:02] [INFO ] State equation strengthened by 241 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-00
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-01
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-02
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-03
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-04
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-05
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-06
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-07
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-08
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-09
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-10
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-11
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-12
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-13
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-14
Could not compute solution for formula : SafeBus-COL-15-UpperBounds-15

BK_STOP 1717223184377

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SafeBus-COL-15-UpperBounds-00
ub formula formula --maxsum=/tmp/877/ub_0_
ub formula name SafeBus-COL-15-UpperBounds-01
ub formula formula --maxsum=/tmp/877/ub_1_
ub formula name SafeBus-COL-15-UpperBounds-02
ub formula formula --maxsum=/tmp/877/ub_2_
ub formula name SafeBus-COL-15-UpperBounds-03
ub formula formula --maxsum=/tmp/877/ub_3_
ub formula name SafeBus-COL-15-UpperBounds-04
ub formula formula --maxsum=/tmp/877/ub_4_
ub formula name SafeBus-COL-15-UpperBounds-05
ub formula formula --maxsum=/tmp/877/ub_5_
ub formula name SafeBus-COL-15-UpperBounds-06
ub formula formula --maxsum=/tmp/877/ub_6_
ub formula name SafeBus-COL-15-UpperBounds-07
ub formula formula --maxsum=/tmp/877/ub_7_
ub formula name SafeBus-COL-15-UpperBounds-08
ub formula formula --maxsum=/tmp/877/ub_8_
ub formula name SafeBus-COL-15-UpperBounds-09
ub formula formula --maxsum=/tmp/877/ub_9_
ub formula name SafeBus-COL-15-UpperBounds-10
ub formula formula --maxsum=/tmp/877/ub_10_
ub formula name SafeBus-COL-15-UpperBounds-11
ub formula formula --maxsum=/tmp/877/ub_11_
ub formula name SafeBus-COL-15-UpperBounds-12
ub formula formula --maxsum=/tmp/877/ub_12_
ub formula name SafeBus-COL-15-UpperBounds-13
ub formula formula --maxsum=/tmp/877/ub_13_
ub formula name SafeBus-COL-15-UpperBounds-14
ub formula formula --maxsum=/tmp/877/ub_14_
ub formula name SafeBus-COL-15-UpperBounds-15
ub formula formula --maxsum=/tmp/877/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SafeBus-COL-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SafeBus-COL-15, 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 r524-tall-171679080200381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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