About the Execution of Marcie+red for BridgeAndVehicles-PT-V80P20N10
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.r042-tajo-167813695500277.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 marciexred
Input is BridgeAndVehicles-PT-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695500277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 29K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 299K Feb 25 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 352K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Feb 25 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 329K Feb 25 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 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 1.7M 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-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678706668996
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:24:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 11:24:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:24:30] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-13 11:24:30] [INFO ] Transformed 188 places.
[2023-03-13 11:24:30] [INFO ] Transformed 2108 transitions.
[2023-03-13 11:24:30] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 11:24:30] [INFO ] Computed 7 place invariants in 46 ms
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 11) seen :460
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :248
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :11
[2023-03-13 11:24:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 11:24:31] [INFO ] Computed 7 place invariants in 18 ms
[2023-03-13 11:24:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2023-03-13 11:24:31] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-13 11:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:31] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-13 11:24:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:24:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 11:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:31] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-13 11:24:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:24:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 124 ms returned sat
[2023-03-13 11:24:32] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 148 ms.
[2023-03-13 11:24:32] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 7 ms to minimize.
[2023-03-13 11:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-13 11:24:33] [INFO ] Added : 8 causal constraints over 7 iterations in 967 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : [1, 20] Max seen :[1, 10]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 459 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 11:24:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 11:24:33] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 11:24:34] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 185/188 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 11:24:34] [INFO ] Computed 5 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 7465 ms. (steps per millisecond=133 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 672 resets, run finished after 2408 ms. (steps per millisecond=415 ) properties (out of 1) seen :10
[2023-03-13 11:24:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 11:24:44] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-13 11:24:44] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 11:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:44] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-13 11:24:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:24:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 11:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:44] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-13 11:24:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:24:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 134 ms returned sat
[2023-03-13 11:24:45] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 160 ms.
[2023-03-13 11:24:45] [INFO ] Added : 7 causal constraints over 7 iterations in 545 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 270 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 299 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 11:24:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:24:46] [INFO ] Invariant cache hit.
[2023-03-13 11:24:46] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-13 11:24:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:24:46] [INFO ] Invariant cache hit.
[2023-03-13 11:24:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:24:48] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1947 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 172 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2419 ms. Remains : 183/185 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:24:48] [INFO ] Computed 5 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 5970 ms. (steps per millisecond=167 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 671 resets, run finished after 2234 ms. (steps per millisecond=447 ) properties (out of 1) seen :10
[2023-03-13 11:24:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:24:56] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 11:24:56] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-13 11:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:57] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-13 11:24:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:24:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 11:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:24:57] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 11:24:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:24:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2023-03-13 11:24:57] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 163 ms.
[2023-03-13 11:24:57] [INFO ] Added : 9 causal constraints over 8 iterations in 411 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 223 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 176 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 11:24:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:24:58] [INFO ] Invariant cache hit.
[2023-03-13 11:24:58] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-13 11:24:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:24:58] [INFO ] Invariant cache hit.
[2023-03-13 11:24:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:25:00] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-03-13 11:25:00] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-13 11:25:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:25:00] [INFO ] Invariant cache hit.
[2023-03-13 11:25:01] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3051 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:25:01] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :10
[2023-03-13 11:25:01] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:25:01] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-13 11:25:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 11:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:25:01] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-13 11:25:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:25:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 11:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:25:01] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 11:25:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:25:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 57 ms returned sat
[2023-03-13 11:25:01] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 62 ms.
[2023-03-13 11:25:01] [INFO ] Added : 9 causal constraints over 8 iterations in 296 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 212 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 11:25:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:25:02] [INFO ] Invariant cache hit.
[2023-03-13 11:25:03] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1006 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:25:03] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 5764 ms. (steps per millisecond=173 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 672 resets, run finished after 2213 ms. (steps per millisecond=451 ) properties (out of 1) seen :10
[2023-03-13 11:25:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 11:25:11] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 11:25:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 11:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:25:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-13 11:25:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:25:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 11:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:25:11] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 11:25:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:25:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2023-03-13 11:25:11] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 63 ms.
[2023-03-13 11:25:11] [INFO ] Added : 9 causal constraints over 8 iterations in 283 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 213 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 193 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 11:25:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:25:12] [INFO ] Invariant cache hit.
[2023-03-13 11:25:12] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-13 11:25:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:25:12] [INFO ] Invariant cache hit.
[2023-03-13 11:25:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 11:25:13] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2023-03-13 11:25:14] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-13 11:25:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 11:25:14] [INFO ] Invariant cache hit.
[2023-03-13 11:25:14] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2638 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 in 13761 ms.
[2023-03-13 11:25:15] [INFO ] Flatten gal took : 154 ms
[2023-03-13 11:25:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 11:25:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 2107 transitions and 15624 arcs took 13 ms.
Total runtime 44659 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: BridgeAndVehicles_PT_V80P20N10
(NrP: 183 NrTr: 2107 NrArc: 15624)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.040sec
net check time: 0m 0.001sec
init dd package: 0m 3.097sec
RS generation: 12m30.728sec
-> reachability set: #nodes 6177829 (6.2e+06) #states 1,428,245,394 (9)
starting MCC model checker
--------------------------
checking: place_bound(p168)
normalized: place_bound(p168)
-> the formula is 10
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 50313271 (5.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 426279148 2674715408 3100994556
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 4106926 1108190 5215116
used/not used/entry size/cache size: 1677058 15100158 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1006189 6180117 7186306
used/not used/entry size/cache size: 4400102 3988506 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 33494417
1 21382312
2 8789895
3 2660626
4 626313
5 122609
6 21534
7 4409
8 1857
9 1416
>= 10 3476
Total processing time: 12m48.556sec
BK_STOP 1678707484107
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.003sec
251929 370149 370095 370990 371442 372741 369568 370012 370472 371305 368178 368927 369791 370688 368458 368588 369498 367542 367871 368677 367321 367735 368015 366739 366910 373764 381093 381955 378454 382703 381925 378491 378826 381933 380518 378355 380061 382209 382862 379645 379999 382812 382727 382747 379561 380018 382636 381558 381545 381564 381605 382830 382899 382944 384228 384876 384822 386042 387057 387939 388740
iterations count:6143706 (2915), effective:72453 (34)
initing FirstDep: 0m 0.009sec
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-V80P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BridgeAndVehicles-PT-V80P20N10, 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 r042-tajo-167813695500277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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 ;