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.r041-tajo-167813694600357.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 ltsminxred
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 r041-tajo-167813694600357
=====================================================================

--------------------
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 1678629306381

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:55:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:55:10] [INFO ] Load time of PNML (sax parser for PT used): 1138 ms
[2023-03-12 13:55:10] [INFO ] Transformed 754 places.
[2023-03-12 13:55:10] [INFO ] Transformed 27370 transitions.
[2023-03-12 13:55:10] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1504 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 514 places in 210 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-12 13:55:11] [INFO ] Computed 10 place invariants in 50 ms
FORMULA BugTracking-PT-q3m032-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 12 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :2
FORMULA BugTracking-PT-q3m032-UpperBounds-10 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 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :4
FORMULA BugTracking-PT-q3m032-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 13:55:11] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 13:55:11] [INFO ] Computed 10 place invariants in 27 ms
[2023-03-12 13:55:12] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-12 13:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:13] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2023-03-12 13:55:13] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 13:55:13] [INFO ] [Real]Added 255 Read/Feed constraints in 79 ms returned sat
[2023-03-12 13:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 93 ms returned sat
[2023-03-12 13:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:14] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-12 13:55:14] [INFO ] [Nat]Added 255 Read/Feed constraints in 151 ms returned sat
[2023-03-12 13:55:14] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 6 ms to minimize.
[2023-03-12 13:55:15] [INFO ] Deduced a trap composed of 29 places in 528 ms of which 1 ms to minimize.
[2023-03-12 13:55:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1237 ms
[2023-03-12 13:55:16] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 521 ms.
[2023-03-12 13:55:16] [INFO ] Added : 4 causal constraints over 1 iterations in 912 ms. Result :sat
Minimization took 275 ms.
[2023-03-12 13:55:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:17] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-12 13:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:18] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-12 13:55:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 203 ms returned sat
[2023-03-12 13:55:18] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 2 ms to minimize.
[2023-03-12 13:55:18] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 2 ms to minimize.
[2023-03-12 13:55:19] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 0 ms to minimize.
[2023-03-12 13:55:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1010 ms
[2023-03-12 13:55:19] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 286 ms.
[2023-03-12 13:55:20] [INFO ] Added : 9 causal constraints over 2 iterations in 794 ms. Result :sat
Minimization took 540 ms.
[2023-03-12 13:55:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:21] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-12 13:55:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 13:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:21] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-12 13:55:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 105 ms returned sat
[2023-03-12 13:55:22] [INFO ] Deduced a trap composed of 59 places in 489 ms of which 0 ms to minimize.
[2023-03-12 13:55:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2023-03-12 13:55:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 238 ms.
[2023-03-12 13:55:23] [INFO ] Added : 4 causal constraints over 1 iterations in 585 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 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.13 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 3 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 337 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 339 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-12 13:55:24] [INFO ] Computed 8 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2201 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2218 ms. (steps per millisecond=450 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2499 ms. (steps per millisecond=400 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2354 ms. (steps per millisecond=424 ) properties (out of 3) seen :1
[2023-03-12 13:55:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:55:33] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-12 13:55:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:34] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-12 13:55:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:55:34] [INFO ] [Real]Added 241 Read/Feed constraints in 154 ms returned sat
[2023-03-12 13:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:34] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-12 13:55:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 101 ms returned sat
[2023-03-12 13:55:35] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 1 ms to minimize.
[2023-03-12 13:55:36] [INFO ] Deduced a trap composed of 10 places in 466 ms of which 2 ms to minimize.
[2023-03-12 13:55:36] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 0 ms to minimize.
[2023-03-12 13:55:37] [INFO ] Deduced a trap composed of 52 places in 491 ms of which 0 ms to minimize.
[2023-03-12 13:55:37] [INFO ] Deduced a trap composed of 87 places in 649 ms of which 1 ms to minimize.
[2023-03-12 13:55:38] [INFO ] Deduced a trap composed of 47 places in 576 ms of which 0 ms to minimize.
[2023-03-12 13:55:39] [INFO ] Deduced a trap composed of 13 places in 572 ms of which 0 ms to minimize.
[2023-03-12 13:55:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4267 ms
[2023-03-12 13:55:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 250 ms.
[2023-03-12 13:55:39] [INFO ] Added : 2 causal constraints over 1 iterations in 562 ms. Result :sat
Minimization took 359 ms.
[2023-03-12 13:55:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:41] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2023-03-12 13:55:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:41] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-12 13:55:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 214 ms returned sat
[2023-03-12 13:55:42] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 0 ms to minimize.
[2023-03-12 13:55:42] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 1 ms to minimize.
[2023-03-12 13:55:43] [INFO ] Deduced a trap composed of 48 places in 412 ms of which 1 ms to minimize.
[2023-03-12 13:55:43] [INFO ] Deduced a trap composed of 48 places in 416 ms of which 1 ms to minimize.
[2023-03-12 13:55:44] [INFO ] Deduced a trap composed of 49 places in 626 ms of which 0 ms to minimize.
[2023-03-12 13:55:45] [INFO ] Deduced a trap composed of 36 places in 526 ms of which 1 ms to minimize.
[2023-03-12 13:55:45] [INFO ] Deduced a trap composed of 21 places in 605 ms of which 1 ms to minimize.
[2023-03-12 13:55:46] [INFO ] Deduced a trap composed of 22 places in 452 ms of which 1 ms to minimize.
[2023-03-12 13:55:47] [INFO ] Deduced a trap composed of 48 places in 553 ms of which 1 ms to minimize.
[2023-03-12 13:55:47] [INFO ] Deduced a trap composed of 50 places in 376 ms of which 1 ms to minimize.
[2023-03-12 13:55:48] [INFO ] Deduced a trap composed of 50 places in 504 ms of which 1 ms to minimize.
[2023-03-12 13:55:48] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 0 ms to minimize.
[2023-03-12 13:55:49] [INFO ] Deduced a trap composed of 57 places in 480 ms of which 0 ms to minimize.
[2023-03-12 13:55:49] [INFO ] Deduced a trap composed of 59 places in 552 ms of which 0 ms to minimize.
[2023-03-12 13:55:50] [INFO ] Deduced a trap composed of 27 places in 518 ms of which 1 ms to minimize.
[2023-03-12 13:55:50] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2023-03-12 13:55:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9200 ms
[2023-03-12 13:55:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 239 ms.
[2023-03-12 13:55:52] [INFO ] Deduced a trap composed of 49 places in 625 ms of which 0 ms to minimize.
[2023-03-12 13:55:52] [INFO ] Deduced a trap composed of 83 places in 495 ms of which 1 ms to minimize.
[2023-03-12 13:55:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1418 ms
[2023-03-12 13:55:53] [INFO ] Added : 6 causal constraints over 2 iterations in 2196 ms. Result :sat
Minimization took 3015 ms.
[2023-03-12 13:55:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:56] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-12 13:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:55:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 13:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:55:57] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-12 13:55:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 220 ms returned sat
[2023-03-12 13:55:57] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 0 ms to minimize.
[2023-03-12 13:55:58] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-12 13:55:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 843 ms
[2023-03-12 13:55:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 241 ms.
[2023-03-12 13:55:59] [INFO ] Added : 6 causal constraints over 2 iterations in 664 ms. Result :sat
Minimization took 546 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[6, 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 93 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 93 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 94 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:56:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:00] [INFO ] Invariant cache hit.
[2023-03-12 13:56:01] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-12 13:56:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:01] [INFO ] Invariant cache hit.
[2023-03-12 13:56:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:56:04] [INFO ] Implicit Places using invariants and state equation in 2950 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2023-03-12 13:56:04] [INFO ] Redundant transitions in 278 ms returned []
[2023-03-12 13:56:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:04] [INFO ] Invariant cache hit.
[2023-03-12 13:56:05] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4996 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-12 13:56:05] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
[2023-03-12 13:56:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:56:14] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:56:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:17] [INFO ] [Real]Absence check using state equation in 2505 ms returned sat
[2023-03-12 13:56:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:56:17] [INFO ] [Real]Added 241 Read/Feed constraints in 106 ms returned sat
[2023-03-12 13:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:56:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:17] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-12 13:56:17] [INFO ] [Nat]Added 241 Read/Feed constraints in 133 ms returned sat
[2023-03-12 13:56:18] [INFO ] Deduced a trap composed of 20 places in 494 ms of which 2 ms to minimize.
[2023-03-12 13:56:18] [INFO ] Deduced a trap composed of 10 places in 444 ms of which 5 ms to minimize.
[2023-03-12 13:56:19] [INFO ] Deduced a trap composed of 22 places in 465 ms of which 0 ms to minimize.
[2023-03-12 13:56:20] [INFO ] Deduced a trap composed of 52 places in 494 ms of which 1 ms to minimize.
[2023-03-12 13:56:20] [INFO ] Deduced a trap composed of 87 places in 704 ms of which 0 ms to minimize.
[2023-03-12 13:56:21] [INFO ] Deduced a trap composed of 47 places in 428 ms of which 1 ms to minimize.
[2023-03-12 13:56:21] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 0 ms to minimize.
[2023-03-12 13:56:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4067 ms
[2023-03-12 13:56:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 223 ms.
[2023-03-12 13:56:22] [INFO ] Added : 2 causal constraints over 1 iterations in 499 ms. Result :sat
Minimization took 346 ms.
[2023-03-12 13:56:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:23] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2023-03-12 13:56:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:56:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:24] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-12 13:56:24] [INFO ] [Nat]Added 241 Read/Feed constraints in 206 ms returned sat
[2023-03-12 13:56:24] [INFO ] Deduced a trap composed of 14 places in 510 ms of which 1 ms to minimize.
[2023-03-12 13:56:25] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 0 ms to minimize.
[2023-03-12 13:56:25] [INFO ] Deduced a trap composed of 48 places in 394 ms of which 0 ms to minimize.
[2023-03-12 13:56:26] [INFO ] Deduced a trap composed of 48 places in 418 ms of which 1 ms to minimize.
[2023-03-12 13:56:26] [INFO ] Deduced a trap composed of 49 places in 502 ms of which 1 ms to minimize.
[2023-03-12 13:56:27] [INFO ] Deduced a trap composed of 36 places in 529 ms of which 2 ms to minimize.
[2023-03-12 13:56:28] [INFO ] Deduced a trap composed of 21 places in 540 ms of which 0 ms to minimize.
[2023-03-12 13:56:28] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 1 ms to minimize.
[2023-03-12 13:56:29] [INFO ] Deduced a trap composed of 48 places in 502 ms of which 0 ms to minimize.
[2023-03-12 13:56:29] [INFO ] Deduced a trap composed of 50 places in 506 ms of which 1 ms to minimize.
[2023-03-12 13:56:30] [INFO ] Deduced a trap composed of 50 places in 498 ms of which 1 ms to minimize.
[2023-03-12 13:56:31] [INFO ] Deduced a trap composed of 21 places in 538 ms of which 1 ms to minimize.
[2023-03-12 13:56:31] [INFO ] Deduced a trap composed of 57 places in 499 ms of which 1 ms to minimize.
[2023-03-12 13:56:32] [INFO ] Deduced a trap composed of 59 places in 361 ms of which 0 ms to minimize.
[2023-03-12 13:56:32] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 0 ms to minimize.
[2023-03-12 13:56:32] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
[2023-03-12 13:56:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 8772 ms
[2023-03-12 13:56:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 304 ms.
[2023-03-12 13:56:34] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 1 ms to minimize.
[2023-03-12 13:56:35] [INFO ] Deduced a trap composed of 83 places in 578 ms of which 1 ms to minimize.
[2023-03-12 13:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1373 ms
[2023-03-12 13:56:35] [INFO ] Added : 6 causal constraints over 2 iterations in 2308 ms. Result :sat
Minimization took 3006 ms.
[2023-03-12 13:56:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:38] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-12 13:56:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:56:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:39] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-12 13:56:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 164 ms returned sat
[2023-03-12 13:56:40] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
[2023-03-12 13:56:40] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 1 ms to minimize.
[2023-03-12 13:56:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2023-03-12 13:56:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 246 ms.
[2023-03-12 13:56:41] [INFO ] Added : 6 causal constraints over 2 iterations in 748 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[6, 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 74 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 75 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:56:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:42] [INFO ] Invariant cache hit.
[2023-03-12 13:56:45] [INFO ] Implicit Places using invariants in 2538 ms returned []
[2023-03-12 13:56:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:45] [INFO ] Invariant cache hit.
[2023-03-12 13:56:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:56:48] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 5045 ms to find 0 implicit places.
[2023-03-12 13:56:48] [INFO ] Redundant transitions in 313 ms returned []
[2023-03-12 13:56:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:56:48] [INFO ] Invariant cache hit.
[2023-03-12 13:56:49] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6603 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-12 13:56:49] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :2
[2023-03-12 13:56:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:56:49] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 13:56:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:50] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2023-03-12 13:56:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:56:50] [INFO ] [Real]Added 241 Read/Feed constraints in 43 ms returned sat
[2023-03-12 13:56:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:50] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-12 13:56:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 177 ms returned sat
[2023-03-12 13:56:51] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 1 ms to minimize.
[2023-03-12 13:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-12 13:56:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 226 ms.
[2023-03-12 13:56:52] [INFO ] Added : 4 causal constraints over 2 iterations in 652 ms. Result :sat
Minimization took 342 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 80 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 81 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-12 13:56:52] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2397 ms. (steps per millisecond=417 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2284 ms. (steps per millisecond=437 ) properties (out of 1) seen :2
[2023-03-12 13:56:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:56:57] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:56:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:58] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2023-03-12 13:56:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:56:58] [INFO ] [Real]Added 241 Read/Feed constraints in 157 ms returned sat
[2023-03-12 13:56:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:56:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:56:59] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2023-03-12 13:56:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 126 ms returned sat
[2023-03-12 13:57:00] [INFO ] Deduced a trap composed of 20 places in 564 ms of which 1 ms to minimize.
[2023-03-12 13:57:00] [INFO ] Deduced a trap composed of 10 places in 468 ms of which 1 ms to minimize.
[2023-03-12 13:57:01] [INFO ] Deduced a trap composed of 22 places in 459 ms of which 0 ms to minimize.
[2023-03-12 13:57:02] [INFO ] Deduced a trap composed of 52 places in 571 ms of which 3 ms to minimize.
[2023-03-12 13:57:02] [INFO ] Deduced a trap composed of 87 places in 573 ms of which 0 ms to minimize.
[2023-03-12 13:57:03] [INFO ] Deduced a trap composed of 47 places in 591 ms of which 2 ms to minimize.
[2023-03-12 13:57:03] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 5 ms to minimize.
[2023-03-12 13:57:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4360 ms
[2023-03-12 13:57:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 257 ms.
[2023-03-12 13:57:04] [INFO ] Added : 2 causal constraints over 1 iterations in 593 ms. Result :sat
Minimization took 365 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
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 62 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 82 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 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:57:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:06] [INFO ] Invariant cache hit.
[2023-03-12 13:57:06] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-12 13:57:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:06] [INFO ] Invariant cache hit.
[2023-03-12 13:57:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:09] [INFO ] Implicit Places using invariants and state equation in 2743 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
[2023-03-12 13:57:09] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-12 13:57:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:09] [INFO ] Invariant cache hit.
[2023-03-12 13:57:10] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4512 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-12 13:57:10] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000020 steps, including 2 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2325 ms. (steps per millisecond=430 ) properties (out of 1) seen :2
[2023-03-12 13:57:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:57:14] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-12 13:57:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:15] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2023-03-12 13:57:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:15] [INFO ] [Real]Added 241 Read/Feed constraints in 161 ms returned sat
[2023-03-12 13:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:57:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:15] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-12 13:57:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 124 ms returned sat
[2023-03-12 13:57:16] [INFO ] Deduced a trap composed of 20 places in 571 ms of which 1 ms to minimize.
[2023-03-12 13:57:17] [INFO ] Deduced a trap composed of 10 places in 539 ms of which 1 ms to minimize.
[2023-03-12 13:57:18] [INFO ] Deduced a trap composed of 22 places in 612 ms of which 0 ms to minimize.
[2023-03-12 13:57:18] [INFO ] Deduced a trap composed of 52 places in 570 ms of which 1 ms to minimize.
[2023-03-12 13:57:19] [INFO ] Deduced a trap composed of 87 places in 562 ms of which 1 ms to minimize.
[2023-03-12 13:57:19] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 1 ms to minimize.
[2023-03-12 13:57:20] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2023-03-12 13:57:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4474 ms
[2023-03-12 13:57:20] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 184 ms.
[2023-03-12 13:57:20] [INFO ] Added : 2 causal constraints over 1 iterations in 426 ms. Result :sat
Minimization took 381 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
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 72 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 72 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-12 13:57:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:22] [INFO ] Invariant cache hit.
[2023-03-12 13:57:22] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-12 13:57:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:22] [INFO ] Invariant cache hit.
[2023-03-12 13:57:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:25] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
[2023-03-12 13:57:25] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-12 13:57:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:25] [INFO ] Invariant cache hit.
[2023-03-12 13:57:27] [INFO ] Dead Transitions using invariants and state equation in 1600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5295 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-01 in 37922 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-12 13:57:27] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10015 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
[2023-03-12 13:57:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:57:27] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-12 13:57:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:28] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-12 13:57:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:57:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-12 13:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:28] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-12 13:57:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 233 ms returned sat
[2023-03-12 13:57:29] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 1 ms to minimize.
[2023-03-12 13:57:29] [INFO ] Deduced a trap composed of 10 places in 617 ms of which 1 ms to minimize.
[2023-03-12 13:57:30] [INFO ] Deduced a trap composed of 48 places in 524 ms of which 1 ms to minimize.
[2023-03-12 13:57:31] [INFO ] Deduced a trap composed of 48 places in 520 ms of which 0 ms to minimize.
[2023-03-12 13:57:31] [INFO ] Deduced a trap composed of 49 places in 421 ms of which 0 ms to minimize.
[2023-03-12 13:57:32] [INFO ] Deduced a trap composed of 36 places in 568 ms of which 1 ms to minimize.
[2023-03-12 13:57:32] [INFO ] Deduced a trap composed of 21 places in 436 ms of which 1 ms to minimize.
[2023-03-12 13:57:33] [INFO ] Deduced a trap composed of 22 places in 393 ms of which 1 ms to minimize.
[2023-03-12 13:57:33] [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 72 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 73 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-12 13:57:33] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 1925 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2026 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
[2023-03-12 13:57:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:57:37] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 13:57:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:37] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-12 13:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:57:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:38] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2023-03-12 13:57:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 169 ms returned sat
[2023-03-12 13:57:39] [INFO ] Deduced a trap composed of 14 places in 528 ms of which 1 ms to minimize.
[2023-03-12 13:57:39] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 0 ms to minimize.
[2023-03-12 13:57:40] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 1 ms to minimize.
[2023-03-12 13:57:40] [INFO ] Deduced a trap composed of 48 places in 384 ms of which 1 ms to minimize.
[2023-03-12 13:57:41] [INFO ] Deduced a trap composed of 49 places in 387 ms of which 1 ms to minimize.
[2023-03-12 13:57:41] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 1 ms to minimize.
[2023-03-12 13:57:42] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2023-03-12 13:57:42] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2023-03-12 13:57:42] [INFO ] Deduced a trap composed of 48 places in 398 ms of which 1 ms to minimize.
[2023-03-12 13:57:43] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 0 ms to minimize.
[2023-03-12 13:57:43] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 1 ms to minimize.
[2023-03-12 13:57:44] [INFO ] Deduced a trap composed of 21 places in 437 ms of which 1 ms to minimize.
[2023-03-12 13:57:44] [INFO ] Deduced a trap composed of 57 places in 401 ms of which 0 ms to minimize.
[2023-03-12 13:57:45] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 0 ms to minimize.
[2023-03-12 13:57:45] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 1 ms to minimize.
[2023-03-12 13:57:46] [INFO ] Deduced a trap composed of 19 places in 463 ms of which 1 ms to minimize.
[2023-03-12 13:57:46] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7583 ms
[2023-03-12 13:57:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 226 ms.
[2023-03-12 13:57:47] [INFO ] Deduced a trap composed of 49 places in 420 ms of which 0 ms to minimize.
[2023-03-12 13:57:47] [INFO ] Deduced a trap composed of 83 places in 398 ms of which 0 ms to minimize.
[2023-03-12 13:57:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1118 ms
[2023-03-12 13:57:48] [INFO ] Added : 6 causal constraints over 2 iterations in 1911 ms. Result :sat
Minimization took 3011 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 105 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 106 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 86 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:57:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:51] [INFO ] Invariant cache hit.
[2023-03-12 13:57:51] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-12 13:57:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:51] [INFO ] Invariant cache hit.
[2023-03-12 13:57:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:53] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2023-03-12 13:57:53] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-12 13:57:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:57:53] [INFO ] Invariant cache hit.
[2023-03-12 13:57:54] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3381 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-04 in 27214 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-12 13:57:54] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
[2023-03-12 13:57:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:57:54] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 13:57:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:55] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-12 13:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:57:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:55] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-12 13:57:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:57:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 157 ms returned sat
[2023-03-12 13:57:56] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 0 ms to minimize.
[2023-03-12 13:57:56] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-03-12 13:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 619 ms
[2023-03-12 13:57:56] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 180 ms.
[2023-03-12 13:57:57] [INFO ] Added : 6 causal constraints over 2 iterations in 451 ms. Result :sat
Minimization took 435 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 46 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 46 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-12 13:57:58] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
[2023-03-12 13:58:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:58:01] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:58:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:58:02] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-12 13:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:58:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:58:02] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-12 13:58:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:58:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 139 ms returned sat
[2023-03-12 13:58:03] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-12 13:58:03] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2023-03-12 13:58:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 660 ms
[2023-03-12 13:58:03] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 296 ms.
[2023-03-12 13:58:04] [INFO ] Added : 6 causal constraints over 2 iterations in 749 ms. Result :sat
Minimization took 393 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 32 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 33 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-12 13:58:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:58:05] [INFO ] Invariant cache hit.
[2023-03-12 13:58:05] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-12 13:58:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:58:05] [INFO ] Invariant cache hit.
[2023-03-12 13:58:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:58:08] [INFO ] Implicit Places using invariants and state equation in 2716 ms returned []
Implicit Place search using SMT with State Equation took 3135 ms to find 0 implicit places.
[2023-03-12 13:58:08] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-12 13:58:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:58:08] [INFO ] Invariant cache hit.
[2023-03-12 13:58:09] [INFO ] Dead Transitions using invariants and state equation in 1324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4591 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-08 in 15023 ms.
[2023-03-12 13:58:10] [INFO ] Flatten gal took : 488 ms
[2023-03-12 13:58:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 15 ms.
[2023-03-12 13:58:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 25 ms.
Total runtime 181162 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/997/ub_0_ --maxsum=/tmp/997/ub_1_ --maxsum=/tmp/997/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15506576 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080256 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r041-tajo-167813694600357"
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 ;