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-167891814000269.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-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r363-smll-167891814000269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K Feb 26 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 26 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 156K Feb 26 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 26 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 303K 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-PT-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679086499331

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-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 20:55:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 20:55:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:55:02] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2023-03-17 20:55:03] [INFO ] Transformed 144 places.
[2023-03-17 20:55:03] [INFO ] Transformed 451 transitions.
[2023-03-17 20:55:03] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 6 places and 0 transitions.
Normalized transition count is 242 out of 451 initially.
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 20:55:03] [INFO ] Computed 29 place invariants in 31 ms
FORMULA SafeBus-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :24
FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :17
[2023-03-17 20:55:03] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 20:55:03] [INFO ] Computed 29 place invariants in 11 ms
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 6 ms returned unsat
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 15 ms returned unsat
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 20:55:03] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-17 20:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:04] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-17 20:55:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-17 20:55:04] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-17 20:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:04] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-17 20:55:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:04] [INFO ] [Nat]Added 43 Read/Feed constraints in 83 ms returned sat
[2023-03-17 20:55:04] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 50 ms.
[2023-03-17 20:55:04] [INFO ] Added : 2 causal constraints over 1 iterations in 117 ms. Result :sat
Minimization took 60 ms.
[2023-03-17 20:55:04] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned unsat
[2023-03-17 20:55:04] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-17 20:55:04] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 6, 31, 1, 1] Max seen :[6, 6, 5, 1, 1]
FORMULA SafeBus-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-01 6 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 69 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 69 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 20:55:04] [INFO ] Computed 29 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2974 ms. (steps per millisecond=336 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties (out of 1) seen :5
[2023-03-17 20:55:09] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 20:55:09] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-17 20:55:09] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 20:55:09] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-17 20:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:09] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-17 20:55:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-17 20:55:09] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-17 20:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:09] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-17 20:55:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:09] [INFO ] [Nat]Added 43 Read/Feed constraints in 88 ms returned sat
[2023-03-17 20:55:09] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 37 ms.
[2023-03-17 20:55:09] [INFO ] Added : 2 causal constraints over 1 iterations in 85 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [31] 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 34 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 34 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 32 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2023-03-17 20:55:09] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2023-03-17 20:55:09] [INFO ] Invariant cache hit.
[2023-03-17 20:55:10] [INFO ] Implicit Places using invariants in 268 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 272 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 1 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 64 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2023-03-17 20:55:10] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:10] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:55:10] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-17 20:55:10] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 20:55:10] [INFO ] Invariant cache hit.
[2023-03-17 20:55:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:11] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 899 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 1270 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 20:55:11] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4030 ms. (steps per millisecond=248 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties (out of 1) seen :5
[2023-03-17 20:55:16] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:16] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-17 20:55:16] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-17 20:55:16] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 9 ms returned sat
[2023-03-17 20:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:17] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-17 20:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 20:55:17] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-17 20:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:17] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-17 20:55:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:17] [INFO ] [Nat]Added 43 Read/Feed constraints in 67 ms returned sat
[2023-03-17 20:55:17] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 64 ms.
[2023-03-17 20:55:17] [INFO ] Added : 6 causal constraints over 2 iterations in 142 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [7] 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 68 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 68 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 39 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2023-03-17 20:55:17] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 20:55:17] [INFO ] Invariant cache hit.
[2023-03-17 20:55:18] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-17 20:55:18] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 20:55:18] [INFO ] Invariant cache hit.
[2023-03-17 20:55:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:18] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-17 20:55:18] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-17 20:55:18] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2023-03-17 20:55:19] [INFO ] Invariant cache hit.
[2023-03-17 20:55:19] [INFO ] Dead Transitions using invariants and state equation in 532 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 20:55:19] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1692 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 20:55:19] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4028 ms. (steps per millisecond=248 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1377 ms. (steps per millisecond=726 ) properties (out of 1) seen :5
[2023-03-17 20:55:25] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:25] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 20:55:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 20:55:25] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-17 20:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:25] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-17 20:55:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 20:55:25] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-17 20:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:25] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-17 20:55:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:25] [INFO ] [Nat]Added 43 Read/Feed constraints in 71 ms returned sat
[2023-03-17 20:55:25] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 39 ms.
[2023-03-17 20:55:25] [INFO ] Added : 7 causal constraints over 2 iterations in 123 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [7] 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 40 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 41 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 40 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-17 20:55:25] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:25] [INFO ] Invariant cache hit.
[2023-03-17 20:55:26] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-17 20:55:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:26] [INFO ] Invariant cache hit.
[2023-03-17 20:55:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:26] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-17 20:55:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 20:55:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:26] [INFO ] Invariant cache hit.
[2023-03-17 20:55:27] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1384 ms. Remains : 126/126 places, 529/529 transitions.
Starting property specific reduction for SafeBus-PT-06-UpperBounds-03
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:27] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :5
[2023-03-17 20:55:27] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:27] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-17 20:55:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 20:55:27] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-17 20:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:27] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-17 20:55:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 20:55:27] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-17 20:55:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:27] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-17 20:55:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:27] [INFO ] [Nat]Added 43 Read/Feed constraints in 75 ms returned sat
[2023-03-17 20:55:27] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 37 ms.
[2023-03-17 20:55:27] [INFO ] Added : 7 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [7] 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.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:28] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4421 ms. (steps per millisecond=226 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1434 ms. (steps per millisecond=697 ) properties (out of 1) seen :5
[2023-03-17 20:55:34] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2023-03-17 20:55:34] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 20:55:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 20:55:34] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-17 20:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:34] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-17 20:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:55:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 20:55:34] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-17 20:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:55:34] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-17 20:55:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:34] [INFO ] [Nat]Added 43 Read/Feed constraints in 119 ms returned sat
[2023-03-17 20:55:34] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 52 ms.
[2023-03-17 20:55:34] [INFO ] Added : 7 causal constraints over 2 iterations in 178 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : [7] 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 28 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 30 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 22 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2023-03-17 20:55:35] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:35] [INFO ] Invariant cache hit.
[2023-03-17 20:55:35] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-17 20:55:35] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:35] [INFO ] Invariant cache hit.
[2023-03-17 20:55:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 20:55:36] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-17 20:55:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 20:55:36] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2023-03-17 20:55:36] [INFO ] Invariant cache hit.
[2023-03-17 20:55:36] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 126/126 places, 529/529 transitions.
Ending property specific reduction for SafeBus-PT-06-UpperBounds-03 in 9430 ms.
[2023-03-17 20:55:37] [INFO ] Flatten gal took : 146 ms
[2023-03-17 20:55:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-17 20:55:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 529 transitions and 3754 arcs took 7 ms.
Total runtime 34581 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (PT), 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: 6819.431
Took : 60 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1679089749721

--------------------
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: 605 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-PT-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-PT-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-167891814000269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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