fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r043-tajo-167813696800437
Last Updated
May 14, 2023

About the Execution of Smart+red for BugTracking-PT-q8m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10649.680 3600000.00 3662034.00 2143.40 0 0 0 0 0 0 1 ? ? 0 0 0 ? 1 0 0 normal

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

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

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-q8m128
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:19:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 10:19:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:19:34] [INFO ] Load time of PNML (sax parser for PT used): 594 ms
[2023-03-14 10:19:34] [INFO ] Transformed 754 places.
[2023-03-14 10:19:34] [INFO ] Transformed 27370 transitions.
[2023-03-14 10:19:34] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 776 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 98 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-14 10:19:34] [INFO ] Computed 10 place invariants in 77 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 120 ms. (steps per millisecond=83 ) 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 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
[2023-03-14 10:19:35] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 10:19:35] [INFO ] Computed 10 place invariants in 25 ms
[2023-03-14 10:19:35] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:35] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-14 10:19:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:19:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 10:19:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:36] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-14 10:19:36] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 10:19:36] [INFO ] [Nat]Added 303 Read/Feed constraints in 49 ms returned sat
[2023-03-14 10:19:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 310 ms.
[2023-03-14 10:19:37] [INFO ] Added : 2 causal constraints over 1 iterations in 747 ms. Result :sat
[2023-03-14 10:19:37] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 10:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:38] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2023-03-14 10:19:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:19:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:19:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:38] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-14 10:19:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 341 ms returned sat
[2023-03-14 10:19:39] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 5 ms to minimize.
[2023-03-14 10:19:40] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 1 ms to minimize.
[2023-03-14 10:19:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1298 ms
[2023-03-14 10:19:40] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 462 ms.
[2023-03-14 10:19:41] [INFO ] Added : 5 causal constraints over 2 iterations in 891 ms. Result :sat
[2023-03-14 10:19:41] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:42] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-14 10:19:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:19:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:42] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-14 10:19:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 191 ms returned sat
[2023-03-14 10:19:43] [INFO ] Deduced a trap composed of 10 places in 644 ms of which 1 ms to minimize.
[2023-03-14 10:19:44] [INFO ] Deduced a trap composed of 70 places in 390 ms of which 1 ms to minimize.
[2023-03-14 10:19:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1340 ms
[2023-03-14 10:19:44] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 383 ms.
[2023-03-14 10:19:45] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 1 ms to minimize.
[2023-03-14 10:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2023-03-14 10:19:46] [INFO ] Added : 12 causal constraints over 3 iterations in 1792 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.12 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 3 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 323 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 324 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-14 10:19:47] [INFO ] Computed 8 place invariants in 35 ms
Incomplete random walk after 1000090 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 3) seen :0
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 1000001 steps, including 2 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1752 ms. (steps per millisecond=570 ) properties (out of 3) seen :0
[2023-03-14 10:19:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:19:53] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-14 10:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:53] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-14 10:19:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:54] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2023-03-14 10:19:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:19:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 45 ms returned sat
[2023-03-14 10:19:55] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 375 ms.
[2023-03-14 10:19:56] [INFO ] Deduced a trap composed of 112 places in 526 ms of which 1 ms to minimize.
[2023-03-14 10:19:56] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 0 ms to minimize.
[2023-03-14 10:19:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1244 ms
[2023-03-14 10:19:57] [INFO ] Added : 4 causal constraints over 3 iterations in 2750 ms. Result :sat
[2023-03-14 10:19:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:58] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2023-03-14 10:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:19:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:19:59] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2023-03-14 10:19:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 204 ms returned sat
[2023-03-14 10:19:59] [INFO ] Deduced a trap composed of 18 places in 451 ms of which 1 ms to minimize.
[2023-03-14 10:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2023-03-14 10:20:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2023-03-14 10:20:00] [INFO ] Added : 3 causal constraints over 1 iterations in 758 ms. Result :sat
[2023-03-14 10:20:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:01] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2023-03-14 10:20:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:02] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-14 10:20:02] [INFO ] [Nat]Added 283 Read/Feed constraints in 272 ms returned sat
[2023-03-14 10:20:03] [INFO ] Deduced a trap composed of 56 places in 533 ms of which 0 ms to minimize.
[2023-03-14 10:20:03] [INFO ] Deduced a trap composed of 58 places in 541 ms of which 1 ms to minimize.
[2023-03-14 10:20:04] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 10 ms to minimize.
[2023-03-14 10:20:05] [INFO ] Deduced a trap composed of 49 places in 607 ms of which 0 ms to minimize.
[2023-03-14 10:20:05] [INFO ] Deduced a trap composed of 54 places in 581 ms of which 1 ms to minimize.
[2023-03-14 10:20:06] [INFO ] Deduced a trap composed of 85 places in 525 ms of which 0 ms to minimize.
[2023-03-14 10:20:07] [INFO ] Deduced a trap composed of 57 places in 525 ms of which 1 ms to minimize.
[2023-03-14 10:20:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4726 ms
[2023-03-14 10:20:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2023-03-14 10:20:08] [INFO ] Added : 8 causal constraints over 2 iterations in 1052 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 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 104 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:20:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:08] [INFO ] Invariant cache hit.
[2023-03-14 10:20:09] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-14 10:20:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:09] [INFO ] Invariant cache hit.
[2023-03-14 10:20:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:11] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2023-03-14 10:20:11] [INFO ] Redundant transitions in 426 ms returned []
[2023-03-14 10:20:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:11] [INFO ] Invariant cache hit.
[2023-03-14 10:20:12] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4360 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-14 10:20:13] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 10043 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-14 10:20:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:13] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-14 10:20:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:13] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-14 10:20:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:14] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2023-03-14 10:20:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 60 ms returned sat
[2023-03-14 10:20:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 327 ms.
[2023-03-14 10:20:16] [INFO ] Deduced a trap composed of 112 places in 507 ms of which 0 ms to minimize.
[2023-03-14 10:20:16] [INFO ] Deduced a trap composed of 55 places in 322 ms of which 0 ms to minimize.
[2023-03-14 10:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1289 ms
[2023-03-14 10:20:17] [INFO ] Added : 4 causal constraints over 3 iterations in 2783 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 102 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 104 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-14 10:20:17] [INFO ] Computed 8 place invariants in 29 ms
Incomplete random walk after 1000118 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
[2023-03-14 10:20:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:20] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-14 10:20:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:20] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-14 10:20:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:21] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-14 10:20:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 85 ms returned sat
[2023-03-14 10:20:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 383 ms.
[2023-03-14 10:20:23] [INFO ] Deduced a trap composed of 112 places in 474 ms of which 0 ms to minimize.
[2023-03-14 10:20:23] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 0 ms to minimize.
[2023-03-14 10:20:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1163 ms
[2023-03-14 10:20:24] [INFO ] Added : 4 causal constraints over 3 iterations in 2544 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 53 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:20:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:24] [INFO ] Invariant cache hit.
[2023-03-14 10:20:27] [INFO ] Implicit Places using invariants in 2803 ms returned []
[2023-03-14 10:20:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:27] [INFO ] Invariant cache hit.
[2023-03-14 10:20:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:29] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 4866 ms to find 0 implicit places.
[2023-03-14 10:20:29] [INFO ] Redundant transitions in 271 ms returned []
[2023-03-14 10:20:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:29] [INFO ] Invariant cache hit.
[2023-03-14 10:20:30] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6483 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-07 in 18025 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-14 10:20:31] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1683 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-14 10:20:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:31] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-14 10:20:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:31] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-14 10:20:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:32] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2023-03-14 10:20:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 152 ms returned sat
[2023-03-14 10:20:32] [INFO ] Deduced a trap composed of 18 places in 449 ms of which 1 ms to minimize.
[2023-03-14 10:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 723 ms
[2023-03-14 10:20:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 293 ms.
[2023-03-14 10:20:33] [INFO ] Added : 3 causal constraints over 1 iterations in 692 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 80 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 81 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-14 10:20:34] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000046 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 1) seen :0
[2023-03-14 10:20:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:36] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-14 10:20:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:37] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-14 10:20:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:37] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2023-03-14 10:20:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:37] [INFO ] [Nat]Added 283 Read/Feed constraints in 211 ms returned sat
[2023-03-14 10:20:38] [INFO ] Deduced a trap composed of 18 places in 394 ms of which 0 ms to minimize.
[2023-03-14 10:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2023-03-14 10:20:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 304 ms.
[2023-03-14 10:20:39] [INFO ] Added : 3 causal constraints over 1 iterations in 646 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 55 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 55 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 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:20:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:39] [INFO ] Invariant cache hit.
[2023-03-14 10:20:40] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-14 10:20:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:40] [INFO ] Invariant cache hit.
[2023-03-14 10:20:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:41] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
[2023-03-14 10:20:41] [INFO ] Redundant transitions in 208 ms returned []
[2023-03-14 10:20:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:41] [INFO ] Invariant cache hit.
[2023-03-14 10:20:43] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3533 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-08 in 12026 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-14 10:20:43] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 10086 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1440 ) 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 10:20:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:43] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-14 10:20:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:43] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-14 10:20:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:44] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2023-03-14 10:20:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 245 ms returned sat
[2023-03-14 10:20:45] [INFO ] Deduced a trap composed of 56 places in 632 ms of which 2 ms to minimize.
[2023-03-14 10:20:46] [INFO ] Deduced a trap composed of 58 places in 564 ms of which 0 ms to minimize.
[2023-03-14 10:20:46] [INFO ] Deduced a trap composed of 13 places in 543 ms of which 0 ms to minimize.
[2023-03-14 10:20:47] [INFO ] Deduced a trap composed of 49 places in 548 ms of which 1 ms to minimize.
[2023-03-14 10:20:48] [INFO ] Deduced a trap composed of 54 places in 504 ms of which 0 ms to minimize.
[2023-03-14 10:20:48] [INFO ] Deduced a trap composed of 85 places in 550 ms of which 1 ms to minimize.
[2023-03-14 10:20:49] [INFO ] Deduced a trap composed of 57 places in 493 ms of which 1 ms to minimize.
[2023-03-14 10:20:49] [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 88 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 90 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-14 10:20:49] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1702 ms. (steps per millisecond=587 ) properties (out of 1) seen :0
[2023-03-14 10:20:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:20:51] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-14 10:20:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:52] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-14 10:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:20:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:20:53] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-14 10:20:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:20:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 258 ms returned sat
[2023-03-14 10:20:54] [INFO ] Deduced a trap composed of 56 places in 614 ms of which 0 ms to minimize.
[2023-03-14 10:20:54] [INFO ] Deduced a trap composed of 58 places in 586 ms of which 1 ms to minimize.
[2023-03-14 10:20:55] [INFO ] Deduced a trap composed of 13 places in 531 ms of which 0 ms to minimize.
[2023-03-14 10:20:56] [INFO ] Deduced a trap composed of 49 places in 547 ms of which 0 ms to minimize.
[2023-03-14 10:20:56] [INFO ] Deduced a trap composed of 54 places in 599 ms of which 1 ms to minimize.
[2023-03-14 10:20:57] [INFO ] Deduced a trap composed of 85 places in 590 ms of which 1 ms to minimize.
[2023-03-14 10:20:58] [INFO ] Deduced a trap composed of 57 places in 634 ms of which 2 ms to minimize.
[2023-03-14 10:20:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5034 ms
[2023-03-14 10:20:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2023-03-14 10:20:59] [INFO ] Added : 8 causal constraints over 2 iterations in 1049 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 77 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 77 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 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:20:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:20:59] [INFO ] Invariant cache hit.
[2023-03-14 10:21:00] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-14 10:21:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:21:00] [INFO ] Invariant cache hit.
[2023-03-14 10:21:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:21:02] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
[2023-03-14 10:21:02] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-14 10:21:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:21:02] [INFO ] Invariant cache hit.
[2023-03-14 10:21:03] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3628 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-12 in 20465 ms.
[2023-03-14 10:21:03] [INFO ] Flatten gal took : 319 ms
[2023-03-14 10:21:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 10:21:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 18 ms.
Total runtime 90310 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m128
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: 269 places, 3871 transitions, 19045 arcs.
Final Score: 54126.883
Took : 85 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5481196 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16088640 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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