About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.636 | 3600000.00 | 2885753.00 | 459727.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r263-tall-171654371900021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716625987962
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 08:33:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:33:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:33:09] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2024-05-25 08:33:09] [INFO ] Transformed 5568 places.
[2024-05-25 08:33:09] [INFO ] Transformed 7799 transitions.
[2024-05-25 08:33:09] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 7527 out of 7799 initially.
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-25 08:33:10] [INFO ] Computed 573 invariants in 333 ms
Incomplete random walk after 10000 steps, including 160 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :2
[2024-05-25 08:33:11] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-25 08:33:11] [INFO ] Computed 573 invariants in 221 ms
[2024-05-25 08:33:12] [INFO ] [Real]Absence check using 50 positive place invariants in 109 ms returned sat
[2024-05-25 08:33:12] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 112 ms returned unsat
[2024-05-25 08:33:12] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2024-05-25 08:33:12] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 116 ms returned unsat
[2024-05-25 08:33:13] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2024-05-25 08:33:13] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 120 ms returned unsat
[2024-05-25 08:33:14] [INFO ] [Real]Absence check using 50 positive place invariants in 74 ms returned sat
[2024-05-25 08:33:14] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 191 ms returned sat
[2024-05-25 08:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:18] [INFO ] [Real]Absence check using state equation in 4229 ms returned unknown
[2024-05-25 08:33:19] [INFO ] [Real]Absence check using 50 positive place invariants in 79 ms returned sat
[2024-05-25 08:33:19] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 127 ms returned unsat
[2024-05-25 08:33:19] [INFO ] [Real]Absence check using 50 positive place invariants in 58 ms returned sat
[2024-05-25 08:33:19] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 116 ms returned unsat
[2024-05-25 08:33:20] [INFO ] [Real]Absence check using 50 positive place invariants in 56 ms returned sat
[2024-05-25 08:33:20] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 189 ms returned sat
[2024-05-25 08:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:24] [INFO ] [Real]Absence check using state equation in 4229 ms returned unknown
[2024-05-25 08:33:25] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2024-05-25 08:33:25] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 118 ms returned unsat
[2024-05-25 08:33:26] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2024-05-25 08:33:26] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 126 ms returned unsat
[2024-05-25 08:33:26] [INFO ] [Real]Absence check using 50 positive place invariants in 56 ms returned sat
[2024-05-25 08:33:26] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 113 ms returned unsat
[2024-05-25 08:33:27] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2024-05-25 08:33:27] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 209 ms returned sat
[2024-05-25 08:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:31] [INFO ] [Real]Absence check using state equation in 4218 ms returned unknown
[2024-05-25 08:33:32] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2024-05-25 08:33:32] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 193 ms returned sat
[2024-05-25 08:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:36] [INFO ] [Real]Absence check using state equation in 4239 ms returned unknown
[2024-05-25 08:33:37] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2024-05-25 08:33:37] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 184 ms returned sat
[2024-05-25 08:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:41] [INFO ] [Real]Absence check using state equation in 4354 ms returned unknown
[2024-05-25 08:33:42] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2024-05-25 08:33:42] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 194 ms returned sat
[2024-05-25 08:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:46] [INFO ] [Real]Absence check using state equation in 4271 ms returned unknown
[2024-05-25 08:33:47] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2024-05-25 08:33:47] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 196 ms returned sat
[2024-05-25 08:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:51] [INFO ] [Real]Absence check using state equation in 4239 ms returned unknown
[2024-05-25 08:33:52] [INFO ] [Real]Absence check using 50 positive place invariants in 58 ms returned sat
[2024-05-25 08:33:52] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 122 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 51, 17, 1] Max seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.19 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1629 transitions
Trivial Post-agglo rules discarded 1629 transitions
Performed 1629 trivial Post agglomeration. Transition count delta: 1629
Iterating post reduction 0 with 1629 rules applied. Total rules applied 1630 place count 5536 transition count 6170
Reduce places removed 1629 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1630 rules applied. Total rules applied 3260 place count 3907 transition count 6169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3261 place count 3906 transition count 6169
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3261 place count 3906 transition count 5965
Deduced a syphon composed of 204 places in 7 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3669 place count 3702 transition count 5965
Discarding 1425 places :
Symmetric choice reduction at 3 with 1425 rule applications. Total rules 5094 place count 2277 transition count 4540
Iterating global reduction 3 with 1425 rules applied. Total rules applied 6519 place count 2277 transition count 4540
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 6519 place count 2277 transition count 4530
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 6539 place count 2267 transition count 4530
Discarding 235 places :
Symmetric choice reduction at 3 with 235 rule applications. Total rules 6774 place count 2032 transition count 3120
Iterating global reduction 3 with 235 rules applied. Total rules applied 7009 place count 2032 transition count 3120
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7043 place count 2015 transition count 3103
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 7206 place count 2015 transition count 4115
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 7369 place count 1852 transition count 4115
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 7403 place count 1852 transition count 4115
Applied a total of 7403 rules in 1584 ms. Remains 1852 /5568 variables (removed 3716) and now considering 4115/7799 (removed 3684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1585 ms. Remains : 1852/5568 places, 4115/7799 transitions.
Normalized transition count is 3717 out of 4115 initially.
// Phase 1: matrix 3717 rows 1852 cols
[2024-05-25 08:33:54] [INFO ] Computed 541 invariants in 53 ms
Incomplete random walk after 1000000 steps, including 26663 resets, run finished after 15677 ms. (steps per millisecond=63 ) properties (out of 7) seen :5
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4866 resets, run finished after 3470 ms. (steps per millisecond=288 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4866 resets, run finished after 3479 ms. (steps per millisecond=287 ) properties (out of 2) seen :0
[2024-05-25 08:34:16] [INFO ] Flow matrix only has 3717 transitions (discarded 398 similar events)
// Phase 1: matrix 3717 rows 1852 cols
[2024-05-25 08:34:17] [INFO ] Computed 541 invariants in 68 ms
[2024-05-25 08:34:17] [INFO ] [Real]Absence check using 33 positive place invariants in 43 ms returned sat
[2024-05-25 08:34:17] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 93 ms returned sat
[2024-05-25 08:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:18] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2024-05-25 08:34:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 08:34:18] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 76 ms returned sat
[2024-05-25 08:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:19] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2024-05-25 08:34:19] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:34:22] [INFO ] [Nat]Added 2178 Read/Feed constraints in 2651 ms returned sat
[2024-05-25 08:34:24] [INFO ] Deduced a trap composed of 338 places in 1301 ms of which 10 ms to minimize.
[2024-05-25 08:34:25] [INFO ] Deduced a trap composed of 201 places in 1451 ms of which 2 ms to minimize.
[2024-05-25 08:34:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3108 ms
[2024-05-25 08:34:26] [INFO ] Computed and/alt/rep : 1613/3892/1613 causal constraints (skipped 2087 transitions) in 346 ms.
[2024-05-25 08:34:27] [INFO ] Added : 17 causal constraints over 4 iterations in 1578 ms. Result :sat
[2024-05-25 08:34:27] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-25 08:34:27] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 91 ms returned sat
[2024-05-25 08:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:28] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2024-05-25 08:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-25 08:34:29] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 86 ms returned sat
[2024-05-25 08:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:30] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2024-05-25 08:34:30] [INFO ] [Nat]Added 2178 Read/Feed constraints in 439 ms returned sat
[2024-05-25 08:34:32] [INFO ] Deduced a trap composed of 268 places in 1295 ms of which 6 ms to minimize.
[2024-05-25 08:34:33] [INFO ] Deduced a trap composed of 272 places in 1320 ms of which 3 ms to minimize.
[2024-05-25 08:34:35] [INFO ] Deduced a trap composed of 305 places in 1245 ms of which 2 ms to minimize.
[2024-05-25 08:34:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4620 ms
[2024-05-25 08:34:36] [INFO ] Computed and/alt/rep : 1613/3892/1613 causal constraints (skipped 2087 transitions) in 584 ms.
[2024-05-25 08:34:38] [INFO ] Deduced a trap composed of 194 places in 1234 ms of which 2 ms to minimize.
[2024-05-25 08:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1489 ms
[2024-05-25 08:34:38] [INFO ] Added : 16 causal constraints over 4 iterations in 3223 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 2] Max seen :[0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 1852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1852/1852 places, 4115/4115 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1852 transition count 4113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1850 transition count 4113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1850 transition count 4112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1849 transition count 4112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 1848 transition count 4111
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 1848 transition count 4111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 1848 transition count 4111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 1847 transition count 4110
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 1847 transition count 4110
Applied a total of 11 rules in 497 ms. Remains 1847 /1852 variables (removed 5) and now considering 4110/4115 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 1847/1852 places, 4110/4115 transitions.
Normalized transition count is 3712 out of 4110 initially.
// Phase 1: matrix 3712 rows 1847 cols
[2024-05-25 08:34:39] [INFO ] Computed 541 invariants in 62 ms
Incomplete random walk after 1000000 steps, including 26664 resets, run finished after 16168 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4865 resets, run finished after 3685 ms. (steps per millisecond=271 ) properties (out of 1) seen :0
[2024-05-25 08:34:59] [INFO ] Flow matrix only has 3712 transitions (discarded 398 similar events)
// Phase 1: matrix 3712 rows 1847 cols
[2024-05-25 08:34:59] [INFO ] Computed 541 invariants in 47 ms
[2024-05-25 08:34:59] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-25 08:34:59] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 93 ms returned sat
[2024-05-25 08:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:35:00] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2024-05-25 08:35:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:35:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-25 08:35:01] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 89 ms returned sat
[2024-05-25 08:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:35:02] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2024-05-25 08:35:02] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:02] [INFO ] [Nat]Added 2178 Read/Feed constraints in 589 ms returned sat
[2024-05-25 08:35:04] [INFO ] Deduced a trap composed of 279 places in 1287 ms of which 2 ms to minimize.
[2024-05-25 08:35:05] [INFO ] Deduced a trap composed of 212 places in 1276 ms of which 3 ms to minimize.
[2024-05-25 08:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3229 ms
[2024-05-25 08:35:06] [INFO ] Computed and/alt/rep : 1609/3886/1609 causal constraints (skipped 2086 transitions) in 241 ms.
[2024-05-25 08:35:06] [INFO ] Added : 13 causal constraints over 3 iterations in 948 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 1847 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1847/1847 places, 4110/4110 transitions.
Applied a total of 0 rules in 120 ms. Remains 1847 /1847 variables (removed 0) and now considering 4110/4110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1847/1847 places, 4110/4110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1847/1847 places, 4110/4110 transitions.
Applied a total of 0 rules in 118 ms. Remains 1847 /1847 variables (removed 0) and now considering 4110/4110 (removed 0) transitions.
[2024-05-25 08:35:07] [INFO ] Flow matrix only has 3712 transitions (discarded 398 similar events)
[2024-05-25 08:35:07] [INFO ] Invariant cache hit.
[2024-05-25 08:35:11] [INFO ] Implicit Places using invariants in 4132 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 341, 352, 362, 363, 364, 365, 366, 367, 368, 376, 382, 386, 388, 390, 392, 407, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 427, 431, 437, 445, 454, 462, 463, 464, 465, 466, 467, 468, 474, 478, 480, 482, 484, 486, 501, 507, 509, 510, 511, 512, 513, 514, 515, 517, 519, 521, 523, 527, 533, 540, 546, 547, 548, 549, 550, 551, 552, 556, 558, 560, 562, 564, 566, 581, 587, 589, 590, 591, 592, 593, 594, 595, 597, 599, 601, 603, 605, 609, 614, 618, 619, 620, 621, 622, 623, 624, 626, 628, 630, 632, 634, 636, 651, 657, 659, 660, 661, 662, 663, 664, 665, 667, 669, 671, 673, 675, 677, 680, 682, 683, 684, 685, 686, 687, 688, 690, 692, 694, 696, 698, 700, 715, 721, 723, 724, 725, 726, 727, 728, 729, 731, 733, 735, 737, 739, 741, 743, 745, 746, 747, 748, 749, 750, 751, 753, 755, 757, 759, 761, 763, 778, 780, 783, 785, 786, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 805, 807, 808, 809, 810, 811, 812, 813, 815, 817, 819, 821, 823, 825, 840, 846, 848, 849, 850, 851, 852, 853, 854, 856, 858, 860, 862, 864, 866, 868, 870, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 903, 909, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 931, 934, 935, 936, 937, 938, 939, 940, 942, 944, 946, 948, 950, 952, 967, 973, 975, 976, 977, 978, 979, 980, 981, 983, 985, 987, 989, 991, 993, 997, 1002, 1003, 1004, 1005, 1006, 1008, 1012, 1015, 1017, 1019, 1021, 1023, 1038, 1044, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1054, 1056, 1058, 1060, 1062, 1066, 1072, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1091, 1095, 1097, 1099, 1101, 1103, 1118, 1124, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1134, 1136, 1138, 1140, 1144, 1150, 1158, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1181, 1187, 1191, 1193, 1195, 1197, 1212, 1218, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1228, 1230, 1232, 1236, 1242, 1250, 1260, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1287, 1295, 1301, 1305, 1307, 1309, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1340, 1342, 1346, 1352, 1360, 1370, 1382, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1413, 1423, 1431, 1437, 1441, 1443, 1458, 1460, 1463, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1473, 1477, 1483, 1491, 1501, 1513, 1527, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1562, 1574, 1584, 1592, 1598, 1602, 1617]
Discarding 495 places :
Implicit Place search using SMT only with invariants took 4146 ms to find 495 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1352/1847 places, 4110/4110 transitions.
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 191 place count 1161 transition count 3919
Iterating global reduction 0 with 191 rules applied. Total rules applied 382 place count 1161 transition count 3919
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 573 place count 970 transition count 3728
Iterating global reduction 0 with 191 rules applied. Total rules applied 764 place count 970 transition count 3728
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 767 place count 970 transition count 3725
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 770 place count 967 transition count 3725
Applied a total of 770 rules in 260 ms. Remains 967 /1352 variables (removed 385) and now considering 3725/4110 (removed 385) transitions.
[2024-05-25 08:35:11] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:35:11] [INFO ] Computed 46 invariants in 26 ms
[2024-05-25 08:35:12] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2024-05-25 08:35:12] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:35:12] [INFO ] Invariant cache hit.
[2024-05-25 08:35:13] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:32] [INFO ] Implicit Places using invariants and state equation in 19934 ms returned []
Implicit Place search using SMT with State Equation took 21005 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 967/1847 places, 3725/4110 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25529 ms. Remains : 967/1847 places, 3725/4110 transitions.
Normalized transition count is 3327 out of 3725 initially.
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:35:32] [INFO ] Computed 46 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 28283 resets, run finished after 15362 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3588 resets, run finished after 2605 ms. (steps per millisecond=383 ) properties (out of 1) seen :0
[2024-05-25 08:35:50] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:35:50] [INFO ] Computed 46 invariants in 23 ms
[2024-05-25 08:35:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:35:50] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-25 08:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:35:51] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-25 08:35:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:35:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:35:51] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-25 08:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:35:52] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-05-25 08:35:52] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:52] [INFO ] [Nat]Added 2178 Read/Feed constraints in 375 ms returned sat
[2024-05-25 08:35:53] [INFO ] Deduced a trap composed of 179 places in 393 ms of which 0 ms to minimize.
[2024-05-25 08:35:53] [INFO ] Deduced a trap composed of 177 places in 396 ms of which 1 ms to minimize.
[2024-05-25 08:35:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1290 ms
[2024-05-25 08:35:54] [INFO ] Computed and/alt/rep : 1338/1941/1338 causal constraints (skipped 1927 transitions) in 181 ms.
[2024-05-25 08:35:54] [INFO ] Added : 11 causal constraints over 3 iterations in 746 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 94 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 967/967 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 96 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2024-05-25 08:35:55] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:35:55] [INFO ] Invariant cache hit.
[2024-05-25 08:35:56] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-25 08:35:56] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:35:56] [INFO ] Invariant cache hit.
[2024-05-25 08:35:57] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:36:16] [INFO ] Implicit Places using invariants and state equation in 19963 ms returned []
Implicit Place search using SMT with State Equation took 21010 ms to find 0 implicit places.
[2024-05-25 08:36:16] [INFO ] Redundant transitions in 239 ms returned []
[2024-05-25 08:36:16] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:36:16] [INFO ] Invariant cache hit.
[2024-05-25 08:36:17] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22548 ms. Remains : 967/967 places, 3725/3725 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13
Normalized transition count is 3327 out of 3725 initially.
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:36:17] [INFO ] Computed 46 invariants in 22 ms
Incomplete random walk after 10000 steps, including 282 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2024-05-25 08:36:17] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:36:18] [INFO ] Computed 46 invariants in 24 ms
[2024-05-25 08:36:18] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:36:18] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-25 08:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:36:18] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-05-25 08:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:36:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:36:19] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-25 08:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:36:19] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-25 08:36:19] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:36:20] [INFO ] [Nat]Added 2178 Read/Feed constraints in 368 ms returned sat
[2024-05-25 08:36:20] [INFO ] Deduced a trap composed of 179 places in 387 ms of which 1 ms to minimize.
[2024-05-25 08:36:21] [INFO ] Deduced a trap composed of 177 places in 408 ms of which 1 ms to minimize.
[2024-05-25 08:36:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1299 ms
[2024-05-25 08:36:21] [INFO ] Computed and/alt/rep : 1338/1941/1338 causal constraints (skipped 1927 transitions) in 190 ms.
[2024-05-25 08:36:22] [INFO ] Added : 11 causal constraints over 3 iterations in 761 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 95 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 967/967 places, 3725/3725 transitions.
Normalized transition count is 3327 out of 3725 initially.
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:36:22] [INFO ] Computed 46 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 28278 resets, run finished after 15344 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3575 resets, run finished after 2599 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2024-05-25 08:36:40] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 967 cols
[2024-05-25 08:36:40] [INFO ] Computed 46 invariants in 26 ms
[2024-05-25 08:36:40] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:36:40] [INFO ] [Real]Absence check using 31 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-25 08:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:36:41] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-25 08:36:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:36:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:36:41] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-25 08:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:36:42] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-05-25 08:36:42] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:36:42] [INFO ] [Nat]Added 2178 Read/Feed constraints in 361 ms returned sat
[2024-05-25 08:36:42] [INFO ] Deduced a trap composed of 179 places in 391 ms of which 1 ms to minimize.
[2024-05-25 08:36:43] [INFO ] Deduced a trap composed of 177 places in 413 ms of which 1 ms to minimize.
[2024-05-25 08:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1305 ms
[2024-05-25 08:36:43] [INFO ] Computed and/alt/rep : 1338/1941/1338 causal constraints (skipped 1927 transitions) in 181 ms.
[2024-05-25 08:36:44] [INFO ] Added : 11 causal constraints over 3 iterations in 741 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 95 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 967/967 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3725/3725 transitions.
Applied a total of 0 rules in 95 ms. Remains 967 /967 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2024-05-25 08:36:44] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:36:44] [INFO ] Invariant cache hit.
[2024-05-25 08:36:45] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2024-05-25 08:36:45] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:36:45] [INFO ] Invariant cache hit.
[2024-05-25 08:36:46] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:37:05] [INFO ] Implicit Places using invariants and state equation in 19454 ms returned []
Implicit Place search using SMT with State Equation took 20459 ms to find 0 implicit places.
[2024-05-25 08:37:05] [INFO ] Redundant transitions in 165 ms returned []
[2024-05-25 08:37:05] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-25 08:37:05] [INFO ] Invariant cache hit.
[2024-05-25 08:37:06] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21960 ms. Remains : 967/967 places, 3725/3725 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C06-UpperBounds-13 in 48974 ms.
[2024-05-25 08:37:07] [INFO ] Flatten gal took : 283 ms
[2024-05-25 08:37:07] [INFO ] Applying decomposition
[2024-05-25 08:37:07] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13040107337479741967.txt' '-o' '/tmp/graph13040107337479741967.bin' '-w' '/tmp/graph13040107337479741967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13040107337479741967.bin' '-l' '-1' '-v' '-w' '/tmp/graph13040107337479741967.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:37:07] [INFO ] Decomposing Gal with order
[2024-05-25 08:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:37:08] [INFO ] Removed a total of 6615 redundant transitions.
[2024-05-25 08:37:08] [INFO ] Flatten gal took : 793 ms
[2024-05-25 08:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2625 labels/synchronizations in 205 ms.
[2024-05-25 08:37:09] [INFO ] Time to serialize gal into /tmp/UpperBounds15522078836483533755.gal : 49 ms
[2024-05-25 08:37:09] [INFO ] Time to serialize properties into /tmp/UpperBounds13352417125874689559.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15522078836483533755.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13352417125874689559.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13352417125874689559.prop.
Detected timeout of ITS tools.
[2024-05-25 08:58:37] [INFO ] Flatten gal took : 732 ms
[2024-05-25 08:58:37] [INFO ] Time to serialize gal into /tmp/UpperBounds14017826396947778484.gal : 103 ms
[2024-05-25 08:58:37] [INFO ] Time to serialize properties into /tmp/UpperBounds13291491587217839576.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14017826396947778484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13291491587217839576.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds13291491587217839576.prop.
Detected timeout of ITS tools.
[2024-05-25 09:20:23] [INFO ] Flatten gal took : 842 ms
[2024-05-25 09:20:26] [INFO ] Input system was already deterministic with 3725 transitions.
[2024-05-25 09:20:26] [INFO ] Transformed 967 places.
[2024-05-25 09:20:26] [INFO ] Transformed 3725 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 09:20:26] [INFO ] Time to serialize gal into /tmp/UpperBounds9606311335310417802.gal : 15 ms
[2024-05-25 09:20:26] [INFO ] Time to serialize properties into /tmp/UpperBounds9245518098672446367.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9606311335310417802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9245518098672446367.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9245518098672446367.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 163708 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15697940 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r263-tall-171654371900021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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 '
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 ;