fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695400205
Last Updated
May 14, 2023

About the Execution of Marcie+red for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5518.075 31829.00 43106.00 96.10 20 20 1 20 20 20 20 20 20 1 20 1 20 20 10 20 normal

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-167813695400205.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-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695400205
=====================================================================

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

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-V20P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:42:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 09:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:42:08] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-13 09:42:08] [INFO ] Transformed 68 places.
[2023-03-13 09:42:08] [INFO ] Transformed 548 transitions.
[2023-03-13 09:42:08] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 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-13 09:42:08] [INFO ] Computed 7 place invariants in 16 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 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :126
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 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :10
[2023-03-13 09:42:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 09:42:09] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-13 09:42:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 09:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:09] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-13 09:42:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:42:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:09] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-13 09:42:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2023-03-13 09:42:09] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 31 ms.
[2023-03-13 09:42:09] [INFO ] Added : 10 causal constraints over 2 iterations in 62 ms. Result :sat
Minimization took 37 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.3 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 67 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-13 09:42:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-13 09:42:09] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 09:42:09] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 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-13 09:42:09] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 6489 resets, run finished after 2546 ms. (steps per millisecond=392 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2553 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 1) seen :10
[2023-03-13 09:42:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-13 09:42:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:42:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 09:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:42:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-13 09:42:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2023-03-13 09:42:13] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 36 ms.
[2023-03-13 09:42:13] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
[2023-03-13 09:42:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-13 09:42:13] [INFO ] Added : 11 causal constraints over 3 iterations in 188 ms. Result :sat
Minimization took 41 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 23 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 23 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 27 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:42:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:13] [INFO ] Invariant cache hit.
[2023-03-13 09:42:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-13 09:42:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:13] [INFO ] Invariant cache hit.
[2023-03-13 09:42:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:14] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 303 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 15 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 345 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-13 09:42:14] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 2548 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 1) seen :10
[2023-03-13 09:42:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-13 09:42:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 09:42:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:17] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-13 09:42:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:42:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:17] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-13 09:42:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-13 09:42:17] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2023-03-13 09:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-13 09:42:17] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 32 ms.
[2023-03-13 09:42:17] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2023-03-13 09:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-13 09:42:17] [INFO ] Added : 11 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 49 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 19 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 19 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 17 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:42:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:17] [INFO ] Invariant cache hit.
[2023-03-13 09:42:17] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-13 09:42:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:17] [INFO ] Invariant cache hit.
[2023-03-13 09:42:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:18] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-13 09:42:18] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-13 09:42:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:18] [INFO ] Invariant cache hit.
[2023-03-13 09:42:18] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 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-13 09:42:18] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 64 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
[2023-03-13 09:42:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-13 09:42:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:42:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-13 09:42:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:42:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 09:42:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2023-03-13 09:42:18] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-13 09:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-13 09:42:18] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 20 ms.
[2023-03-13 09:42:18] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-13 09:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-13 09:42:18] [INFO ] Added : 11 causal constraints over 3 iterations in 155 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 22 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:42:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:19] [INFO ] Invariant cache hit.
[2023-03-13 09:42:19] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 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-13 09:42:19] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2075 ms. (steps per millisecond=481 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2551 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 1) seen :10
[2023-03-13 09:42:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2023-03-13 09:42:22] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 09:42:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 09:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:22] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-13 09:42:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:42:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:42:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 09:42:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-13 09:42:22] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2023-03-13 09:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-13 09:42:22] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 18 ms.
[2023-03-13 09:42:22] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-13 09:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-13 09:42:22] [INFO ] Added : 11 causal constraints over 3 iterations in 158 ms. Result :sat
Minimization took 40 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 20 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 21 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 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:42:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:22] [INFO ] Invariant cache hit.
[2023-03-13 09:42:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-13 09:42:22] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:22] [INFO ] Invariant cache hit.
[2023-03-13 09:42:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:42:23] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-13 09:42:23] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-13 09:42:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:42:23] [INFO ] Invariant cache hit.
[2023-03-13 09:42:23] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 581 ms. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 in 4906 ms.
[2023-03-13 09:42:23] [INFO ] Flatten gal took : 66 ms
[2023-03-13 09:42:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 09:42:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 547 transitions and 3984 arcs took 4 ms.
Total runtime 14936 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_V20P20N10
(NrP: 63 NrTr: 547 NrArc: 3984)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec

net check time: 0m 0.000sec

init dd package: 0m 3.457sec


RS generation: 0m 8.510sec


-> reachability set: #nodes 137797 (1.4e+05) #states 4,053,390 (6)



starting MCC model checker
--------------------------

checking: place_bound(p22)
normalized: place_bound(p22)

-> the formula is 10

FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1075699 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8158640 35557001 43715641
used/not used/entry size/cache size: 27404180 39704684 16 1024MB
basic ops cache: hits/miss/sum: 58463 99791 158254
used/not used/entry size/cache size: 143336 16633880 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: 49426 137827 187253
used/not used/entry size/cache size: 137057 8251551 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 66169960
1 826648
2 93762
3 15311
4 2525
5 316
6 46
7 73
8 39
9 55
>= 10 129

Total processing time: 0m14.974sec


BK_STOP 1678700558912

--------------------
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.000sec

14259 15258 15079 15282 15399 137797
iterations count:600033 (1096), effective:7118 (13)

initing FirstDep: 0m 0.000sec

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="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-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 r042-tajo-167813695400205"
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 '' 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 ;