About the Execution of LTSMin+red for BridgeAndVehicles-PT-V20P20N10
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694400205.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K Mar 5 18:22 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 BridgeAndVehicles-PT-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678614169204
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:42:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 09:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:42:51] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-12 09:42:51] [INFO ] Transformed 68 places.
[2023-03-12 09:42:51] [INFO ] Transformed 548 transitions.
[2023-03-12 09:42:51] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 68 cols
[2023-03-12 09:42:51] [INFO ] Computed 7 place invariants in 18 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :129
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :10
[2023-03-12 09:42:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-12 09:42:52] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-12 09:42:52] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned sat
[2023-03-12 09:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:52] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-12 09:42:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 09:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:52] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 09:42:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:42:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2023-03-12 09:42:52] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 62 ms.
[2023-03-12 09:42:52] [INFO ] Added : 10 causal constraints over 2 iterations in 132 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 124 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 09:42:53] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:42:53] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 09:43:07] [INFO ] Dead Transitions using invariants and state equation in 14301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14442 ms. Remains : 65/68 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:43:07] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2721 ms. (steps per millisecond=367 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2547 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 1) seen :10
[2023-03-12 09:43:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 09:43:11] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:43:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:11] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-12 09:43:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:11] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 09:43:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 09:43:11] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 54 ms.
[2023-03-12 09:43:11] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 17 ms to minimize.
[2023-03-12 09:43:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-12 09:43:11] [INFO ] Added : 11 causal constraints over 3 iterations in 333 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 28 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 41 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:43:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:11] [INFO ] Invariant cache hit.
[2023-03-12 09:43:12] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-12 09:43:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:12] [INFO ] Invariant cache hit.
[2023-03-12 09:43:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:12] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 881 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 943 ms. Remains : 63/65 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:12] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6489 resets, run finished after 2672 ms. (steps per millisecond=374 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2554 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties (out of 1) seen :10
[2023-03-12 09:43:16] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:16] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:43:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:16] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-12 09:43:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:16] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 09:43:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:16] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 09:43:16] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-12 09:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-12 09:43:17] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 101 ms.
[2023-03-12 09:43:17] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2023-03-12 09:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-12 09:43:17] [INFO ] Added : 11 causal constraints over 3 iterations in 370 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:43:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:17] [INFO ] Invariant cache hit.
[2023-03-12 09:43:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-12 09:43:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:17] [INFO ] Invariant cache hit.
[2023-03-12 09:43:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:17] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-12 09:43:17] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 09:43:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:17] [INFO ] Invariant cache hit.
[2023-03-12 09:43:18] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 766 ms. Remains : 63/63 places, 547/547 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:18] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 64 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :10
[2023-03-12 09:43:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:43:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:18] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-12 09:43:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:18] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-12 09:43:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2023-03-12 09:43:18] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 13 ms to minimize.
[2023-03-12 09:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-12 09:43:18] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2023-03-12 09:43:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 13 ms to minimize.
[2023-03-12 09:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-12 09:43:18] [INFO ] Added : 11 causal constraints over 3 iterations in 167 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 28 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:43:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:18] [INFO ] Invariant cache hit.
[2023-03-12 09:43:25] [INFO ] Dead Transitions using invariants and state equation in 6628 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6663 ms. Remains : 63/63 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:25] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 6488 resets, run finished after 2442 ms. (steps per millisecond=409 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2548 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 1) seen :10
[2023-03-12 09:43:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-12 09:43:28] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:43:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:29] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-12 09:43:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-12 09:43:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-12 09:43:29] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-12 09:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-12 09:43:29] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 36 ms.
[2023-03-12 09:43:29] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-12 09:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-12 09:43:29] [INFO ] Added : 11 causal constraints over 3 iterations in 172 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 31 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-12 09:43:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:29] [INFO ] Invariant cache hit.
[2023-03-12 09:43:29] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-12 09:43:29] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:29] [INFO ] Invariant cache hit.
[2023-03-12 09:43:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:43:33] [INFO ] Implicit Places using invariants and state equation in 3652 ms returned []
Implicit Place search using SMT with State Equation took 3831 ms to find 0 implicit places.
[2023-03-12 09:43:33] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-12 09:43:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 09:43:33] [INFO ] Invariant cache hit.
[2023-03-12 09:43:33] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4161 ms. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 in 15547 ms.
[2023-03-12 09:43:34] [INFO ] Flatten gal took : 103 ms
[2023-03-12 09:43:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 09:43:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 547 transitions and 3984 arcs took 6 ms.
Total runtime 42724 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/579/ub_0_
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678614333174
--------------------
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
mcc2023
ub formula name BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
ub formula formula --maxsum=/tmp/579/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 63 places, 547 transitions and 3984 arcs
pnml2lts-sym: Petri net BridgeAndVehicles_PT_V20P20N10 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 547->506 groups
pnml2lts-sym: Regrouping took 0.180 real 0.180 user 0.000 sys
pnml2lts-sym: state vector length is 63; there are 506 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 5104046 group checks and 0 next state calls
pnml2lts-sym: reachability took 98.810 real 377.180 user 17.210 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 4053390 states, 18639 nodes
pnml2lts-sym: Maximum sum of /tmp/579/ub_0_ is: 10
pnml2lts-sym: group_next: 7728 nodes total
pnml2lts-sym: group_explored: 10457 nodes, 14047 short vectors total
pnml2lts-sym: max token count: 20
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="BridgeAndVehicles-PT-V20P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V20P20N10, 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 r041-tajo-167813694400205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 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 '
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 ;