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

About the Execution of Marcie+red for BugTracking-PT-q8m008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5560.500 3600000.00 3673296.00 816.80 0 ? 0 0 1 0 ? 0 0 0 0 0 0 ? 8 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.r042-tajo-167813695700405.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 marciexred
Input is BugTracking-PT-q8m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.5K Feb 26 06:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 06:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 06:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678720564322

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 15:16:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 15:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:16:06] [INFO ] Load time of PNML (sax parser for PT used): 713 ms
[2023-03-13 15:16:06] [INFO ] Transformed 754 places.
[2023-03-13 15:16:07] [INFO ] Transformed 27370 transitions.
[2023-03-13 15:16:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 953 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 104 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 15:16:07] [INFO ] Computed 10 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :9
FORMULA BugTracking-PT-q8m008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m008-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
[2023-03-13 15:16:07] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 15:16:07] [INFO ] Computed 10 place invariants in 31 ms
[2023-03-13 15:16:07] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 15:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:08] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-13 15:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 15:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:08] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-13 15:16:08] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 15:16:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 279 ms returned sat
[2023-03-13 15:16:09] [INFO ] Deduced a trap composed of 31 places in 472 ms of which 3 ms to minimize.
[2023-03-13 15:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 660 ms
[2023-03-13 15:16:10] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 321 ms.
[2023-03-13 15:16:10] [INFO ] Added : 7 causal constraints over 2 iterations in 893 ms. Result :sat
[2023-03-13 15:16:10] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 15:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:11] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2023-03-13 15:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 15:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:12] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2023-03-13 15:16:12] [INFO ] [Nat]Added 303 Read/Feed constraints in 180 ms returned sat
[2023-03-13 15:16:13] [INFO ] Deduced a trap composed of 38 places in 517 ms of which 2 ms to minimize.
[2023-03-13 15:16:13] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 1 ms to minimize.
[2023-03-13 15:16:14] [INFO ] Deduced a trap composed of 58 places in 457 ms of which 1 ms to minimize.
[2023-03-13 15:16:14] [INFO ] Deduced a trap composed of 58 places in 446 ms of which 0 ms to minimize.
[2023-03-13 15:16:15] [INFO ] Deduced a trap composed of 39 places in 686 ms of which 2 ms to minimize.
[2023-03-13 15:16:16] [INFO ] Deduced a trap composed of 12 places in 517 ms of which 0 ms to minimize.
[2023-03-13 15:16:16] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2023-03-13 15:16:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3981 ms
[2023-03-13 15:16:16] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 233 ms.
[2023-03-13 15:16:16] [INFO ] Added : 0 causal constraints over 0 iterations in 235 ms. Result :unknown
[2023-03-13 15:16:16] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 15:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:17] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-13 15:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 15:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:17] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-13 15:16:18] [INFO ] [Nat]Added 303 Read/Feed constraints in 349 ms returned sat
[2023-03-13 15:16:18] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 0 ms to minimize.
[2023-03-13 15:16:19] [INFO ] Deduced a trap composed of 30 places in 472 ms of which 0 ms to minimize.
[2023-03-13 15:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1087 ms
[2023-03-13 15:16:19] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 264 ms.
[2023-03-13 15:16:20] [INFO ] Added : 8 causal constraints over 2 iterations in 816 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.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 551 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 553 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-13 15:16:21] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4927 ms. (steps per millisecond=202 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1977 ms. (steps per millisecond=505 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties (out of 3) seen :0
[2023-03-13 15:16:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:16:31] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-13 15:16:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:32] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-13 15:16:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 15:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:33] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2023-03-13 15:16:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:16:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 328 ms returned sat
[2023-03-13 15:16:33] [INFO ] Deduced a trap composed of 19 places in 478 ms of which 13 ms to minimize.
[2023-03-13 15:16:34] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 0 ms to minimize.
[2023-03-13 15:16:34] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 0 ms to minimize.
[2023-03-13 15:16:35] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 1 ms to minimize.
[2023-03-13 15:16:35] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 0 ms to minimize.
[2023-03-13 15:16:36] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 1 ms to minimize.
[2023-03-13 15:16:36] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2023-03-13 15:16:36] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2023-03-13 15:16:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3553 ms
[2023-03-13 15:16:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2023-03-13 15:16:37] [INFO ] Added : 6 causal constraints over 2 iterations in 604 ms. Result :sat
[2023-03-13 15:16:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:38] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-13 15:16:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:38] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-13 15:16:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 110 ms returned sat
[2023-03-13 15:16:39] [INFO ] Deduced a trap composed of 91 places in 436 ms of which 1 ms to minimize.
[2023-03-13 15:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 579 ms
[2023-03-13 15:16:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2023-03-13 15:16:40] [INFO ] Deduced a trap composed of 14 places in 353 ms of which 1 ms to minimize.
[2023-03-13 15:16:40] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 0 ms to minimize.
[2023-03-13 15:16:41] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 4 ms to minimize.
[2023-03-13 15:16:41] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 0 ms to minimize.
[2023-03-13 15:16:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1602 ms
[2023-03-13 15:16:41] [INFO ] Added : 4 causal constraints over 1 iterations in 2258 ms. Result :sat
[2023-03-13 15:16:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:42] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-13 15:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 15:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:43] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2023-03-13 15:16:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 247 ms returned sat
[2023-03-13 15:16:43] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 1 ms to minimize.
[2023-03-13 15:16:44] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2023-03-13 15:16:44] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 1 ms to minimize.
[2023-03-13 15:16:44] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 0 ms to minimize.
[2023-03-13 15:16:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1437 ms
[2023-03-13 15:16:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 268 ms.
[2023-03-13 15:16:45] [INFO ] Added : 9 causal constraints over 3 iterations in 1037 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 94 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 95 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 106 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:16:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:16:46] [INFO ] Invariant cache hit.
[2023-03-13 15:16:46] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-13 15:16:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:16:46] [INFO ] Invariant cache hit.
[2023-03-13 15:16:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:16:48] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2023-03-13 15:16:48] [INFO ] Redundant transitions in 326 ms returned []
[2023-03-13 15:16:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:16:48] [INFO ] Invariant cache hit.
[2023-03-13 15:16:49] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3623 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:16:49] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-13 15:16:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:16:49] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-13 15:16:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:50] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-13 15:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:16:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 15:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:16:51] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2023-03-13 15:16:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:16:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 283 ms returned sat
[2023-03-13 15:16:51] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 0 ms to minimize.
[2023-03-13 15:16:52] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 0 ms to minimize.
[2023-03-13 15:16:52] [INFO ] Deduced a trap composed of 60 places in 380 ms of which 1 ms to minimize.
[2023-03-13 15:16:53] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 0 ms to minimize.
[2023-03-13 15:16:53] [INFO ] Deduced a trap composed of 34 places in 311 ms of which 1 ms to minimize.
[2023-03-13 15:16:54] [INFO ] Deduced a trap composed of 26 places in 348 ms of which 0 ms to minimize.
[2023-03-13 15:16:54] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2023-03-13 15:16:54] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 2 ms to minimize.
[2023-03-13 15:16:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3533 ms
[2023-03-13 15:16:55] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 325 ms.
[2023-03-13 15:16:55] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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 168 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 174 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-13 15:16:55] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 4860 ms. (steps per millisecond=205 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2023-03-13 15:17:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:02] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-13 15:17:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 15:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:03] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2023-03-13 15:17:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:17:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:03] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-13 15:17:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:03] [INFO ] [Nat]Added 283 Read/Feed constraints in 226 ms returned sat
[2023-03-13 15:17:04] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 0 ms to minimize.
[2023-03-13 15:17:04] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 0 ms to minimize.
[2023-03-13 15:17:05] [INFO ] Deduced a trap composed of 60 places in 321 ms of which 1 ms to minimize.
[2023-03-13 15:17:05] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 1 ms to minimize.
[2023-03-13 15:17:06] [INFO ] Deduced a trap composed of 34 places in 312 ms of which 0 ms to minimize.
[2023-03-13 15:17:06] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 1 ms to minimize.
[2023-03-13 15:17:06] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 0 ms to minimize.
[2023-03-13 15:17:07] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 1 ms to minimize.
[2023-03-13 15:17:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3155 ms
[2023-03-13 15:17:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 249 ms.
[2023-03-13 15:17:07] [INFO ] Added : 6 causal constraints over 2 iterations in 791 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 112 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:17:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:08] [INFO ] Invariant cache hit.
[2023-03-13 15:17:08] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-13 15:17:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:08] [INFO ] Invariant cache hit.
[2023-03-13 15:17:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:10] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-13 15:17:10] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-13 15:17:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:10] [INFO ] Invariant cache hit.
[2023-03-13 15:17:11] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3678 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-01 in 22079 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:11] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 15:17:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:11] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-13 15:17:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:12] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-13 15:17:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:17:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:12] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-13 15:17:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 114 ms returned sat
[2023-03-13 15:17:13] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 1 ms to minimize.
[2023-03-13 15:17:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-13 15:17:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 222 ms.
[2023-03-13 15:17:14] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 1 ms to minimize.
[2023-03-13 15:17:15] [INFO ] Deduced a trap composed of 57 places in 369 ms of which 0 ms to minimize.
[2023-03-13 15:17:15] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 0 ms to minimize.
[2023-03-13 15:17:15] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 1 ms to minimize.
[2023-03-13 15:17:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1902 ms
[2023-03-13 15:17:16] [INFO ] Added : 4 causal constraints over 1 iterations in 2537 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 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:16] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 3368 ms. (steps per millisecond=296 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1598 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-13 15:17:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:21] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-13 15:17:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 15:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:21] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-13 15:17:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:17:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 15:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:22] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2023-03-13 15:17:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 107 ms returned sat
[2023-03-13 15:17:22] [INFO ] Deduced a trap composed of 91 places in 342 ms of which 0 ms to minimize.
[2023-03-13 15:17:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-13 15:17:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 224 ms.
[2023-03-13 15:17:23] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 0 ms to minimize.
[2023-03-13 15:17:24] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 2 ms to minimize.
[2023-03-13 15:17:24] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 1 ms to minimize.
[2023-03-13 15:17:25] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 0 ms to minimize.
[2023-03-13 15:17:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1699 ms
[2023-03-13 15:17:25] [INFO ] Added : 4 causal constraints over 1 iterations in 2276 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:17:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:25] [INFO ] Invariant cache hit.
[2023-03-13 15:17:25] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-13 15:17:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:25] [INFO ] Invariant cache hit.
[2023-03-13 15:17:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:27] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-03-13 15:17:27] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-13 15:17:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:27] [INFO ] Invariant cache hit.
[2023-03-13 15:17:28] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3193 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-06 in 16843 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:28] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 15:17:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:28] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-13 15:17:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:29] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-13 15:17:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:17:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:29] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-13 15:17:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 179 ms returned sat
[2023-03-13 15:17:30] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 1 ms to minimize.
[2023-03-13 15:17:30] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 0 ms to minimize.
[2023-03-13 15:17:30] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 0 ms to minimize.
[2023-03-13 15:17:31] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 16 ms to minimize.
[2023-03-13 15:17:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1286 ms
[2023-03-13 15:17:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 267 ms.
[2023-03-13 15:17:32] [INFO ] Added : 9 causal constraints over 3 iterations in 973 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 86 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 87 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-13 15:17:32] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4887 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2115 ms. (steps per millisecond=472 ) properties (out of 1) seen :0
[2023-03-13 15:17:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:17:39] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-13 15:17:39] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 15:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:40] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-13 15:17:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:17:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:17:40] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-13 15:17:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 249 ms returned sat
[2023-03-13 15:17:41] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 0 ms to minimize.
[2023-03-13 15:17:41] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2023-03-13 15:17:41] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 1 ms to minimize.
[2023-03-13 15:17:41] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2023-03-13 15:17:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1145 ms
[2023-03-13 15:17:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 226 ms.
[2023-03-13 15:17:42] [INFO ] Added : 9 causal constraints over 3 iterations in 925 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 78 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 79 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 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:17:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:43] [INFO ] Invariant cache hit.
[2023-03-13 15:17:43] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-13 15:17:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:43] [INFO ] Invariant cache hit.
[2023-03-13 15:17:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:17:45] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2023-03-13 15:17:45] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-13 15:17:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:17:45] [INFO ] Invariant cache hit.
[2023-03-13 15:17:46] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3379 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-13 in 17864 ms.
[2023-03-13 15:17:47] [INFO ] Flatten gal took : 544 ms
[2023-03-13 15:17:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 15:17:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 26 ms.
Total runtime 101334 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q8
(NrP: 269 NrTr: 3871 NrArc: 19045)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.090sec

net check time: 0m 0.003sec

init dd package: 0m 2.874sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393352 kB
MemFree: 10566172 kB
After kill :
MemTotal: 16393352 kB
MemFree: 16081864 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.055sec

6285 14012 20445 27783 33446 38092 43129 46888 50842 52715 55408 58319 61706 61945 65298 69056 73902 77924 76432 105169 129909 136854 150032 150545 166043 162496 162980 163915 161342

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q8m008, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695700405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m008.tgz
mv BugTracking-PT-q8m008 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;