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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.5K Feb 26 06:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 06:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 06:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K Feb 26 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:44 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-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678353870354

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-q8m008
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 09:24:32] [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 09:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:24:33] [INFO ] Load time of PNML (sax parser for PT used): 847 ms
[2023-03-09 09:24:33] [INFO ] Transformed 754 places.
[2023-03-09 09:24:33] [INFO ] Transformed 27370 transitions.
[2023-03-09 09:24:33] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1022 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 127 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:24:33] [INFO ] Computed 10 place invariants in 87 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :9
FORMULA BugTracking-PT-q8m008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m008-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
[2023-03-09 09:24:34] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:24:34] [INFO ] Computed 10 place invariants in 18 ms
[2023-03-09 09:24:34] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-09 09:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:35] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2023-03-09 09:24:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-09 09:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:36] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2023-03-09 09:24:36] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:24:36] [INFO ] [Nat]Added 303 Read/Feed constraints in 296 ms returned sat
[2023-03-09 09:24:37] [INFO ] Deduced a trap composed of 31 places in 763 ms of which 18 ms to minimize.
[2023-03-09 09:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 980 ms
[2023-03-09 09:24:37] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 391 ms.
[2023-03-09 09:24:38] [INFO ] Added : 7 causal constraints over 2 iterations in 969 ms. Result :sat
[2023-03-09 09:24:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:39] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-09 09:24:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:39] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-09 09:24:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 197 ms returned sat
[2023-03-09 09:24:40] [INFO ] Deduced a trap composed of 38 places in 713 ms of which 2 ms to minimize.
[2023-03-09 09:24:41] [INFO ] Deduced a trap composed of 26 places in 760 ms of which 1 ms to minimize.
[2023-03-09 09:24:42] [INFO ] Deduced a trap composed of 58 places in 528 ms of which 1 ms to minimize.
[2023-03-09 09:24:42] [INFO ] Deduced a trap composed of 58 places in 442 ms of which 1 ms to minimize.
[2023-03-09 09:24:43] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 0 ms to minimize.
[2023-03-09 09:24:43] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 1 ms to minimize.
[2023-03-09 09:24:43] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 1 ms to minimize.
[2023-03-09 09:24:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4125 ms
[2023-03-09 09:24:44] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 388 ms.
[2023-03-09 09:24:44] [INFO ] Added : 0 causal constraints over 0 iterations in 389 ms. Result :unknown
[2023-03-09 09:24:44] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:44] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-09 09:24:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:45] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-09 09:24:45] [INFO ] [Nat]Added 303 Read/Feed constraints in 350 ms returned sat
[2023-03-09 09:24:46] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 0 ms to minimize.
[2023-03-09 09:24:46] [INFO ] Deduced a trap composed of 30 places in 481 ms of which 0 ms to minimize.
[2023-03-09 09:24:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1053 ms
[2023-03-09 09:24:47] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 253 ms.
[2023-03-09 09:24:47] [INFO ] Added : 8 causal constraints over 2 iterations in 728 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 410 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:24:48] [INFO ] Computed 8 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4571 ms. (steps per millisecond=218 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 3) seen :0
[2023-03-09 09:24:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:24:58] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-09 09:24:58] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-09 09:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:59] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-09 09:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:24:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:24:59] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-09 09:24:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 243 ms returned sat
[2023-03-09 09:25:00] [INFO ] Deduced a trap composed of 19 places in 470 ms of which 1 ms to minimize.
[2023-03-09 09:25:01] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 1 ms to minimize.
[2023-03-09 09:25:01] [INFO ] Deduced a trap composed of 60 places in 261 ms of which 0 ms to minimize.
[2023-03-09 09:25:01] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 0 ms to minimize.
[2023-03-09 09:25:02] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 0 ms to minimize.
[2023-03-09 09:25:02] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 1 ms to minimize.
[2023-03-09 09:25:03] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:25:03] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 0 ms to minimize.
[2023-03-09 09:25:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3310 ms
[2023-03-09 09:25:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 275 ms.
[2023-03-09 09:25:04] [INFO ] Added : 6 causal constraints over 2 iterations in 747 ms. Result :sat
[2023-03-09 09:25:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:04] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-09 09:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:05] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-09 09:25:05] [INFO ] [Nat]Added 283 Read/Feed constraints in 170 ms returned sat
[2023-03-09 09:25:06] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 0 ms to minimize.
[2023-03-09 09:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2023-03-09 09:25:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 246 ms.
[2023-03-09 09:25:07] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 1 ms to minimize.
[2023-03-09 09:25:07] [INFO ] Deduced a trap composed of 57 places in 352 ms of which 1 ms to minimize.
[2023-03-09 09:25:08] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 2 ms to minimize.
[2023-03-09 09:25:08] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2023-03-09 09:25:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1724 ms
[2023-03-09 09:25:08] [INFO ] Added : 4 causal constraints over 1 iterations in 2347 ms. Result :sat
[2023-03-09 09:25:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:09] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-09 09:25:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:09] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-09 09:25:10] [INFO ] [Nat]Added 283 Read/Feed constraints in 218 ms returned sat
[2023-03-09 09:25:10] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 20 ms to minimize.
[2023-03-09 09:25:10] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2023-03-09 09:25:11] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 0 ms to minimize.
[2023-03-09 09:25:11] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 0 ms to minimize.
[2023-03-09 09:25:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1218 ms
[2023-03-09 09:25:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 259 ms.
[2023-03-09 09:25:12] [INFO ] Added : 9 causal constraints over 3 iterations in 762 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 134 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 110 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:25:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:12] [INFO ] Invariant cache hit.
[2023-03-09 09:25:13] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-09 09:25:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:13] [INFO ] Invariant cache hit.
[2023-03-09 09:25:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:15] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2023-03-09 09:25:15] [INFO ] Redundant transitions in 251 ms returned []
[2023-03-09 09:25:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:15] [INFO ] Invariant cache hit.
[2023-03-09 09:25:17] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4478 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:17] [INFO ] Computed 8 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
[2023-03-09 09:25:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:17] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-09 09:25:17] [INFO ] [Real]Absence check using 8 positive place invariants in 49 ms returned sat
[2023-03-09 09:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:17] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2023-03-09 09:25:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:18] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-09 09:25:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 277 ms returned sat
[2023-03-09 09:25:19] [INFO ] Deduced a trap composed of 19 places in 345 ms of which 1 ms to minimize.
[2023-03-09 09:25:19] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 0 ms to minimize.
[2023-03-09 09:25:20] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 1 ms to minimize.
[2023-03-09 09:25:20] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 0 ms to minimize.
[2023-03-09 09:25:20] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 0 ms to minimize.
[2023-03-09 09:25:21] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2023-03-09 09:25:21] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2023-03-09 09:25:22] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 4 ms to minimize.
[2023-03-09 09:25:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3200 ms
[2023-03-09 09:25:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 294 ms.
[2023-03-09 09:25:23] [INFO ] Added : 6 causal constraints over 2 iterations in 881 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:23] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5057 ms. (steps per millisecond=197 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2287 ms. (steps per millisecond=437 ) properties (out of 1) seen :0
[2023-03-09 09:25:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:30] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-09 09:25:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:31] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-09 09:25:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:31] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-09 09:25:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 257 ms returned sat
[2023-03-09 09:25:32] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 0 ms to minimize.
[2023-03-09 09:25:32] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 0 ms to minimize.
[2023-03-09 09:25:33] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 1 ms to minimize.
[2023-03-09 09:25:33] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 0 ms to minimize.
[2023-03-09 09:25:33] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 1 ms to minimize.
[2023-03-09 09:25:33] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 0 ms to minimize.
[2023-03-09 09:25:34] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 0 ms to minimize.
[2023-03-09 09:25:34] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 1 ms to minimize.
[2023-03-09 09:25:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2611 ms
[2023-03-09 09:25:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 189 ms.
[2023-03-09 09:25:35] [INFO ] Added : 6 causal constraints over 2 iterations in 607 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:25:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:35] [INFO ] Invariant cache hit.
[2023-03-09 09:25:36] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-09 09:25:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:36] [INFO ] Invariant cache hit.
[2023-03-09 09:25:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:39] [INFO ] Implicit Places using invariants and state equation in 3017 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
[2023-03-09 09:25:39] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-09 09:25:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:39] [INFO ] Invariant cache hit.
[2023-03-09 09:25:40] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5170 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-01 in 23580 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:40] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 09:25:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:40] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-09 09:25:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:41] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-09 09:25:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:41] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-09 09:25:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 113 ms returned sat
[2023-03-09 09:25:42] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 0 ms to minimize.
[2023-03-09 09:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-09 09:25:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2023-03-09 09:25:43] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 1 ms to minimize.
[2023-03-09 09:25:43] [INFO ] Deduced a trap composed of 57 places in 479 ms of which 1 ms to minimize.
[2023-03-09 09:25:44] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 1 ms to minimize.
[2023-03-09 09:25:44] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 1 ms to minimize.
[2023-03-09 09:25:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2001 ms
[2023-03-09 09:25:45] [INFO ] Added : 4 causal constraints over 1 iterations in 2733 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 96 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:45] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 4707 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 1) seen :0
[2023-03-09 09:25:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:25:52] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-09 09:25:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:52] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-09 09:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:25:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:25:53] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2023-03-09 09:25:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 157 ms returned sat
[2023-03-09 09:25:53] [INFO ] Deduced a trap composed of 91 places in 310 ms of which 0 ms to minimize.
[2023-03-09 09:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-09 09:25:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 212 ms.
[2023-03-09 09:25:54] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 0 ms to minimize.
[2023-03-09 09:25:55] [INFO ] Deduced a trap composed of 57 places in 363 ms of which 1 ms to minimize.
[2023-03-09 09:25:55] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 0 ms to minimize.
[2023-03-09 09:25:55] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 0 ms to minimize.
[2023-03-09 09:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1796 ms
[2023-03-09 09:25:56] [INFO ] Added : 4 causal constraints over 1 iterations in 2438 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:25:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:56] [INFO ] Invariant cache hit.
[2023-03-09 09:25:56] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-09 09:25:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:56] [INFO ] Invariant cache hit.
[2023-03-09 09:25:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:25:58] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
[2023-03-09 09:25:58] [INFO ] Redundant transitions in 195 ms returned []
[2023-03-09 09:25:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:25:58] [INFO ] Invariant cache hit.
[2023-03-09 09:26:00] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3833 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-06 in 19638 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:26:00] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-09 09:26:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:26:00] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-09 09:26:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:00] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-09 09:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:26:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:01] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-09 09:26:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:26:01] [INFO ] [Nat]Added 283 Read/Feed constraints in 271 ms returned sat
[2023-03-09 09:26:02] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 0 ms to minimize.
[2023-03-09 09:26:02] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 0 ms to minimize.
[2023-03-09 09:26:03] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 0 ms to minimize.
[2023-03-09 09:26:03] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2023-03-09 09:26:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1778 ms
[2023-03-09 09:26:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-09 09:26:04] [INFO ] Added : 9 causal constraints over 3 iterations in 1151 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:26:05] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 5245 ms. (steps per millisecond=190 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1988 ms. (steps per millisecond=503 ) properties (out of 1) seen :0
[2023-03-09 09:26:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:26:12] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-09 09:26:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:12] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-09 09:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:26:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:26:13] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-09 09:26:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:26:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 194 ms returned sat
[2023-03-09 09:26:14] [INFO ] Deduced a trap composed of 43 places in 374 ms of which 0 ms to minimize.
[2023-03-09 09:26:14] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 0 ms to minimize.
[2023-03-09 09:26:14] [INFO ] Deduced a trap composed of 59 places in 293 ms of which 0 ms to minimize.
[2023-03-09 09:26:15] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 0 ms to minimize.
[2023-03-09 09:26:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1569 ms
[2023-03-09 09:26:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2023-03-09 09:26:16] [INFO ] Added : 9 causal constraints over 3 iterations in 1042 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:26:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:26:16] [INFO ] Invariant cache hit.
[2023-03-09 09:26:17] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-09 09:26:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:26:17] [INFO ] Invariant cache hit.
[2023-03-09 09:26:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:26:19] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2023-03-09 09:26:19] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-09 09:26:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:26:19] [INFO ] Invariant cache hit.
[2023-03-09 09:26:20] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4083 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-13 in 20420 ms.
[2023-03-09 09:26:21] [INFO ] Flatten gal took : 467 ms
[2023-03-09 09:26:21] [INFO ] Applying decomposition
[2023-03-09 09:26:21] [INFO ] Flatten gal took : 216 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/graph11401726104510481087.txt' '-o' '/tmp/graph11401726104510481087.bin' '-w' '/tmp/graph11401726104510481087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11401726104510481087.bin' '-l' '-1' '-v' '-w' '/tmp/graph11401726104510481087.weights' '-q' '0' '-e' '0.001'
[2023-03-09 09:26:22] [INFO ] Decomposing Gal with order
[2023-03-09 09:26:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:26:22] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-09 09:26:23] [INFO ] Flatten gal took : 460 ms
[2023-03-09 09:26:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 28 ms.
[2023-03-09 09:26:23] [INFO ] Time to serialize gal into /tmp/UpperBounds152621565714488704.gal : 52 ms
[2023-03-09 09:26:23] [INFO ] Time to serialize properties into /tmp/UpperBounds11323883020950179867.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/UpperBounds152621565714488704.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11323883020950179867.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/UpperBounds11323883020950179867.prop.
Detected timeout of ITS tools.
[2023-03-09 09:47:06] [INFO ] Flatten gal took : 1384 ms
[2023-03-09 09:47:06] [INFO ] Time to serialize gal into /tmp/UpperBounds16232471952648322861.gal : 158 ms
[2023-03-09 09:47:06] [INFO ] Time to serialize properties into /tmp/UpperBounds1634998215742556544.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/UpperBounds16232471952648322861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1634998215742556544.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 ...305
Loading property file /tmp/UpperBounds1634998215742556544.prop.
Detected timeout of ITS tools.
[2023-03-09 10:07:43] [INFO ] Flatten gal took : 746 ms
[2023-03-09 10:07:48] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-09 10:07:48] [INFO ] Transformed 269 places.
[2023-03-09 10:07:48] [INFO ] Transformed 3871 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 10:07:48] [INFO ] Time to serialize gal into /tmp/UpperBounds304480157995292923.gal : 32 ms
[2023-03-09 10:07:48] [INFO ] Time to serialize properties into /tmp/UpperBounds16400054728284075166.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/UpperBounds304480157995292923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16400054728284075166.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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16400054728284075166.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4703316 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16137472 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-q8m008"
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-q8m008, 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-167813690300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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