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.r092-tall-171624189300469.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 DBSingleClientW-PT-d0m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 DBSingleClientW-PT-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716318165196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 19:02:46] [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-21 19:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:02:46] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 19:02:46] [INFO ] Transformed 553 places.
[2024-05-21 19:02:46] [INFO ] Transformed 150 transitions.
[2024-05-21 19:02:46] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2024-05-21 19:02:46] [INFO ] Computed 6 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[8, 6]
RANDOM walk for 10000 steps (2273 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 20001 steps (1977 resets) in 61 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[8, 6]
[2024-05-21 19:02:46] [INFO ] Invariant cache hit.
[2024-05-21 19:02:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 19:02:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 19:02:46] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-21 19:02:47] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 19:02:47] [INFO ] [Real]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-21 19:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2024-05-21 19:02:47] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 26 ms.
[2024-05-21 19:02:47] [INFO ] Added : 8 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 100 ms.
[2024-05-21 19:02:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Real]Added 74 Read/Feed constraints in 12 ms returned sat
[2024-05-21 19:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-21 19:02:47] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2024-05-21 19:02:47] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 12 ms to minimize.
[2024-05-21 19:02:47] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:02:47] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 5 ms to minimize.
[2024-05-21 19:02:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 810 ms
[2024-05-21 19:02:48] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2024-05-21 19:02:48] [INFO ] Added : 11 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[8, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[8, 6]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 97
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 68 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 68 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 66 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 65 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 64 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 63 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 63 transition count 74
Applied a total of 95 rules in 45 ms. Remains 63 /109 variables (removed 46) and now considering 74/150 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 63/109 places, 74/150 transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 19:02:48] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[8, 6]
RANDOM walk for 1000000 steps (228669 resets) in 711 ms. (1404 steps per ms)
BEST_FIRST walk for 2000001 steps (202930 resets) in 683 ms. (2923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[8, 6]
[2024-05-21 19:02:50] [INFO ] Invariant cache hit.
[2024-05-21 19:02:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 19:02:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:50] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2024-05-21 19:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 19:02:50] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 19:02:50] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 41 ms.
[2024-05-21 19:02:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-21 19:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 19:02:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:02:50] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 5 ms.
[2024-05-21 19:02:50] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[8, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[8, 6]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 19:02:50] [INFO ] Invariant cache hit.
[2024-05-21 19:02:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 19:02:50] [INFO ] Invariant cache hit.
[2024-05-21 19:02:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 19:02:50] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 19:02:50] [INFO ] Invariant cache hit.
[2024-05-21 19:02:50] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 86 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1179 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 73/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2028 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 3310ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3471 ms. Remains : 63/63 places, 74/74 transitions.
RANDOM walk for 40000 steps (9092 resets) in 676 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4137 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4103 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4113 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 56 ms
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:02:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3039003401482882895.gal : 6 ms
[2024-05-21 19:02:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5318386384047401257.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/ReachabilityCardinality3039003401482882895.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5318386384047401257.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/ReachabilityCardinality5318386384047401257.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 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 74
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :74 after 184
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :184 after 400
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :400 after 996
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :996 after 5666
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5666 after 15662
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15662 after 57086
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :57086 after 122221
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :122221 after 493886
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :493886 after 824611
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :824611 after 1.34044e+06
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.34044e+06 after 3.25028e+06
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,6.32593e+06,2.21781,62836,2,11515,20,222651,9,0,331,253743,0
Total reachable state count : 6325930

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,2.22056,62836,1,0,20,222651,9,0,332,253743,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,307684,2.22289,62836,2,5200,20,222651,10,0,334,253743,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.22391,62836,1,0,20,222651,10,0,334,253743,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,5676,2.2246,62836,2,318,20,222651,10,0,335,253743,0
Interrupted probabilistic random walk after 1174267 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :2 out of 4
Probabilistic random walk after 1174267 steps, saw 458853 distinct states, run finished after 3004 ms. (steps per millisecond=390 ) properties seen :2
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[8, 6]
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-21 19:02:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2286 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (1048 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 19:02:57] [INFO ] Invariant cache hit.
[2024-05-21 19:02:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 19:02:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:57] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 19:02:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-21 19:02:57] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 19:02:57] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 72
Applied a total of 3 rules in 13 ms. Remains 62 /63 variables (removed 1) and now considering 72/74 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 62/63 places, 72/74 transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-21 19:02:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (228908 resets) in 608 ms. (1642 steps per ms)
BEST_FIRST walk for 1000000 steps (101407 resets) in 300 ms. (3322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-21 19:02:58] [INFO ] Invariant cache hit.
[2024-05-21 19:02:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 19:02:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:58] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:02:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:02:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:02:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 19:02:58] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:02:58] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 5 ms.
[2024-05-21 19:02:58] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-21 19:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-21 19:02:58] [INFO ] Added : 10 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-21 19:02:58] [INFO ] Invariant cache hit.
[2024-05-21 19:02:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:02:59] [INFO ] Invariant cache hit.
[2024-05-21 19:02:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:59] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-21 19:02:59] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 19:02:59] [INFO ] Invariant cache hit.
[2024-05-21 19:02:59] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 85 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1043 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 156 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1757 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2856ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2992 ms. Remains : 62/62 places, 72/72 transitions.
[2024-05-21 19:03:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (229268 resets) in 597 ms. (1672 steps per ms)
BEST_FIRST walk for 1000001 steps (101005 resets) in 303 ms. (3289 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-05-21 19:03:02] [INFO ] Invariant cache hit.
[2024-05-21 19:03:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 19:03:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:03:02] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:03:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:02] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-21 19:03:02] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 19:03:02] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 5 ms.
[2024-05-21 19:03:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-21 19:03:03] [INFO ] Added : 10 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-21 19:03:03] [INFO ] Invariant cache hit.
[2024-05-21 19:03:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:03:03] [INFO ] Invariant cache hit.
[2024-05-21 19:03:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:03:03] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-21 19:03:03] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 19:03:03] [INFO ] Invariant cache hit.
[2024-05-21 19:03:03] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 85 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1023 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 156 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1818 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2889ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2890ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3035 ms. Remains : 62/62 places, 72/72 transitions.
[2024-05-21 19:03:06] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 40000 steps (9202 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2024-05-21 19:03:06] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:03:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1099919520914001792.gal : 2 ms
[2024-05-21 19:03:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2007445780087834172.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/ReachabilityCardinality1099919520914001792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2007445780087834172.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/ReachabilityCardinality2007445780087834172.prop.
SDD proceeding with computation,2 properties remain. new max is 4
BEST_FIRST walk for 40004 steps (4022 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 98
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :98 after 202
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :202 after 382
BEST_FIRST walk for 40002 steps (4140 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :382 after 684
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :684 after 6957
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6957 after 16532
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :16532 after 93097
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :93097 after 206722
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :206722 after 800840
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :800840 after 2.65158e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.65158e+06 after 4.57922e+06
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,6.27235e+06,1.82751,58264,2,11172,20,199601,7,0,323,253793,0
Total reachable state count : 6272350

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,1.82837,58264,1,0,20,199601,7,0,324,253793,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,83252,1.83159,58264,2,3746,20,199601,8,0,326,253793,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 3460783 steps, run timeout after 3001 ms. (steps per millisecond=1153 ) properties seen :1 out of 2
Probabilistic random walk after 3460783 steps, saw 1308215 distinct states, run finished after 3001 ms. (steps per millisecond=1153 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00 in 11679 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 19:03:09] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2299 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (1038 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 19:03:09] [INFO ] Invariant cache hit.
[2024-05-21 19:03:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 19:03:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:03:09] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 19:03:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:03:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 19:03:09] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:03:09] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 19:03:09] [INFO ] Added : 9 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 58 transition count 65
Applied a total of 12 rules in 20 ms. Remains 58 /63 variables (removed 5) and now considering 65/74 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 58/63 places, 65/74 transitions.
// Phase 1: matrix 65 rows 58 cols
[2024-05-21 19:03:09] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229073 resets) in 543 ms. (1838 steps per ms)
BEST_FIRST walk for 1000000 steps (101311 resets) in 284 ms. (3508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 19:03:10] [INFO ] Invariant cache hit.
[2024-05-21 19:03:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 19:03:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 19:03:10] [INFO ] [Real]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:03:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:03:10] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 19:03:10] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 19:03:10] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 4 ms.
[2024-05-21 19:03:10] [INFO ] Added : 9 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 19:03:10] [INFO ] Invariant cache hit.
[2024-05-21 19:03:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:03:10] [INFO ] Invariant cache hit.
[2024-05-21 19:03:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 19:03:10] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-21 19:03:10] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 19:03:10] [INFO ] Invariant cache hit.
[2024-05-21 19:03:10] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 79 constraints, problems are : Problem set: 0 solved, 64 unsolved in 854 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 143 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1506 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2394ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2503 ms. Remains : 58/58 places, 65/65 transitions.
[2024-05-21 19:03:13] [INFO ] Flatten gal took : 24 ms
[2024-05-21 19:03:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:03:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15342991667479282385.gal : 1 ms
[2024-05-21 19:03:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5470403460436989799.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/ReachabilityCardinality15342991667479282385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5470403460436989799.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
Loading property file /tmp/ReachabilityCardinality5470403460436989799.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 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 126
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :126 after 346
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :346 after 684
RANDOM walk for 40000 steps (9204 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4094 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :684 after 3840
BEST_FIRST walk for 40001 steps (4015 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3840 after 11088
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11088 after 41498
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :41498 after 81206
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :81206 after 178922
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :178922 after 637954
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :637954 after 1.68238e+06
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,2.30416e+06,0.640869,27924,2,8552,17,92799,8,0,301,95133,0
Total reachable state count : 2304158

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,0.641905,27924,1,0,17,92799,8,0,302,95133,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,1926,0.642533,27924,2,279,17,92799,8,0,303,95133,0
Interrupted probabilistic random walk after 3653264 steps, run timeout after 3001 ms. (steps per millisecond=1217 ) properties seen :1 out of 2
Probabilistic random walk after 3653264 steps, saw 1431701 distinct states, run finished after 3001 ms. (steps per millisecond=1217 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06 in 6801 ms.
[2024-05-21 19:03:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:03:16] [INFO ] Applying decomposition
[2024-05-21 19:03:16] [INFO ] Flatten gal took : 5 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/graph15201705789686543658.txt' '-o' '/tmp/graph15201705789686543658.bin' '-w' '/tmp/graph15201705789686543658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15201705789686543658.bin' '-l' '-1' '-v' '-w' '/tmp/graph15201705789686543658.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:03:16] [INFO ] Decomposing Gal with order
[2024-05-21 19:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:03:16] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 19:03:16] [INFO ] Flatten gal took : 31 ms
[2024-05-21 19:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 7 ms.
[2024-05-21 19:03:16] [INFO ] Time to serialize gal into /tmp/UpperBounds11856812977096618714.gal : 3 ms
[2024-05-21 19:03:16] [INFO ] Time to serialize properties into /tmp/UpperBounds11774928983963288686.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/UpperBounds11856812977096618714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11774928983963288686.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 ...285
Loading property file /tmp/UpperBounds11774928983963288686.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,6.32593e+06,37.0512,680588,1337,878,282034,128764,248,6.79674e+06,90,1.25591e+06,0
Total reachable state count : 6325930

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-00 :0 <= i5.u11.l487 <= 5
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-00 5 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
DBSingleClientW-PT-d0m08-UpperBounds-00,0,37.2234,680588,1,0,282034,128764,321,6.79674e+06,117,1.25591e+06,1438
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-06 :0 <= i1.u1.p33 <= 1
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 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
DBSingleClientW-PT-d0m08-UpperBounds-06,0,37.2459,680588,1,0,282034,128764,345,6.79674e+06,122,1.25591e+06,1946
Total runtime 67263 ms.

BK_STOP 1716318233642

--------------------
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="DBSingleClientW-PT-d0m08"
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 DBSingleClientW-PT-d0m08, 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 r092-tall-171624189300469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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