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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678637392555

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-q8m128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:09:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 16:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:09:55] [INFO ] Load time of PNML (sax parser for PT used): 902 ms
[2023-03-12 16:09:55] [INFO ] Transformed 754 places.
[2023-03-12 16:09:55] [INFO ] Transformed 27370 transitions.
[2023-03-12 16:09:55] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 136 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-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-12 16:09:56] [INFO ] Computed 10 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :2
FORMULA BugTracking-PT-q8m128-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m128-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
[2023-03-12 16:09:56] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 16:09:56] [INFO ] Computed 10 place invariants in 29 ms
[2023-03-12 16:09:56] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 16:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:09:57] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2023-03-12 16:09:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:09:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-12 16:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:09:58] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-12 16:09:58] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 16:09:59] [INFO ] [Nat]Added 303 Read/Feed constraints in 84 ms returned sat
[2023-03-12 16:09:59] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 452 ms.
[2023-03-12 16:10:00] [INFO ] Added : 2 causal constraints over 1 iterations in 986 ms. Result :sat
[2023-03-12 16:10:00] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:00] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-12 16:10:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 16:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:01] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2023-03-12 16:10:01] [INFO ] [Nat]Added 303 Read/Feed constraints in 298 ms returned sat
[2023-03-12 16:10:02] [INFO ] Deduced a trap composed of 73 places in 608 ms of which 14 ms to minimize.
[2023-03-12 16:10:03] [INFO ] Deduced a trap composed of 31 places in 1113 ms of which 1 ms to minimize.
[2023-03-12 16:10:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2062 ms
[2023-03-12 16:10:04] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 464 ms.
[2023-03-12 16:10:04] [INFO ] Added : 5 causal constraints over 2 iterations in 853 ms. Result :sat
[2023-03-12 16:10:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:05] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-12 16:10:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:06] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-12 16:10:06] [INFO ] [Nat]Added 303 Read/Feed constraints in 184 ms returned sat
[2023-03-12 16:10:06] [INFO ] Deduced a trap composed of 10 places in 673 ms of which 1 ms to minimize.
[2023-03-12 16:10:07] [INFO ] Deduced a trap composed of 70 places in 424 ms of which 2 ms to minimize.
[2023-03-12 16:10:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1373 ms
[2023-03-12 16:10:07] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 330 ms.
[2023-03-12 16:10:08] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 0 ms to minimize.
[2023-03-12 16:10:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
[2023-03-12 16:10:09] [INFO ] Added : 12 causal constraints over 3 iterations in 1532 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.11 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 9 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 353 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 354 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-12 16:10:10] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000031 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2088 ms. (steps per millisecond=478 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2036 ms. (steps per millisecond=491 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2075 ms. (steps per millisecond=481 ) properties (out of 3) seen :0
[2023-03-12 16:10:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:17] [INFO ] Computed 8 place invariants in 30 ms
[2023-03-12 16:10:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 16:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:18] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2023-03-12 16:10:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:19] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2023-03-12 16:10:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 46 ms returned sat
[2023-03-12 16:10:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 307 ms.
[2023-03-12 16:10:20] [INFO ] Deduced a trap composed of 112 places in 506 ms of which 0 ms to minimize.
[2023-03-12 16:10:21] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 1 ms to minimize.
[2023-03-12 16:10:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1102 ms
[2023-03-12 16:10:21] [INFO ] Added : 4 causal constraints over 3 iterations in 2314 ms. Result :sat
[2023-03-12 16:10:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:22] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-12 16:10:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:22] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-12 16:10:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 172 ms returned sat
[2023-03-12 16:10:23] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2023-03-12 16:10:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2023-03-12 16:10:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 238 ms.
[2023-03-12 16:10:24] [INFO ] Added : 3 causal constraints over 1 iterations in 558 ms. Result :sat
[2023-03-12 16:10:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:24] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-12 16:10:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 16:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:25] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-12 16:10:25] [INFO ] [Nat]Added 283 Read/Feed constraints in 295 ms returned sat
[2023-03-12 16:10:26] [INFO ] Deduced a trap composed of 56 places in 498 ms of which 0 ms to minimize.
[2023-03-12 16:10:27] [INFO ] Deduced a trap composed of 58 places in 595 ms of which 1 ms to minimize.
[2023-03-12 16:10:27] [INFO ] Deduced a trap composed of 13 places in 524 ms of which 1 ms to minimize.
[2023-03-12 16:10:28] [INFO ] Deduced a trap composed of 49 places in 588 ms of which 1 ms to minimize.
[2023-03-12 16:10:29] [INFO ] Deduced a trap composed of 54 places in 617 ms of which 1 ms to minimize.
[2023-03-12 16:10:29] [INFO ] Deduced a trap composed of 85 places in 556 ms of which 1 ms to minimize.
[2023-03-12 16:10:30] [INFO ] Deduced a trap composed of 57 places in 568 ms of which 0 ms to minimize.
[2023-03-12 16:10:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4751 ms
[2023-03-12 16:10:30] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 280 ms.
[2023-03-12 16:10:31] [INFO ] Added : 8 causal constraints over 2 iterations in 965 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 115 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 116 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 80 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:10:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:32] [INFO ] Invariant cache hit.
[2023-03-12 16:10:32] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-12 16:10:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:32] [INFO ] Invariant cache hit.
[2023-03-12 16:10:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:35] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
[2023-03-12 16:10:35] [INFO ] Redundant transitions in 292 ms returned []
[2023-03-12 16:10:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:35] [INFO ] Invariant cache hit.
[2023-03-12 16:10:36] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4767 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-07
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:36] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10110 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-12 16:10:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:36] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 16:10:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:37] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-12 16:10:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:37] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-12 16:10:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 38 ms returned sat
[2023-03-12 16:10:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 366 ms.
[2023-03-12 16:10:39] [INFO ] Deduced a trap composed of 112 places in 481 ms of which 1 ms to minimize.
[2023-03-12 16:10:39] [INFO ] Deduced a trap composed of 55 places in 320 ms of which 0 ms to minimize.
[2023-03-12 16:10:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1114 ms
[2023-03-12 16:10:40] [INFO ] Added : 4 causal constraints over 3 iterations in 2362 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 72 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-12 16:10:40] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000081 steps, including 2 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 1) seen :0
[2023-03-12 16:10:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:44] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 16:10:44] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-12 16:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:44] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-12 16:10:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:45] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2023-03-12 16:10:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 55 ms returned sat
[2023-03-12 16:10:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2023-03-12 16:10:46] [INFO ] Deduced a trap composed of 112 places in 414 ms of which 0 ms to minimize.
[2023-03-12 16:10:47] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 1 ms to minimize.
[2023-03-12 16:10:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 939 ms
[2023-03-12 16:10:47] [INFO ] Added : 4 causal constraints over 3 iterations in 2150 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 58 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 59 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 127 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:10:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:47] [INFO ] Invariant cache hit.
[2023-03-12 16:10:48] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 16:10:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:48] [INFO ] Invariant cache hit.
[2023-03-12 16:10:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:50] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2516 ms to find 0 implicit places.
[2023-03-12 16:10:50] [INFO ] Redundant transitions in 243 ms returned []
[2023-03-12 16:10:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:10:50] [INFO ] Invariant cache hit.
[2023-03-12 16:10:51] [INFO ] Dead Transitions using invariants and state equation in 1243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4137 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-07 in 15257 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:51] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10026 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1432 ) 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-12 16:10:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:52] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-12 16:10:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:52] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-12 16:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:53] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2023-03-12 16:10:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 175 ms returned sat
[2023-03-12 16:10:53] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 0 ms to minimize.
[2023-03-12 16:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-12 16:10:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2023-03-12 16:10:54] [INFO ] Added : 3 causal constraints over 1 iterations in 758 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 74 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 75 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-12 16:10:54] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000118 steps, including 2 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2314 ms. (steps per millisecond=432 ) properties (out of 1) seen :0
[2023-03-12 16:10:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:10:58] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 16:10:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:58] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-12 16:10:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:10:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:10:59] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-12 16:10:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:10:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 173 ms returned sat
[2023-03-12 16:10:59] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 0 ms to minimize.
[2023-03-12 16:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2023-03-12 16:11:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 239 ms.
[2023-03-12 16:11:00] [INFO ] Added : 3 causal constraints over 1 iterations in 532 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 65 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 65 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 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:11:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:00] [INFO ] Invariant cache hit.
[2023-03-12 16:11:01] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 16:11:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:01] [INFO ] Invariant cache hit.
[2023-03-12 16:11:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:11:02] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2023-03-12 16:11:02] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-12 16:11:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:02] [INFO ] Invariant cache hit.
[2023-03-12 16:11:04] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3428 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-08 in 12185 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:11:04] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10060 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1257 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 16:11:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:11:04] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 16:11:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:11:04] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-12 16:11:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:11:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 16:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:11:05] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-12 16:11:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:11:05] [INFO ] [Nat]Added 283 Read/Feed constraints in 286 ms returned sat
[2023-03-12 16:11:06] [INFO ] Deduced a trap composed of 56 places in 521 ms of which 1 ms to minimize.
[2023-03-12 16:11:06] [INFO ] Deduced a trap composed of 58 places in 523 ms of which 0 ms to minimize.
[2023-03-12 16:11:07] [INFO ] Deduced a trap composed of 13 places in 543 ms of which 0 ms to minimize.
[2023-03-12 16:11:08] [INFO ] Deduced a trap composed of 49 places in 423 ms of which 3 ms to minimize.
[2023-03-12 16:11:08] [INFO ] Deduced a trap composed of 54 places in 547 ms of which 1 ms to minimize.
[2023-03-12 16:11:09] [INFO ] Deduced a trap composed of 85 places in 556 ms of which 1 ms to minimize.
[2023-03-12 16:11:10] [INFO ] Deduced a trap composed of 57 places in 555 ms of which 0 ms to minimize.
[2023-03-12 16:11:10] [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 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 52 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 53 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-12 16:11:10] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000111 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 1) seen :0
[2023-03-12 16:11:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:11:12] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 16:11:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:11:13] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2023-03-12 16:11:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:11:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:11:13] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-12 16:11:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:11:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 231 ms returned sat
[2023-03-12 16:11:14] [INFO ] Deduced a trap composed of 56 places in 601 ms of which 0 ms to minimize.
[2023-03-12 16:11:15] [INFO ] Deduced a trap composed of 58 places in 525 ms of which 0 ms to minimize.
[2023-03-12 16:11:15] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 1 ms to minimize.
[2023-03-12 16:11:16] [INFO ] Deduced a trap composed of 49 places in 561 ms of which 1 ms to minimize.
[2023-03-12 16:11:17] [INFO ] Deduced a trap composed of 54 places in 553 ms of which 1 ms to minimize.
[2023-03-12 16:11:17] [INFO ] Deduced a trap composed of 85 places in 540 ms of which 1 ms to minimize.
[2023-03-12 16:11:18] [INFO ] Deduced a trap composed of 57 places in 503 ms of which 1 ms to minimize.
[2023-03-12 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4398 ms
[2023-03-12 16:11:18] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 299 ms.
[2023-03-12 16:11:19] [INFO ] Added : 8 causal constraints over 2 iterations in 886 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 75 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 75 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 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:11:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:19] [INFO ] Invariant cache hit.
[2023-03-12 16:11:20] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-12 16:11:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:20] [INFO ] Invariant cache hit.
[2023-03-12 16:11:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:11:22] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
[2023-03-12 16:11:22] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-12 16:11:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:11:22] [INFO ] Invariant cache hit.
[2023-03-12 16:11:23] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3966 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-12 in 19547 ms.
[2023-03-12 16:11:24] [INFO ] Flatten gal took : 372 ms
[2023-03-12 16:11:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-12 16:11:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 19 ms.
Total runtime 89754 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/727/ub_0_ --maxsum=/tmp/727/ub_1_ --maxsum=/tmp/727/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15731476 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081020 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-q8m128"
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-q8m128, 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-167813694700437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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