Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690200357.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BugTracking-PT-q3m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690200357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Feb 26 06:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 26 06:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 06:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q3m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678348291545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 07:51:33] [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]
[2023-03-09 07:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:51:34] [INFO ] Load time of PNML (sax parser for PT used): 808 ms
[2023-03-09 07:51:34] [INFO ] Transformed 754 places.
[2023-03-09 07:51:34] [INFO ] Transformed 27370 transitions.
[2023-03-09 07:51:34] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1001 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 156 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 07:51:34] [INFO ] Computed 10 place invariants in 50 ms
FORMULA BugTracking-PT-q3m032-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 12 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :5
FORMULA BugTracking-PT-q3m032-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m032-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m032-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
[2023-03-09 07:51:35] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 07:51:35] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-09 07:51:35] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-09 07:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:35] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-09 07:51:35] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 07:51:35] [INFO ] [Real]Added 255 Read/Feed constraints in 35 ms returned sat
[2023-03-09 07:51:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:51:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-09 07:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:36] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2023-03-09 07:51:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 89 ms returned sat
[2023-03-09 07:51:37] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 12 ms to minimize.
[2023-03-09 07:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 677 ms
[2023-03-09 07:51:37] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 430 ms.
[2023-03-09 07:51:38] [INFO ] Added : 5 causal constraints over 1 iterations in 744 ms. Result :sat
Minimization took 181 ms.
[2023-03-09 07:51:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:38] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-09 07:51:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:51:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 07:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:39] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-09 07:51:39] [INFO ] [Nat]Added 255 Read/Feed constraints in 173 ms returned sat
[2023-03-09 07:51:39] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2023-03-09 07:51:39] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 9 ms to minimize.
[2023-03-09 07:51:40] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2023-03-09 07:51:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2023-03-09 07:51:40] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 148 ms.
[2023-03-09 07:51:40] [INFO ] Added : 9 causal constraints over 2 iterations in 630 ms. Result :sat
Minimization took 614 ms.
[2023-03-09 07:51:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:42] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-09 07:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:51:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:42] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-09 07:51:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 134 ms returned sat
[2023-03-09 07:51:43] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 1 ms to minimize.
[2023-03-09 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2023-03-09 07:51:43] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 221 ms.
[2023-03-09 07:51:43] [INFO ] Added : 4 causal constraints over 1 iterations in 489 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 0, 0]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 408 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:51:44] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 2126 ms. (steps per millisecond=470 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2118 ms. (steps per millisecond=472 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2100 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
[2023-03-09 07:51:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:51:53] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-09 07:51:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:53] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-09 07:51:53] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:51:53] [INFO ] [Real]Added 241 Read/Feed constraints in 49 ms returned sat
[2023-03-09 07:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:51:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:54] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-09 07:51:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 119 ms returned sat
[2023-03-09 07:51:54] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 1 ms to minimize.
[2023-03-09 07:51:55] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 0 ms to minimize.
[2023-03-09 07:51:55] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 1 ms to minimize.
[2023-03-09 07:51:56] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 0 ms to minimize.
[2023-03-09 07:51:56] [INFO ] Deduced a trap composed of 87 places in 315 ms of which 0 ms to minimize.
[2023-03-09 07:51:56] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 0 ms to minimize.
[2023-03-09 07:51:57] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 0 ms to minimize.
[2023-03-09 07:51:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2970 ms
[2023-03-09 07:51:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 175 ms.
[2023-03-09 07:51:57] [INFO ] Added : 2 causal constraints over 1 iterations in 382 ms. Result :sat
Minimization took 350 ms.
[2023-03-09 07:51:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:58] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-09 07:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:51:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:51:59] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-09 07:51:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 179 ms returned sat
[2023-03-09 07:51:59] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 0 ms to minimize.
[2023-03-09 07:52:00] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 0 ms to minimize.
[2023-03-09 07:52:00] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 0 ms to minimize.
[2023-03-09 07:52:00] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 0 ms to minimize.
[2023-03-09 07:52:01] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 0 ms to minimize.
[2023-03-09 07:52:01] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 1 ms to minimize.
[2023-03-09 07:52:01] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2023-03-09 07:52:02] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 0 ms to minimize.
[2023-03-09 07:52:02] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 0 ms to minimize.
[2023-03-09 07:52:02] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 1 ms to minimize.
[2023-03-09 07:52:03] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 0 ms to minimize.
[2023-03-09 07:52:03] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 0 ms to minimize.
[2023-03-09 07:52:03] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 1 ms to minimize.
[2023-03-09 07:52:03] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 1 ms to minimize.
[2023-03-09 07:52:04] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 1 ms to minimize.
[2023-03-09 07:52:04] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2023-03-09 07:52:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5100 ms
[2023-03-09 07:52:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 155 ms.
[2023-03-09 07:52:05] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 0 ms to minimize.
[2023-03-09 07:52:05] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 0 ms to minimize.
[2023-03-09 07:52:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-09 07:52:05] [INFO ] Added : 6 causal constraints over 2 iterations in 1295 ms. Result :sat
Minimization took 3012 ms.
[2023-03-09 07:52:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:09] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-09 07:52:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:09] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-09 07:52:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2023-03-09 07:52:10] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 0 ms to minimize.
[2023-03-09 07:52:10] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-09 07:52:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-09 07:52:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 154 ms.
[2023-03-09 07:52:10] [INFO ] Added : 6 causal constraints over 2 iterations in 516 ms. Result :sat
Minimization took 619 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[3, 0, 0]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 74 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 56 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:52:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:12] [INFO ] Invariant cache hit.
[2023-03-09 07:52:13] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2023-03-09 07:52:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:13] [INFO ] Invariant cache hit.
[2023-03-09 07:52:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:52:15] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 3292 ms to find 0 implicit places.
[2023-03-09 07:52:16] [INFO ] Redundant transitions in 303 ms returned []
[2023-03-09 07:52:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:16] [INFO ] Invariant cache hit.
[2023-03-09 07:52:16] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4542 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:16] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1794 ms. (steps per millisecond=557 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2370 ms. (steps per millisecond=421 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties (out of 3) seen :1
[2023-03-09 07:52:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:25] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-09 07:52:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 07:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:25] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-09 07:52:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:52:25] [INFO ] [Real]Added 241 Read/Feed constraints in 46 ms returned sat
[2023-03-09 07:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:26] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-09 07:52:26] [INFO ] [Nat]Added 241 Read/Feed constraints in 130 ms returned sat
[2023-03-09 07:52:27] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 1 ms to minimize.
[2023-03-09 07:52:27] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2023-03-09 07:52:27] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 2 ms to minimize.
[2023-03-09 07:52:28] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 0 ms to minimize.
[2023-03-09 07:52:28] [INFO ] Deduced a trap composed of 87 places in 275 ms of which 1 ms to minimize.
[2023-03-09 07:52:28] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 1 ms to minimize.
[2023-03-09 07:52:29] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2023-03-09 07:52:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2572 ms
[2023-03-09 07:52:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 154 ms.
[2023-03-09 07:52:29] [INFO ] Added : 2 causal constraints over 1 iterations in 458 ms. Result :sat
Minimization took 381 ms.
[2023-03-09 07:52:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:30] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-09 07:52:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:31] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-09 07:52:31] [INFO ] [Nat]Added 241 Read/Feed constraints in 162 ms returned sat
[2023-03-09 07:52:31] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 0 ms to minimize.
[2023-03-09 07:52:31] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 1 ms to minimize.
[2023-03-09 07:52:32] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 0 ms to minimize.
[2023-03-09 07:52:32] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 0 ms to minimize.
[2023-03-09 07:52:32] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 1 ms to minimize.
[2023-03-09 07:52:33] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-09 07:52:33] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 1 ms to minimize.
[2023-03-09 07:52:33] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2023-03-09 07:52:34] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 1 ms to minimize.
[2023-03-09 07:52:34] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2023-03-09 07:52:34] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 0 ms to minimize.
[2023-03-09 07:52:35] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 1 ms to minimize.
[2023-03-09 07:52:35] [INFO ] Deduced a trap composed of 57 places in 253 ms of which 1 ms to minimize.
[2023-03-09 07:52:35] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 0 ms to minimize.
[2023-03-09 07:52:35] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 0 ms to minimize.
[2023-03-09 07:52:36] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-09 07:52:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4987 ms
[2023-03-09 07:52:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 131 ms.
[2023-03-09 07:52:37] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 14 ms to minimize.
[2023-03-09 07:52:37] [INFO ] Deduced a trap composed of 83 places in 373 ms of which 1 ms to minimize.
[2023-03-09 07:52:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1043 ms
[2023-03-09 07:52:37] [INFO ] Added : 6 causal constraints over 2 iterations in 1644 ms. Result :sat
Minimization took 3027 ms.
[2023-03-09 07:52:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:41] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2023-03-09 07:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:41] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-09 07:52:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 123 ms returned sat
[2023-03-09 07:52:42] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2023-03-09 07:52:42] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-09 07:52:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-09 07:52:42] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 158 ms.
[2023-03-09 07:52:42] [INFO ] Added : 6 causal constraints over 2 iterations in 570 ms. Result :sat
Minimization took 396 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[3, 0, 0]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:52:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:43] [INFO ] Invariant cache hit.
[2023-03-09 07:52:44] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-09 07:52:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:44] [INFO ] Invariant cache hit.
[2023-03-09 07:52:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:52:46] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2023-03-09 07:52:46] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-09 07:52:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:46] [INFO ] Invariant cache hit.
[2023-03-09 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3593 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:47] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :2
[2023-03-09 07:52:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:47] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 07:52:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:47] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2023-03-09 07:52:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:52:47] [INFO ] [Real]Added 241 Read/Feed constraints in 66 ms returned sat
[2023-03-09 07:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 07:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:48] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-09 07:52:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 147 ms returned sat
[2023-03-09 07:52:48] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 1 ms to minimize.
[2023-03-09 07:52:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-09 07:52:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 148 ms.
[2023-03-09 07:52:49] [INFO ] Added : 4 causal constraints over 2 iterations in 570 ms. Result :sat
Minimization took 293 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:50] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 1705 ms. (steps per millisecond=586 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :4
[2023-03-09 07:52:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:52:53] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-09 07:52:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:54] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-09 07:52:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:52:54] [INFO ] [Real]Added 241 Read/Feed constraints in 78 ms returned sat
[2023-03-09 07:52:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:52:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:52:54] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-09 07:52:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 128 ms returned sat
[2023-03-09 07:52:55] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 0 ms to minimize.
[2023-03-09 07:52:55] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 0 ms to minimize.
[2023-03-09 07:52:56] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 0 ms to minimize.
[2023-03-09 07:52:56] [INFO ] Deduced a trap composed of 52 places in 316 ms of which 0 ms to minimize.
[2023-03-09 07:52:56] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 2 ms to minimize.
[2023-03-09 07:52:57] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 1 ms to minimize.
[2023-03-09 07:52:57] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 2 ms to minimize.
[2023-03-09 07:52:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2662 ms
[2023-03-09 07:52:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 161 ms.
[2023-03-09 07:52:57] [INFO ] Added : 2 causal constraints over 1 iterations in 370 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:52:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:58] [INFO ] Invariant cache hit.
[2023-03-09 07:52:59] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-09 07:52:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:52:59] [INFO ] Invariant cache hit.
[2023-03-09 07:52:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:01] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-09 07:53:01] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-09 07:53:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:01] [INFO ] Invariant cache hit.
[2023-03-09 07:53:02] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3520 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:02] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1465 ms. (steps per millisecond=682 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2202 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
[2023-03-09 07:53:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:05] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 07:53:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:06] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-09 07:53:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:06] [INFO ] [Real]Added 241 Read/Feed constraints in 60 ms returned sat
[2023-03-09 07:53:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:53:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:06] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-09 07:53:06] [INFO ] [Nat]Added 241 Read/Feed constraints in 91 ms returned sat
[2023-03-09 07:53:07] [INFO ] Deduced a trap composed of 20 places in 357 ms of which 11 ms to minimize.
[2023-03-09 07:53:07] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 2 ms to minimize.
[2023-03-09 07:53:07] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 0 ms to minimize.
[2023-03-09 07:53:08] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 1 ms to minimize.
[2023-03-09 07:53:08] [INFO ] Deduced a trap composed of 87 places in 267 ms of which 0 ms to minimize.
[2023-03-09 07:53:08] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 0 ms to minimize.
[2023-03-09 07:53:09] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 0 ms to minimize.
[2023-03-09 07:53:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2398 ms
[2023-03-09 07:53:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2023-03-09 07:53:09] [INFO ] Added : 2 causal constraints over 1 iterations in 370 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:53:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:10] [INFO ] Invariant cache hit.
[2023-03-09 07:53:10] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-09 07:53:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:10] [INFO ] Invariant cache hit.
[2023-03-09 07:53:10] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:12] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2023-03-09 07:53:12] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-09 07:53:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:12] [INFO ] Invariant cache hit.
[2023-03-09 07:53:13] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2978 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-01 in 25932 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:13] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-09 07:53:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:13] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-09 07:53:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 07:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:13] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-09 07:53:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:53:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:14] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-09 07:53:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2023-03-09 07:53:14] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 0 ms to minimize.
[2023-03-09 07:53:14] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2023-03-09 07:53:15] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 0 ms to minimize.
[2023-03-09 07:53:15] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 1 ms to minimize.
[2023-03-09 07:53:15] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 0 ms to minimize.
[2023-03-09 07:53:16] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2023-03-09 07:53:16] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 0 ms to minimize.
[2023-03-09 07:53:16] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2023-03-09 07:53:17] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 0 ms to minimize.
[2023-03-09 07:53:17] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 1 ms to minimize.
[2023-03-09 07:53:17] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 1 ms to minimize.
[2023-03-09 07:53:17] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2023-03-09 07:53:18] [INFO ] Deduced a trap composed of 57 places in 230 ms of which 0 ms to minimize.
[2023-03-09 07:53:18] [INFO ] Deduced a trap composed of 59 places in 252 ms of which 1 ms to minimize.
[2023-03-09 07:53:18] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 0 ms to minimize.
[2023-03-09 07:53:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 74 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:18] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000020 steps, including 2 resets, run finished after 1500 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2301 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2023-03-09 07:53:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:22] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-09 07:53:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:23] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-09 07:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:53:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:23] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-09 07:53:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 170 ms returned sat
[2023-03-09 07:53:24] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 0 ms to minimize.
[2023-03-09 07:53:24] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 0 ms to minimize.
[2023-03-09 07:53:24] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 0 ms to minimize.
[2023-03-09 07:53:25] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2023-03-09 07:53:25] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 0 ms to minimize.
[2023-03-09 07:53:25] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-09 07:53:26] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 0 ms to minimize.
[2023-03-09 07:53:26] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 0 ms to minimize.
[2023-03-09 07:53:26] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 1 ms to minimize.
[2023-03-09 07:53:27] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 0 ms to minimize.
[2023-03-09 07:53:27] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 1 ms to minimize.
[2023-03-09 07:53:27] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 0 ms to minimize.
[2023-03-09 07:53:27] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 1 ms to minimize.
[2023-03-09 07:53:28] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 0 ms to minimize.
[2023-03-09 07:53:28] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-09 07:53:28] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-09 07:53:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4773 ms
[2023-03-09 07:53:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 131 ms.
[2023-03-09 07:53:29] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 0 ms to minimize.
[2023-03-09 07:53:29] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 0 ms to minimize.
[2023-03-09 07:53:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 676 ms
[2023-03-09 07:53:29] [INFO ] Added : 6 causal constraints over 2 iterations in 1103 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 61 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:53:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:32] [INFO ] Invariant cache hit.
[2023-03-09 07:53:33] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 07:53:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:33] [INFO ] Invariant cache hit.
[2023-03-09 07:53:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:34] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-09 07:53:34] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-09 07:53:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:34] [INFO ] Invariant cache hit.
[2023-03-09 07:53:35] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2700 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-04 in 22353 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:35] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-09 07:53:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:35] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-09 07:53:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:35] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-09 07:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:53:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:36] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-09 07:53:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:36] [INFO ] [Nat]Added 241 Read/Feed constraints in 131 ms returned sat
[2023-03-09 07:53:36] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-09 07:53:36] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-09 07:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-09 07:53:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 139 ms.
[2023-03-09 07:53:37] [INFO ] Added : 6 causal constraints over 2 iterations in 442 ms. Result :sat
Minimization took 360 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:38] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2133 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
[2023-03-09 07:53:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:53:41] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 07:53:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:42] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-09 07:53:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:53:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 07:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:53:42] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-09 07:53:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 127 ms returned sat
[2023-03-09 07:53:43] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2023-03-09 07:53:43] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-09 07:53:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
[2023-03-09 07:53:43] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 181 ms.
[2023-03-09 07:53:43] [INFO ] Added : 6 causal constraints over 2 iterations in 550 ms. Result :sat
Minimization took 542 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:53:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:44] [INFO ] Invariant cache hit.
[2023-03-09 07:53:45] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-09 07:53:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:45] [INFO ] Invariant cache hit.
[2023-03-09 07:53:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:53:46] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2023-03-09 07:53:46] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-09 07:53:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:53:46] [INFO ] Invariant cache hit.
[2023-03-09 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2670 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-08 in 12001 ms.
[2023-03-09 07:53:48] [INFO ] Flatten gal took : 451 ms
[2023-03-09 07:53:48] [INFO ] Applying decomposition
[2023-03-09 07:53:48] [INFO ] Flatten gal took : 249 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2999806446473217253.txt' '-o' '/tmp/graph2999806446473217253.bin' '-w' '/tmp/graph2999806446473217253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2999806446473217253.bin' '-l' '-1' '-v' '-w' '/tmp/graph2999806446473217253.weights' '-q' '0' '-e' '0.001'
[2023-03-09 07:53:49] [INFO ] Decomposing Gal with order
[2023-03-09 07:53:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 07:53:49] [INFO ] Removed a total of 280 redundant transitions.
[2023-03-09 07:53:49] [INFO ] Flatten gal took : 378 ms
[2023-03-09 07:53:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 32 ms.
[2023-03-09 07:53:50] [INFO ] Time to serialize gal into /tmp/UpperBounds3444954329651021185.gal : 102 ms
[2023-03-09 07:53:50] [INFO ] Time to serialize properties into /tmp/UpperBounds4290959933046256405.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3444954329651021185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4290959933046256405.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4290959933046256405.prop.
Detected timeout of ITS tools.
[2023-03-09 08:14:39] [INFO ] Flatten gal took : 1059 ms
[2023-03-09 08:14:40] [INFO ] Time to serialize gal into /tmp/UpperBounds16977302715849231115.gal : 118 ms
[2023-03-09 08:14:40] [INFO ] Time to serialize properties into /tmp/UpperBounds17656359396428953075.prop : 2 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16977302715849231115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17656359396428953075.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17656359396428953075.prop.
Detected timeout of ITS tools.
[2023-03-09 08:35:25] [INFO ] Flatten gal took : 609 ms
[2023-03-09 08:35:28] [INFO ] Input system was already deterministic with 2747 transitions.
[2023-03-09 08:35:28] [INFO ] Transformed 229 places.
[2023-03-09 08:35:28] [INFO ] Transformed 2747 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 08:35:28] [INFO ] Time to serialize gal into /tmp/UpperBounds13468691508235178582.gal : 24 ms
[2023-03-09 08:35:28] [INFO ] Time to serialize properties into /tmp/UpperBounds5971922219916237779.prop : 2 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13468691508235178582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5971922219916237779.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5971922219916237779.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 3127684 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16187728 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="BugTracking-PT-q3m032"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m032, 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 r037-tajo-167813690200357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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