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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 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 57K 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-d0m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679351278023

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-d0m36
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:27:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 22:27:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:27:59] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-20 22:27:59] [INFO ] Transformed 262 places.
[2023-03-20 22:27:59] [INFO ] Transformed 73 transitions.
[2023-03-20 22:27:59] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 22:27:59] [INFO ] Computed 6 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1076 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
[2023-03-20 22:27:59] [INFO ] Invariant cache hit.
[2023-03-20 22:27:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-20 22:27:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:00] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-20 22:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-20 22:28:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:28:00] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-20 22:28:00] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2023-03-20 22:28:00] [INFO ] Added : 8 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 14 ms.
[2023-03-20 22:28:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-20 22:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-20 22:28:00] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 192 ms
[2023-03-20 22:28:00] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2023-03-20 22:28:00] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-20 22:28:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-20 22:28:00] [INFO ] Added : 16 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 59 transition count 61
Applied a total of 24 rules in 24 ms. Remains 59 /72 variables (removed 13) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 59/72 places, 61/73 transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-20 22:28:00] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224295 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102845 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102779 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 2) seen :0
[2023-03-20 22:28:02] [INFO ] Invariant cache hit.
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-20 22:28:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-20 22:28:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-20 22:28:02] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 7 ms.
[2023-03-20 22:28:02] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 13 ms.
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-20 22:28:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-20 22:28:02] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-20 22:28:02] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-20 22:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-20 22:28:02] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 6 ms.
[2023-03-20 22:28:02] [INFO ] Added : 7 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 61/61 transitions.
[2023-03-20 22:28:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 223874 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103086 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 1) seen :0
[2023-03-20 22:28:03] [INFO ] Invariant cache hit.
[2023-03-20 22:28:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:03] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-20 22:28:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-20 22:28:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:03] [INFO ] [Nat]Added 25 Read/Feed constraints in 13 ms returned sat
[2023-03-20 22:28:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-03-20 22:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-20 22:28:03] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 5 ms.
[2023-03-20 22:28:03] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 22:28:03] [INFO ] Invariant cache hit.
[2023-03-20 22:28:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 22:28:03] [INFO ] Invariant cache hit.
[2023-03-20 22:28:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:03] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-20 22:28:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:28:03] [INFO ] Invariant cache hit.
[2023-03-20 22:28:03] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 59/59 places, 61/61 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
[2023-03-20 22:28:03] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2202 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1032 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 22:28:04] [INFO ] Invariant cache hit.
[2023-03-20 22:28:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-20 22:28:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:04] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:04] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-20 22:28:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:04] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-20 22:28:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-20 22:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-20 22:28:04] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 6 ms.
[2023-03-20 22:28:04] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/59 places, 61/61 transitions.
[2023-03-20 22:28:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 223589 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103254 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :0
[2023-03-20 22:28:05] [INFO ] Invariant cache hit.
[2023-03-20 22:28:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:28:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-20 22:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-20 22:28:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 22:28:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 22:28:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 22:28:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:05] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-20 22:28:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2023-03-20 22:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-20 22:28:05] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 14 ms.
[2023-03-20 22:28:05] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-20 22:28:05] [INFO ] Invariant cache hit.
[2023-03-20 22:28:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 22:28:05] [INFO ] Invariant cache hit.
[2023-03-20 22:28:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 22:28:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 22:28:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:28:05] [INFO ] Invariant cache hit.
[2023-03-20 22:28:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 59/59 places, 61/61 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 in 1958 ms.
[2023-03-20 22:28:06] [INFO ] Flatten gal took : 35 ms
[2023-03-20 22:28:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 22:28:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 61 transitions and 241 arcs took 1 ms.
Total runtime 6586 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_d0m36
(NrP: 59 NrTr: 61 NrArc: 241)

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

net check time: 0m 0.000sec

init dd package: 0m 3.273sec


RS generation: 0m33.208sec


-> reachability set: #nodes 34758 (3.5e+04) #states 3,501,583,837 (9)



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

checking: place_bound(p46)
normalized: place_bound(p46)

-> the formula is 1

FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1555740 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 285687580 51775461 337463041
used/not used/entry size/cache size: 35932045 31176819 16 1024MB
basic ops cache: hits/miss/sum: 41 1739 1780
used/not used/entry size/cache size: 5210 16772006 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: 257924 34763 292687
used/not used/entry size/cache size: 34686 8353922 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 65811530
1 1190825
2 84688
3 6601
4 1365
5 89
6 3149
7 1801
8 686
9 2283
>= 10 5847

Total processing time: 0m39.805sec


BK_STOP 1679351326213

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

57719
iterations count:170205 (2790), effective:5998 (98)

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="SieveSingleMsgMbox-PT-d0m36"
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-d0m36, 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-167905978900381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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