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.r043-tajo-167813696700357.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 smartxred
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 r043-tajo-167813696700357
=====================================================================

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

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:12:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 09:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:12:18] [INFO ] Load time of PNML (sax parser for PT used): 652 ms
[2023-03-14 09:12:18] [INFO ] Transformed 754 places.
[2023-03-14 09:12:18] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:12:18] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 827 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 112 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-14 09:12:18] [INFO ] Computed 10 place invariants in 35 ms
FORMULA BugTracking-PT-q3m032-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :4
FORMULA BugTracking-PT-q3m032-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m032-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m032-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
[2023-03-14 09:12:19] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-14 09:12:19] [INFO ] Computed 10 place invariants in 13 ms
[2023-03-14 09:12:19] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:19] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-14 09:12:19] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-14 09:12:19] [INFO ] [Real]Added 255 Read/Feed constraints in 33 ms returned sat
[2023-03-14 09:12:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 09:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:20] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-14 09:12:20] [INFO ] [Nat]Added 255 Read/Feed constraints in 60 ms returned sat
[2023-03-14 09:12:20] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 6 ms to minimize.
[2023-03-14 09:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-14 09:12:20] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 192 ms.
[2023-03-14 09:12:20] [INFO ] Added : 4 causal constraints over 1 iterations in 481 ms. Result :sat
Minimization took 203 ms.
[2023-03-14 09:12:21] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:21] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-14 09:12:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:22] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-14 09:12:22] [INFO ] [Nat]Added 255 Read/Feed constraints in 173 ms returned sat
[2023-03-14 09:12:22] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2023-03-14 09:12:22] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-14 09:12:22] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-14 09:12:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 653 ms
[2023-03-14 09:12:23] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 185 ms.
[2023-03-14 09:12:23] [INFO ] Added : 9 causal constraints over 2 iterations in 614 ms. Result :sat
Minimization took 525 ms.
[2023-03-14 09:12:24] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:24] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-14 09:12:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:25] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-14 09:12:25] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2023-03-14 09:12:25] [INFO ] Deduced a trap composed of 59 places in 407 ms of which 0 ms to minimize.
[2023-03-14 09:12:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
[2023-03-14 09:12:26] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 156 ms.
[2023-03-14 09:12:26] [INFO ] Added : 4 causal constraints over 1 iterations in 384 ms. Result :sat
Minimization took 392 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[1, 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.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 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 297 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 298 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-14 09:12:27] [INFO ] Computed 8 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1836 ms. (steps per millisecond=544 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 3) seen :0
[2023-03-14 09:12:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:12:34] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-14 09:12:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:35] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-14 09:12:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:12:35] [INFO ] [Real]Added 241 Read/Feed constraints in 31 ms returned sat
[2023-03-14 09:12:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:12:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:35] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-14 09:12:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 192 ms returned sat
[2023-03-14 09:12:36] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2023-03-14 09:12:36] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 0 ms to minimize.
[2023-03-14 09:12:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 882 ms
[2023-03-14 09:12:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 206 ms.
[2023-03-14 09:12:37] [INFO ] Added : 3 causal constraints over 1 iterations in 502 ms. Result :sat
Minimization took 418 ms.
[2023-03-14 09:12:37] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:38] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-14 09:12:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:38] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-14 09:12:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 140 ms returned sat
[2023-03-14 09:12:39] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 1 ms to minimize.
[2023-03-14 09:12:39] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 1 ms to minimize.
[2023-03-14 09:12:39] [INFO ] Deduced a trap composed of 48 places in 354 ms of which 1 ms to minimize.
[2023-03-14 09:12:40] [INFO ] Deduced a trap composed of 48 places in 367 ms of which 1 ms to minimize.
[2023-03-14 09:12:40] [INFO ] Deduced a trap composed of 49 places in 347 ms of which 0 ms to minimize.
[2023-03-14 09:12:41] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 1 ms to minimize.
[2023-03-14 09:12:41] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 0 ms to minimize.
[2023-03-14 09:12:41] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 0 ms to minimize.
[2023-03-14 09:12:42] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 3 ms to minimize.
[2023-03-14 09:12:42] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 1 ms to minimize.
[2023-03-14 09:12:43] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 1 ms to minimize.
[2023-03-14 09:12:43] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 0 ms to minimize.
[2023-03-14 09:12:44] [INFO ] Deduced a trap composed of 57 places in 357 ms of which 1 ms to minimize.
[2023-03-14 09:12:44] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 1 ms to minimize.
[2023-03-14 09:12:44] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 1 ms to minimize.
[2023-03-14 09:12:45] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2023-03-14 09:12:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6769 ms
[2023-03-14 09:12:45] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 218 ms.
[2023-03-14 09:12:46] [INFO ] Deduced a trap composed of 49 places in 329 ms of which 0 ms to minimize.
[2023-03-14 09:12:46] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 1 ms to minimize.
[2023-03-14 09:12:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 998 ms
[2023-03-14 09:12:47] [INFO ] Added : 6 causal constraints over 2 iterations in 1772 ms. Result :sat
Minimization took 3002 ms.
[2023-03-14 09:12:50] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:50] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2023-03-14 09:12:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:51] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-03-14 09:12:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 119 ms returned sat
[2023-03-14 09:12:51] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 0 ms to minimize.
[2023-03-14 09:12:51] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-03-14 09:12:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2023-03-14 09:12:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 200 ms.
[2023-03-14 09:12:52] [INFO ] Added : 6 causal constraints over 2 iterations in 650 ms. Result :sat
Minimization took 521 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[1, 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 56 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 56 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 53 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:12:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:12:53] [INFO ] Invariant cache hit.
[2023-03-14 09:12:53] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-14 09:12:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:12:53] [INFO ] Invariant cache hit.
[2023-03-14 09:12:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:12:55] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-14 09:12:55] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-14 09:12:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:12:55] [INFO ] Invariant cache hit.
[2023-03-14 09:12:56] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3039 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-14 09:12:56] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 :7
[2023-03-14 09:12:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:12:56] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-14 09:12:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:57] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-14 09:12:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:12:57] [INFO ] [Real]Added 241 Read/Feed constraints in 61 ms returned sat
[2023-03-14 09:12:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:12:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:12:57] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-14 09:12:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 84 ms returned sat
[2023-03-14 09:12:58] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 0 ms to minimize.
[2023-03-14 09:12:58] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 0 ms to minimize.
[2023-03-14 09:12:58] [INFO ] Deduced a trap composed of 22 places in 308 ms of which 0 ms to minimize.
[2023-03-14 09:12:59] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 0 ms to minimize.
[2023-03-14 09:12:59] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 1 ms to minimize.
[2023-03-14 09:12:59] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 0 ms to minimize.
[2023-03-14 09:13:00] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 0 ms to minimize.
[2023-03-14 09:13:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2770 ms
[2023-03-14 09:13:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 198 ms.
[2023-03-14 09:13:00] [INFO ] Added : 2 causal constraints over 1 iterations in 446 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
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 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:01] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1454 ms. (steps per millisecond=687 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2162 ms. (steps per millisecond=462 ) properties (out of 1) seen :3
[2023-03-14 09:13:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:05] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-14 09:13:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:05] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-14 09:13:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:05] [INFO ] [Real]Added 241 Read/Feed constraints in 76 ms returned sat
[2023-03-14 09:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:13:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:06] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2023-03-14 09:13:06] [INFO ] [Nat]Added 241 Read/Feed constraints in 118 ms returned sat
[2023-03-14 09:13:07] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 4 ms to minimize.
[2023-03-14 09:13:07] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2023-03-14 09:13:07] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 1 ms to minimize.
[2023-03-14 09:13:08] [INFO ] Deduced a trap composed of 52 places in 394 ms of which 0 ms to minimize.
[2023-03-14 09:13:08] [INFO ] Deduced a trap composed of 87 places in 360 ms of which 0 ms to minimize.
[2023-03-14 09:13:09] [INFO ] Deduced a trap composed of 47 places in 371 ms of which 1 ms to minimize.
[2023-03-14 09:13:09] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
[2023-03-14 09:13:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3108 ms
[2023-03-14 09:13:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 205 ms.
[2023-03-14 09:13:10] [INFO ] Added : 2 causal constraints over 1 iterations in 503 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
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 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:13:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:11] [INFO ] Invariant cache hit.
[2023-03-14 09:13:11] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-14 09:13:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:11] [INFO ] Invariant cache hit.
[2023-03-14 09:13:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:12] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-03-14 09:13:13] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-14 09:13:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:13] [INFO ] Invariant cache hit.
[2023-03-14 09:13:13] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2920 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-01 in 17375 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-14 09:13:14] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=501 ) 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-14 09:13:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:14] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-14 09:13:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:14] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-14 09:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:13:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:14] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-14 09:13:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 137 ms returned sat
[2023-03-14 09:13:15] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 0 ms to minimize.
[2023-03-14 09:13:15] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 1 ms to minimize.
[2023-03-14 09:13:15] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2023-03-14 09:13:16] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 0 ms to minimize.
[2023-03-14 09:13:16] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 1 ms to minimize.
[2023-03-14 09:13:16] [INFO ] Deduced a trap composed of 36 places in 325 ms of which 1 ms to minimize.
[2023-03-14 09:13:17] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2023-03-14 09:13:17] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 0 ms to minimize.
[2023-03-14 09:13:18] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 1 ms to minimize.
[2023-03-14 09:13:18] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 2 ms to minimize.
[2023-03-14 09:13:18] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 1 ms to minimize.
[2023-03-14 09:13:19] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 1 ms to minimize.
[2023-03-14 09:13:19] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 1 ms to minimize.
[2023-03-14 09:13:19] [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 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 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-14 09:13:19] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1725 ms. (steps per millisecond=579 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 1) seen :0
[2023-03-14 09:13:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:23] [INFO ] Computed 8 place invariants in 33 ms
[2023-03-14 09:13:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:23] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-14 09:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:13:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:24] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-14 09:13:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:24] [INFO ] [Nat]Added 241 Read/Feed constraints in 138 ms returned sat
[2023-03-14 09:13:24] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 0 ms to minimize.
[2023-03-14 09:13:25] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-14 09:13:25] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 2 ms to minimize.
[2023-03-14 09:13:25] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 0 ms to minimize.
[2023-03-14 09:13:26] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 0 ms to minimize.
[2023-03-14 09:13:26] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 1 ms to minimize.
[2023-03-14 09:13:26] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 0 ms to minimize.
[2023-03-14 09:13:27] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2023-03-14 09:13:27] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 1 ms to minimize.
[2023-03-14 09:13:28] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 0 ms to minimize.
[2023-03-14 09:13:28] [INFO ] Deduced a trap composed of 50 places in 296 ms of which 3 ms to minimize.
[2023-03-14 09:13:28] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 0 ms to minimize.
[2023-03-14 09:13:29] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 2 ms to minimize.
[2023-03-14 09:13:29] [INFO ] Deduced a trap composed of 59 places in 303 ms of which 3 ms to minimize.
[2023-03-14 09:13:29] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 2 ms to minimize.
[2023-03-14 09:13:30] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2023-03-14 09:13:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6026 ms
[2023-03-14 09:13:30] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 169 ms.
[2023-03-14 09:13:31] [INFO ] Deduced a trap composed of 49 places in 329 ms of which 1 ms to minimize.
[2023-03-14 09:13:31] [INFO ] Deduced a trap composed of 83 places in 321 ms of which 0 ms to minimize.
[2023-03-14 09:13:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 932 ms
[2023-03-14 09:13:31] [INFO ] Added : 6 causal constraints over 2 iterations in 1617 ms. Result :sat
Minimization took 3007 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 58 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 58 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:13:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:34] [INFO ] Invariant cache hit.
[2023-03-14 09:13:35] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-14 09:13:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:35] [INFO ] Invariant cache hit.
[2023-03-14 09:13:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:36] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2023-03-14 09:13:36] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-14 09:13:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:36] [INFO ] Invariant cache hit.
[2023-03-14 09:13:37] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2692 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-04 in 23646 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-14 09:13:37] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10014 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) 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-14 09:13:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:37] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-14 09:13:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:38] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-14 09:13:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:13:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:38] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-14 09:13:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 113 ms returned sat
[2023-03-14 09:13:38] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 0 ms to minimize.
[2023-03-14 09:13:39] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2023-03-14 09:13:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2023-03-14 09:13:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 199 ms.
[2023-03-14 09:13:39] [INFO ] Added : 6 causal constraints over 2 iterations in 600 ms. Result :sat
Minimization took 573 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 64 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 66 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-14 09:13:40] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 2200 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 1) seen :0
[2023-03-14 09:13:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:13:44] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-14 09:13:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:45] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-14 09:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:13:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:13:45] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-14 09:13:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 117 ms returned sat
[2023-03-14 09:13:46] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 0 ms to minimize.
[2023-03-14 09:13:46] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2023-03-14 09:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-14 09:13:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 190 ms.
[2023-03-14 09:13:47] [INFO ] Added : 6 causal constraints over 2 iterations in 623 ms. Result :sat
Minimization took 521 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 68 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 68 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 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:13:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:48] [INFO ] Invariant cache hit.
[2023-03-14 09:13:48] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-14 09:13:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:48] [INFO ] Invariant cache hit.
[2023-03-14 09:13:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:13:49] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2023-03-14 09:13:49] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-14 09:13:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:13:49] [INFO ] Invariant cache hit.
[2023-03-14 09:13:50] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2609 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-08 in 13018 ms.
[2023-03-14 09:13:51] [INFO ] Flatten gal took : 214 ms
[2023-03-14 09:13:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-14 09:13:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 11 ms.
Total runtime 93373 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q3m032
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 229 places, 2747 transitions, 13485 arcs.
Final Score: 32826.102
Took : 50 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678785743327

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 888 Killed ${SMART}/smart ${INPUT_SM}

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="smartxred"
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 smartxred"
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 r043-tajo-167813696700357"
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 ;