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.r426-tajo-167905979000493.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 SieveSingleMsgMbox-PT-d2m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679357845470

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=SieveSingleMsgMbox-PT-d2m96
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:17:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 00:17:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:17:27] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-03-21 00:17:27] [INFO ] Transformed 2398 places.
[2023-03-21 00:17:27] [INFO ] Transformed 1954 transitions.
[2023-03-21 00:17:27] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-21 00:17:27] [INFO ] Computed 6 place invariants in 100 ms
Incomplete random walk after 10000 steps, including 2207 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
[2023-03-21 00:17:28] [INFO ] Invariant cache hit.
[2023-03-21 00:17:28] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-21 00:17:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-21 00:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:28] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-21 00:17:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 00:17:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 00:17:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 00:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:29] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-21 00:17:29] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-21 00:17:30] [INFO ] [Nat]Added 1674 Read/Feed constraints in 695 ms returned sat
[2023-03-21 00:17:30] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 4 ms to minimize.
[2023-03-21 00:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-21 00:17:30] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 393 ms.
[2023-03-21 00:17:31] [INFO ] Added : 19 causal constraints over 4 iterations in 1349 ms. Result :sat
Minimization took 755 ms.
[2023-03-21 00:17:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-21 00:17:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-21 00:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:33] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-21 00:17:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 00:17:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-21 00:17:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-21 00:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:33] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-21 00:17:34] [INFO ] [Nat]Added 1674 Read/Feed constraints in 381 ms returned sat
[2023-03-21 00:17:34] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 3 ms to minimize.
[2023-03-21 00:17:34] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2023-03-21 00:17:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 994 ms
[2023-03-21 00:17:35] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 254 ms.
[2023-03-21 00:17:36] [INFO ] Added : 19 causal constraints over 4 iterations in 1106 ms. Result :sat
Minimization took 393 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1171 place count 177 transition count 270
Iterating global reduction 2 with 92 rules applied. Total rules applied 1263 place count 177 transition count 270
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1298 place count 177 transition count 235
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1337 place count 138 transition count 181
Iterating global reduction 3 with 39 rules applied. Total rules applied 1376 place count 138 transition count 181
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1400 place count 138 transition count 157
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 129 transition count 144
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 129 transition count 144
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1427 place count 120 transition count 135
Iterating global reduction 4 with 9 rules applied. Total rules applied 1436 place count 120 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1441 place count 115 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 1446 place count 115 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1448 place count 115 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1453 place count 110 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 1458 place count 110 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1461 place count 107 transition count 119
Iterating global reduction 5 with 3 rules applied. Total rules applied 1464 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1465 place count 106 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 1466 place count 106 transition count 118
Applied a total of 1466 rules in 137 ms. Remains 106 /414 variables (removed 308) and now considering 118/1954 (removed 1836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 106/414 places, 118/1954 transitions.
// Phase 1: matrix 118 rows 106 cols
[2023-03-21 00:17:37] [INFO ] Computed 4 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 224165 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103228 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :0
[2023-03-21 00:17:38] [INFO ] Invariant cache hit.
[2023-03-21 00:17:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 00:17:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:38] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-21 00:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 00:17:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:17:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:38] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-21 00:17:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:17:38] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2023-03-21 00:17:38] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-21 00:17:38] [INFO ] Added : 18 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-21 00:17:38] [INFO ] Invariant cache hit.
[2023-03-21 00:17:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 00:17:39] [INFO ] Invariant cache hit.
[2023-03-21 00:17:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:17:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-21 00:17:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 00:17:39] [INFO ] Invariant cache hit.
[2023-03-21 00:17:39] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 106/106 places, 118/118 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
[2023-03-21 00:17:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-21 00:17:39] [INFO ] Invariant cache hit.
[2023-03-21 00:17:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 00:17:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-21 00:17:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 00:17:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 00:17:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:39] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-21 00:17:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:17:39] [INFO ] [Nat]Added 44 Read/Feed constraints in 10 ms returned sat
[2023-03-21 00:17:39] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-21 00:17:39] [INFO ] Added : 18 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 106/106 places, 118/118 transitions.
[2023-03-21 00:17:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 223870 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103108 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :0
[2023-03-21 00:17:41] [INFO ] Invariant cache hit.
[2023-03-21 00:17:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 00:17:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:41] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-21 00:17:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 00:17:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 00:17:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 00:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 00:17:41] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-21 00:17:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:17:41] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2023-03-21 00:17:41] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-21 00:17:41] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-21 00:17:41] [INFO ] Invariant cache hit.
[2023-03-21 00:17:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 00:17:41] [INFO ] Invariant cache hit.
[2023-03-21 00:17:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-21 00:17:41] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-21 00:17:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 00:17:41] [INFO ] Invariant cache hit.
[2023-03-21 00:17:41] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 106/106 places, 118/118 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 in 2540 ms.
[2023-03-21 00:17:42] [INFO ] Flatten gal took : 43 ms
[2023-03-21 00:17:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-21 00:17:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 118 transitions and 470 arcs took 2 ms.
Total runtime 14778 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: SieveSingleMsgMbox_PT_d2m96
(NrP: 106 NrTr: 118 NrArc: 470)

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

net check time: 0m 0.000sec

init dd package: 0m 2.949sec


before gc: list nodes free: 1891225

after gc: idd nodes used:434680, unused:63565320; list nodes free:414214594
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4193152 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097856 kB

BK_TIME_CONFINEMENT_REACHED

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

13205 29629 54270 93257 118695 186383 224129 256284 392545 429990 506280

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="SieveSingleMsgMbox-PT-d2m96"
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 SieveSingleMsgMbox-PT-d2m96, 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 r426-tajo-167905979000493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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