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.r363-smll-167891813900213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r363-smll-167891813900213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 01:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-UpperBounds-00
FORMULA_NAME SafeBus-COL-06-UpperBounds-01
FORMULA_NAME SafeBus-COL-06-UpperBounds-02
FORMULA_NAME SafeBus-COL-06-UpperBounds-03
FORMULA_NAME SafeBus-COL-06-UpperBounds-04
FORMULA_NAME SafeBus-COL-06-UpperBounds-05
FORMULA_NAME SafeBus-COL-06-UpperBounds-06
FORMULA_NAME SafeBus-COL-06-UpperBounds-07
FORMULA_NAME SafeBus-COL-06-UpperBounds-08
FORMULA_NAME SafeBus-COL-06-UpperBounds-09
FORMULA_NAME SafeBus-COL-06-UpperBounds-10
FORMULA_NAME SafeBus-COL-06-UpperBounds-11
FORMULA_NAME SafeBus-COL-06-UpperBounds-12
FORMULA_NAME SafeBus-COL-06-UpperBounds-13
FORMULA_NAME SafeBus-COL-06-UpperBounds-14
FORMULA_NAME SafeBus-COL-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679049024177

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 10:30:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 10:30:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:30:27] [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-17 10:30:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 10:30:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 719 ms
[2023-03-17 10:30:27] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2023-03-17 10:30:27] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-17 10:30:27] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2023-03-17 10:30:27] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2023-03-17 10:30:27] [INFO ] Computed 7 place invariants in 5 ms
FORMULA SafeBus-COL-06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-17 10:30:27] [INFO ] Invariant cache hit.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 10:30:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-17 10:30:28] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 10:30:28] [INFO ] Added : 10 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 10:30:28] [INFO ] Added : 10 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 10:30:28] [INFO ] Added : 9 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 10:30:28] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:30:28] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:30:28] [INFO ] Added : 8 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 7 ms.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 10:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 10:30:29] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-17 10:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 10:30:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 10:30:29] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 1, 1, 6, 6, 1, 1, 1]
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2023-03-17 10:30:29] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 42 ms.
[2023-03-17 10:30:29] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 12 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :22
FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :18
FORMULA SafeBus-COL-06-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :10
[2023-03-17 10:30:29] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:30:29] [INFO ] Computed 29 place invariants in 22 ms
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:29] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-17 10:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-17 10:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:29] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-17 10:30:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:29] [INFO ] [Nat]Added 43 Read/Feed constraints in 64 ms returned sat
[2023-03-17 10:30:30] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 58 ms.
[2023-03-17 10:30:30] [INFO ] Added : 1 causal constraints over 1 iterations in 125 ms. Result :sat
Minimization took 92 ms.
[2023-03-17 10:30:30] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-17 10:30:30] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-17 10:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:30] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-17 10:30:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-17 10:30:30] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-17 10:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:30] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-17 10:30:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 79 ms returned sat
[2023-03-17 10:30:30] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 11 ms to minimize.
[2023-03-17 10:30:30] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 1 ms to minimize.
[2023-03-17 10:30:31] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2023-03-17 10:30:31] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2023-03-17 10:30:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 570 ms
Current structural bounds on expressions (after SMT) : [6, 5] Max seen :[5, 5]
FORMULA SafeBus-COL-06-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 65 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 138/138 places, 451/451 transitions.
Normalized transition count is 242 out of 451 initially.
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:30:31] [INFO ] Computed 29 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2787 ms. (steps per millisecond=358 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 1) seen :5
[2023-03-17 10:30:35] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:30:35] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-17 10:30:35] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 10:30:35] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-17 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:35] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-17 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-17 10:30:35] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-17 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:35] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-17 10:30:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 61 ms returned sat
[2023-03-17 10:30:35] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 34 ms.
[2023-03-17 10:30:35] [INFO ] Added : 1 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 26 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 31 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2023-03-17 10:30:35] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2023-03-17 10:30:35] [INFO ] Invariant cache hit.
[2023-03-17 10:30:36] [INFO ] Implicit Places using invariants in 290 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 293 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 65 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2023-03-17 10:30:36] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:36] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 10:30:36] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-17 10:30:36] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 10:30:36] [INFO ] Invariant cache hit.
[2023-03-17 10:30:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:37] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1294 ms. Remains : 126/138 places, 565/451 transitions.
Normalized transition count is 356 out of 565 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:37] [INFO ] Computed 23 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3952 ms. (steps per millisecond=253 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 1) seen :5
[2023-03-17 10:30:42] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:42] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-17 10:30:42] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-17 10:30:42] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-17 10:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:42] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-17 10:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-17 10:30:42] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-17 10:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:42] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-17 10:30:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:43] [INFO ] [Nat]Added 43 Read/Feed constraints in 140 ms returned sat
[2023-03-17 10:30:43] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 75 ms.
[2023-03-17 10:30:43] [INFO ] Added : 6 causal constraints over 2 iterations in 173 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 54 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 45 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2023-03-17 10:30:43] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 10:30:43] [INFO ] Invariant cache hit.
[2023-03-17 10:30:44] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-17 10:30:44] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 10:30:44] [INFO ] Invariant cache hit.
[2023-03-17 10:30:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:44] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-17 10:30:44] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 10:30:44] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 10:30:44] [INFO ] Invariant cache hit.
[2023-03-17 10:30:45] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 36 transitions.
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 36 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-17 10:30:45] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1889 ms. Remains : 126/126 places, 529/565 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:45] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3713 ms. (steps per millisecond=269 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1355 ms. (steps per millisecond=738 ) properties (out of 1) seen :5
[2023-03-17 10:30:50] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:50] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-17 10:30:50] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-17 10:30:50] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 15 ms returned sat
[2023-03-17 10:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:50] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-17 10:30:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-17 10:30:51] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-17 10:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:51] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-17 10:30:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 162 ms returned sat
[2023-03-17 10:30:51] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 42 ms.
[2023-03-17 10:30:51] [INFO ] Added : 7 causal constraints over 2 iterations in 123 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 24 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-17 10:30:51] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:30:51] [INFO ] Invariant cache hit.
[2023-03-17 10:30:52] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-17 10:30:52] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:30:52] [INFO ] Invariant cache hit.
[2023-03-17 10:30:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:53] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2023-03-17 10:30:53] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 10:30:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:30:53] [INFO ] Invariant cache hit.
[2023-03-17 10:30:53] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1780 ms. Remains : 126/126 places, 529/529 transitions.
Starting property specific reduction for SafeBus-COL-06-UpperBounds-03
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:53] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :5
[2023-03-17 10:30:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:53] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 10:30:53] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-17 10:30:53] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-17 10:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:53] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-17 10:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-17 10:30:53] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-17 10:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:53] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-17 10:30:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:30:54] [INFO ] [Nat]Added 43 Read/Feed constraints in 160 ms returned sat
[2023-03-17 10:30:54] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 44 ms.
[2023-03-17 10:30:54] [INFO ] Added : 7 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 22 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 126/126 places, 529/529 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:30:54] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3961 ms. (steps per millisecond=252 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1339 ms. (steps per millisecond=746 ) properties (out of 1) seen :5
[2023-03-17 10:31:00] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 10:31:00] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 10:31:00] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-17 10:31:00] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-17 10:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:31:00] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-17 10:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:31:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-17 10:31:00] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-17 10:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:31:00] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-17 10:31:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:31:00] [INFO ] [Nat]Added 43 Read/Feed constraints in 274 ms returned sat
[2023-03-17 10:31:00] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 35 ms.
[2023-03-17 10:31:00] [INFO ] Added : 7 causal constraints over 2 iterations in 133 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 37 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 36 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-17 10:31:01] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:31:01] [INFO ] Invariant cache hit.
[2023-03-17 10:31:01] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-17 10:31:01] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:31:01] [INFO ] Invariant cache hit.
[2023-03-17 10:31:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:31:02] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-17 10:31:02] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-17 10:31:02] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 10:31:02] [INFO ] Invariant cache hit.
[2023-03-17 10:31:02] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1603 ms. Remains : 126/126 places, 529/529 transitions.
Ending property specific reduction for SafeBus-COL-06-UpperBounds-03 in 9357 ms.
[2023-03-17 10:31:03] [INFO ] Flatten gal took : 185 ms
[2023-03-17 10:31:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-17 10:31:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 529 transitions and 3754 arcs took 10 ms.
Total runtime 36376 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (COL), instance 06
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 126 places, 529 transitions, 3754 arcs.
Final Score: 6970.24
Took : 58 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1679051837686

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 670 Killed ${SMART}/smart ${INPUT_SM}

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is SafeBus-COL-06, 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 r363-smll-167891813900213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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