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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 222K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 158K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 95K 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-03-UpperBounds-00
FORMULA_NAME SafeBus-PT-03-UpperBounds-01
FORMULA_NAME SafeBus-PT-03-UpperBounds-02
FORMULA_NAME SafeBus-PT-03-UpperBounds-03
FORMULA_NAME SafeBus-PT-03-UpperBounds-04
FORMULA_NAME SafeBus-PT-03-UpperBounds-05
FORMULA_NAME SafeBus-PT-03-UpperBounds-06
FORMULA_NAME SafeBus-PT-03-UpperBounds-07
FORMULA_NAME SafeBus-PT-03-UpperBounds-08
FORMULA_NAME SafeBus-PT-03-UpperBounds-09
FORMULA_NAME SafeBus-PT-03-UpperBounds-10
FORMULA_NAME SafeBus-PT-03-UpperBounds-11
FORMULA_NAME SafeBus-PT-03-UpperBounds-12
FORMULA_NAME SafeBus-PT-03-UpperBounds-13
FORMULA_NAME SafeBus-PT-03-UpperBounds-14
FORMULA_NAME SafeBus-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679086236537

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-03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 20:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 20:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:50:39] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-17 20:50:39] [INFO ] Transformed 57 places.
[2023-03-17 20:50:39] [INFO ] Transformed 91 transitions.
[2023-03-17 20:50:39] [INFO ] Found NUPN structural information;
[2023-03-17 20:50:39] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 20:50:39] [INFO ] Computed 17 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :9
FORMULA SafeBus-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :3
[2023-03-17 20:50:39] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 20:50:39] [INFO ] Computed 17 place invariants in 12 ms
[2023-03-17 20:50:39] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2023-03-17 20:50:39] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-17 20:50:39] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 20:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-17 20:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-17 20:50:40] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-17 20:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:40] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-17 20:50:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 15 ms returned sat
[2023-03-17 20:50:40] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 15 ms.
[2023-03-17 20:50:40] [INFO ] Added : 21 causal constraints over 5 iterations in 109 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, 7] Max seen :[1, 2]
FORMULA SafeBus-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 19 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 54/54 places, 91/91 transitions.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 20:50:40] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1437 ms. (steps per millisecond=695 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 1) seen :2
[2023-03-17 20:50:42] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 20:50:42] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-17 20:50:42] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-17 20:50:42] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 18 ms returned sat
[2023-03-17 20:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:42] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-17 20:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-17 20:50:42] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:42] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-17 20:50:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 13 ms returned sat
[2023-03-17 20:50:42] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 15 ms.
[2023-03-17 20:50:43] [INFO ] Added : 21 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-17 20:50:43] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-17 20:50:43] [INFO ] Invariant cache hit.
[2023-03-17 20:50:43] [INFO ] Implicit Places using invariants in 132 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 136 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/54 places, 91/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 94
Applied a total of 6 rules in 16 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2023-03-17 20:50:43] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:43] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 20:50:43] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-17 20:50:43] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 20:50:43] [INFO ] Invariant cache hit.
[2023-03-17 20:50:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 94/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 439 ms. Remains : 48/54 places, 94/91 transitions.
Normalized transition count is 71 out of 94 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:43] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1442 ms. (steps per millisecond=693 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 1) seen :2
[2023-03-17 20:50:45] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:45] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 20:50:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-17 20:50:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-17 20:50:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 20:50:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:45] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-17 20:50:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:45] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2023-03-17 20:50:45] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 6 ms to minimize.
[2023-03-17 20:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-17 20:50:45] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 19 ms.
[2023-03-17 20:50:45] [INFO ] Added : 16 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 48/48 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-17 20:50:45] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 20:50:45] [INFO ] Invariant cache hit.
[2023-03-17 20:50:46] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-17 20:50:46] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 20:50:46] [INFO ] Invariant cache hit.
[2023-03-17 20:50:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:46] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-17 20:50:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:50:46] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 20:50:46] [INFO ] Invariant cache hit.
[2023-03-17 20:50:46] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 9 transitions.
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/48 places, 85/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 20:50:46] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 432 ms. Remains : 48/48 places, 85/94 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:46] [INFO ] Computed 14 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 1) seen :2
[2023-03-17 20:50:48] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:48] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 20:50:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 20:50:48] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-17 20:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-17 20:50:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 20:50:48] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:48] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-17 20:50:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:48] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2023-03-17 20:50:48] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2023-03-17 20:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-17 20:50:48] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 11 ms.
[2023-03-17 20:50:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2023-03-17 20:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-17 20:50:48] [INFO ] Added : 25 causal constraints over 5 iterations in 150 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 20:50:48] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:48] [INFO ] Invariant cache hit.
[2023-03-17 20:50:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-17 20:50:48] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:48] [INFO ] Invariant cache hit.
[2023-03-17 20:50:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:49] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-17 20:50:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:50:49] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:49] [INFO ] Invariant cache hit.
[2023-03-17 20:50:49] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 48/48 places, 85/85 transitions.
Starting property specific reduction for SafeBus-PT-03-UpperBounds-02
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:49] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2023-03-17 20:50:49] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:49] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 20:50:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 20:50:49] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:49] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-17 20:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 20:50:49] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-17 20:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-17 20:50:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:49] [INFO ] [Nat]Added 13 Read/Feed constraints in 13 ms returned sat
[2023-03-17 20:50:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
[2023-03-17 20:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-17 20:50:49] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 8 ms.
[2023-03-17 20:50:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2023-03-17 20:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-17 20:50:49] [INFO ] Added : 25 causal constraints over 5 iterations in 182 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 48/48 places, 85/85 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:49] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :2
[2023-03-17 20:50:52] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 20:50:52] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 20:50:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 20:50:52] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-17 20:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:52] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-17 20:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 20:50:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 20:50:52] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 20:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 20:50:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-17 20:50:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 17 ms returned sat
[2023-03-17 20:50:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-17 20:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-17 20:50:52] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 10 ms.
[2023-03-17 20:50:52] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-17 20:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-17 20:50:52] [INFO ] Added : 25 causal constraints over 5 iterations in 181 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 20:50:52] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:52] [INFO ] Invariant cache hit.
[2023-03-17 20:50:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-17 20:50:52] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:52] [INFO ] Invariant cache hit.
[2023-03-17 20:50:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 20:50:53] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-17 20:50:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 20:50:53] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 20:50:53] [INFO ] Invariant cache hit.
[2023-03-17 20:50:53] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-PT-03-UpperBounds-02 in 4144 ms.
[2023-03-17 20:50:53] [INFO ] Flatten gal took : 87 ms
[2023-03-17 20:50:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-17 20:50:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 85 transitions and 502 arcs took 4 ms.
Total runtime 14556 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (PT), instance 03
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: 48 places, 85 transitions, 502 arcs.
Final Score: 984.101
Took : 7 seconds
Bounds file is: UpperBounds.xml
FORMULA SafeBus-PT-03-UpperBounds-02 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679086262506

--------------------
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

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-03"
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-03, 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-167891814000261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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