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-171683810600021.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-d0m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:15 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-d0m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716877027158

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-d0m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 06:17:09] [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:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:17:09] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-05-28 06:17:09] [INFO ] Transformed 262 places.
[2024-05-28 06:17:10] [INFO ] Transformed 73 transitions.
[2024-05-28 06:17:10] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 06:17:10] [INFO ] Computed 6 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 7, 7, 1]
RANDOM walk for 10000 steps (2261 resets) in 78 ms. (126 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (5104 resets) in 135 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 7]
[2024-05-28 06:17:10] [INFO ] Invariant cache hit.
[2024-05-28 06:17:10] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 06:17:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 17 ms returned sat
[2024-05-28 06:17:10] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-28 06:17:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:17:10] [INFO ] [Real]Added 31 Read/Feed constraints in 19 ms returned sat
[2024-05-28 06:17:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Nat]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 16 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 4 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-05-28 06:17:11] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 24 ms.
[2024-05-28 06:17:11] [INFO ] Added : 12 causal constraints over 3 iterations in 128 ms. Result :sat
Minimization took 53 ms.
[2024-05-28 06:17:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-05-28 06:17:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 06:17:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Nat]Added 31 Read/Feed constraints in 14 ms returned sat
[2024-05-28 06:17:12] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 21 ms.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-28 06:17:12] [INFO ] Added : 12 causal constraints over 4 iterations in 216 ms. Result :sat
Minimization took 47 ms.
[2024-05-28 06:17:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-05-28 06:17:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-28 06:17:12] [INFO ] [Nat]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2024-05-28 06:17:12] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 16 ms.
[2024-05-28 06:17:12] [INFO ] Added : 10 causal constraints over 2 iterations in 59 ms. Result :sat
Minimization took 47 ms.
[2024-05-28 06:17:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 1]
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 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.4 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 61 transition count 63
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 60 transition count 62
Iterating global reduction 1 with 1 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
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 59 transition count 60
Applied a total of 24 rules in 85 ms. Remains 59 /72 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 59/72 places, 60/73 transitions.
// Phase 1: matrix 60 rows 59 cols
[2024-05-28 06:17:13] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 7]
RANDOM walk for 1000000 steps (223728 resets) in 1111 ms. (899 steps per ms)
BEST_FIRST walk for 2000001 steps (205921 resets) in 855 ms. (2336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 7]
[2024-05-28 06:17:15] [INFO ] Invariant cache hit.
[2024-05-28 06:17:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-28 06:17:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:17:15] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:17:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-05-28 06:17:15] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 8 ms.
[2024-05-28 06:17:15] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 22 ms.
[2024-05-28 06:17:15] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:17:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 06:17:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:17:15] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-28 06:17:15] [INFO ] Added : 7 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 7]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-28 06:17:16] [INFO ] Invariant cache hit.
[2024-05-28 06:17:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 06:17:16] [INFO ] Invariant cache hit.
[2024-05-28 06:17:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:17:16] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-28 06:17:16] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 06:17:16] [INFO ] Invariant cache hit.
[2024-05-28 06:17:16] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 4565ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4900 ms. Remains : 59/59 places, 60/60 transitions.
RANDOM walk for 40000 steps (8866 resets) in 1542 ms. (25 steps per ms) remains 4/4 properties
[2024-05-28 06:17:21] [INFO ] Flatten gal took : 43 ms
BEST_FIRST walk for 40004 steps (4091 resets) in 450 ms. (88 steps per ms) remains 4/4 properties
[2024-05-28 06:17:21] [INFO ] Flatten gal took : 51 ms
[2024-05-28 06:17:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1219606375014773595.gal : 9 ms
[2024-05-28 06:17:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7814403160770113280.prop : 1 ms
BEST_FIRST walk for 40003 steps (4059 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1219606375014773595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7814403160770113280.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7814403160770113280.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 37
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :37 after 103
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :103 after 197
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :197 after 273
BEST_FIRST walk for 40001 steps (4136 resets) in 338 ms. (117 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :273 after 1629
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1629 after 6493
BEST_FIRST walk for 40002 steps (4011 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6493 after 22834
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :22834 after 100197
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :100197 after 414933
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :414933 after 984941
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :984941 after 3.1362e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.33358e+07,2.9395,62756,2,7338,19,284610,7,0,299,188447,0
Total reachable state count : 43335793

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1.80634e+06,2.94182,62756,2,1345,19,284610,8,0,302,188447,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1.80634e+06,2.94317,62756,2,1345,19,284610,9,0,303,188447,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,2.94352,62756,1,0,19,284610,9,0,303,188447,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,314496,2.94399,62756,2,491,19,284610,10,0,305,188447,0
Interrupted probabilistic random walk after 2971708 steps, run timeout after 3001 ms. (steps per millisecond=990 ) properties seen :3 out of 4
Probabilistic random walk after 2971708 steps, saw 1248740 distinct states, run finished after 3007 ms. (steps per millisecond=988 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[7]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:17:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2228 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (1028 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:17:24] [INFO ] Invariant cache hit.
[2024-05-28 06:17:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:17:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 06:17:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:17:24] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:17:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:17:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-28 06:17:25] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2024-05-28 06:17:25] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 7 ms.
[2024-05-28 06:17:25] [INFO ] Added : 7 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 60/60 transitions.
[2024-05-28 06:17:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223627 resets) in 813 ms. (1228 steps per ms)
BEST_FIRST walk for 1000001 steps (103159 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:17:26] [INFO ] Invariant cache hit.
[2024-05-28 06:17:26] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-28 06:17:26] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 06:17:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:17:26] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:17:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:17:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:17:26] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 06:17:26] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:17:26] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-28 06:17:26] [INFO ] Added : 7 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-28 06:17:26] [INFO ] Invariant cache hit.
[2024-05-28 06:17:26] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 06:17:26] [INFO ] Invariant cache hit.
[2024-05-28 06:17:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:17:26] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-28 06:17:26] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 06:17:26] [INFO ] Invariant cache hit.
[2024-05-28 06:17:26] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 5049ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5371 ms. Remains : 59/59 places, 60/60 transitions.
RANDOM walk for 40000 steps (9087 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2024-05-28 06:17:32] [INFO ] Flatten gal took : 29 ms
BEST_FIRST walk for 40002 steps (4028 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2024-05-28 06:17:32] [INFO ] Flatten gal took : 32 ms
[2024-05-28 06:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15461926528845701341.gal : 4 ms
[2024-05-28 06:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3894233564049439648.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15461926528845701341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3894233564049439648.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (4091 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3894233564049439648.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 103
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :103 after 197
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :197 after 273
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :273 after 1629
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1629 after 6493
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6493 after 22834
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :22834 after 100197
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :100197 after 414933
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :414933 after 984941
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :984941 after 3.1362e+07
Interrupted probabilistic random walk after 3002362 steps, run timeout after 3001 ms. (steps per millisecond=1000 ) properties seen :1 out of 2
Probabilistic random walk after 3002362 steps, saw 1261011 distinct states, run finished after 3001 ms. (steps per millisecond=1000 ) properties seen :1
[2024-05-28 06:17:35] [INFO ] Invariant cache hit.
[2024-05-28 06:17:35] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:17:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 119/119 variables, and 67 constraints, problems are : Problem set: 1 solved, 0 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 3/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 123ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 in 10359 ms.
[2024-05-28 06:17:35] [INFO ] Flatten gal took : 14 ms
[2024-05-28 06:17:35] [INFO ] Applying decomposition
[2024-05-28 06:17:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11021805458925468872.txt' '-o' '/tmp/graph11021805458925468872.bin' '-w' '/tmp/graph11021805458925468872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11021805458925468872.bin' '-l' '-1' '-v' '-w' '/tmp/graph11021805458925468872.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:17:35] [INFO ] Decomposing Gal with order
[2024-05-28 06:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:17:35] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-28 06:17:35] [INFO ] Flatten gal took : 58 ms
[2024-05-28 06:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 9 ms.
[2024-05-28 06:17:35] [INFO ] Time to serialize gal into /tmp/UpperBounds6716740823570131996.gal : 5 ms
[2024-05-28 06:17:35] [INFO ] Time to serialize properties into /tmp/UpperBounds17378007968535750244.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6716740823570131996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17378007968535750244.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17378007968535750244.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.33358e+07,12.8295,166024,1855,420,166084,9613,216,986903,54,52902,0
Total reachable state count : 43335793

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 :0 <= i0.u12.p19 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d0m18-UpperBounds-09,0,13.3644,166024,1,0,166084,12088,304,986903,73,61530,1143
Total runtime 39420 ms.

BK_STOP 1716877068980

--------------------
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-d0m18"
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-d0m18, 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-171683810600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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