Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683810600005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 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-d0m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716876466143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 06:07:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:07:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:07:49] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-28 06:07:49] [INFO ] Transformed 262 places.
[2024-05-28 06:07:49] [INFO ] Transformed 73 transitions.
[2024-05-28 06:07:49] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 06:07:49] [INFO ] Computed 6 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 41, 1, 7]
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2262 resets) in 92 ms. (107 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (2048 resets) in 93 ms. (212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[41, 7]
[2024-05-28 06:07:50] [INFO ] Invariant cache hit.
[2024-05-28 06:07:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 06:07:50] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-28 06:07:50] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-28 06:07:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:07:50] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-05-28 06:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:50] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:07:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 06:07:50] [INFO ] [Nat]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:07:50] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 37 ms.
[2024-05-28 06:07:51] [INFO ] Added : 8 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 52 ms.
[2024-05-28 06:07:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Real]Added 31 Read/Feed constraints in 12 ms returned sat
[2024-05-28 06:07:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 06:07:51] [INFO ] [Nat]Added 31 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:07:51] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 36 ms.
[2024-05-28 06:07:51] [INFO ] Added : 8 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[41, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[41, 7]
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 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 60 transition count 62
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 58 transition count 59
Applied a total of 26 rules in 78 ms. Remains 58 /72 variables (removed 14) and now considering 59/73 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-05-28 06:07:51] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[4, 7]
RANDOM walk for 1000000 steps (223590 resets) in 996 ms. (1003 steps per ms)
BEST_FIRST walk for 2000002 steps (205119 resets) in 980 ms. (2038 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[4, 7]
[2024-05-28 06:07:53] [INFO ] Invariant cache hit.
[2024-05-28 06:07:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:07:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-28 06:07:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:07:53] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:07:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:07:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:07:53] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:07:53] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-05-28 06:07:53] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 23 ms to minimize.
[2024-05-28 06:07:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-28 06:07:54] [INFO ] Added : 12 causal constraints over 3 iterations in 165 ms. Result :sat
Minimization took 37 ms.
[2024-05-28 06:07:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Real]Added 23 Read/Feed constraints in 12 ms returned sat
[2024-05-28 06:07:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 06:07:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:07:54] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-05-28 06:07:54] [INFO ] Added : 11 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[4, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[4, 7]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 10 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-28 06:07:54] [INFO ] Invariant cache hit.
[2024-05-28 06:07:54] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 06:07:54] [INFO ] Invariant cache hit.
[2024-05-28 06:07:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:07:54] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-28 06:07:54] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-28 06:07:54] [INFO ] Invariant cache hit.
[2024-05-28 06:07:54] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2595 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 5 solved, 53 unsolved in 2759 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 5612ms problems are : Problem set: 5 solved, 53 unsolved
Search for dead transitions found 5 dead transitions in 5635ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 54/59 transitions.
Graph (complete) has 142 edges and 58 vertex of which 49 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 8 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 46 transition count 43
Reduce places removed 2 places and 3 transitions.
Graph (complete) has 107 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 10 rules in 9 ms. Remains 2 /58 variables (removed 56) and now considering 0/54 (removed 54) transitions.
[2024-05-28 06:08:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:08:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 06:08:00] [INFO ] Invariant cache hit.
[2024-05-28 06:08:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/58 places, 0/59 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6057 ms. Remains : 2/58 places, 0/59 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 11344 ms.

BK_STOP 1716876480546

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m04, 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 r378-smll-171683810600005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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