Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440400100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 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 6.3M 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678758619221

Running Version 202205111006
[2023-03-14 01:50:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 01:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 01:50:20] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2023-03-14 01:50:20] [INFO ] Transformed 6876 places.
[2023-03-14 01:50:21] [INFO ] Transformed 9571 transitions.
[2023-03-14 01:50:21] [INFO ] Parsed PT model containing 6876 places and 9571 transitions in 693 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 9299 out of 9571 initially.
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-14 01:50:21] [INFO ] Computed 649 place invariants in 476 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 16) seen :8
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :3
[2023-03-14 01:50:22] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-14 01:50:22] [INFO ] Computed 649 place invariants in 344 ms
[2023-03-14 01:50:23] [INFO ] [Real]Absence check using 54 positive place invariants in 102 ms returned sat
[2023-03-14 01:50:23] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 212 ms returned unsat
[2023-03-14 01:50:24] [INFO ] [Real]Absence check using 54 positive place invariants in 89 ms returned sat
[2023-03-14 01:50:24] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 225 ms returned unsat
[2023-03-14 01:50:25] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-14 01:50:25] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 212 ms returned unsat
[2023-03-14 01:50:26] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-14 01:50:26] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 213 ms returned unsat
[2023-03-14 01:50:27] [INFO ] [Real]Absence check using 54 positive place invariants in 73 ms returned sat
[2023-03-14 01:50:27] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 231 ms returned sat
[2023-03-14 01:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:50:31] [INFO ] [Real]Absence check using state equation in 4137 ms returned unknown
[2023-03-14 01:50:32] [INFO ] [Real]Absence check using 54 positive place invariants in 74 ms returned sat
[2023-03-14 01:50:32] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 228 ms returned sat
[2023-03-14 01:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:50:36] [INFO ] [Real]Absence check using state equation in 4143 ms returned unknown
[2023-03-14 01:50:37] [INFO ] [Real]Absence check using 54 positive place invariants in 72 ms returned sat
[2023-03-14 01:50:37] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 211 ms returned unsat
[2023-03-14 01:50:37] [INFO ] [Real]Absence check using 54 positive place invariants in 74 ms returned sat
[2023-03-14 01:50:38] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 214 ms returned unsat
[2023-03-14 01:50:38] [INFO ] [Real]Absence check using 54 positive place invariants in 77 ms returned sat
[2023-03-14 01:50:39] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 209 ms returned unsat
[2023-03-14 01:50:39] [INFO ] [Real]Absence check using 54 positive place invariants in 73 ms returned sat
[2023-03-14 01:50:39] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 211 ms returned unsat
[2023-03-14 01:50:40] [INFO ] [Real]Absence check using 54 positive place invariants in 74 ms returned sat
[2023-03-14 01:50:40] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned sat
[2023-03-14 01:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:50:44] [INFO ] [Real]Absence check using state equation in 4151 ms returned unknown
[2023-03-14 01:50:45] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-14 01:50:45] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 210 ms returned unsat
[2023-03-14 01:50:46] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-14 01:50:46] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 236 ms returned sat
[2023-03-14 01:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:50:50] [INFO ] [Real]Absence check using state equation in 4135 ms returned unknown
[2023-03-14 01:50:51] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-14 01:50:51] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 204 ms returned unsat
[2023-03-14 01:50:52] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-14 01:50:52] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 245 ms returned sat
[2023-03-14 01:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:50:56] [INFO ] [Real]Absence check using state equation in 4125 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 51, 1, 1, 1, 1, 17, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 6876 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.30 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2174 transitions
Trivial Post-agglo rules discarded 2174 transitions
Performed 2174 trivial Post agglomeration. Transition count delta: 2174
Iterating post reduction 0 with 2174 rules applied. Total rules applied 2175 place count 6840 transition count 7397
Reduce places removed 2174 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4350 place count 4666 transition count 7396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 6 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1902 places :
Symmetric choice reduction at 3 with 1902 rule applications. Total rules 6797 place count 2491 transition count 5222
Iterating global reduction 3 with 1902 rules applied. Total rules applied 8699 place count 2491 transition count 5222
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 8699 place count 2491 transition count 5208
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 8727 place count 2477 transition count 5208
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 8963 place count 2241 transition count 3320
Iterating global reduction 3 with 236 rules applied. Total rules applied 9199 place count 2241 transition count 3320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9233 place count 2224 transition count 3303
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 9394 place count 2224 transition count 4794
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 9555 place count 2063 transition count 4794
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 9589 place count 2063 transition count 4794
Applied a total of 9589 rules in 2412 ms. Remains 2063 /6876 variables (removed 4813) and now considering 4794/9571 (removed 4777) transitions.
Finished structural reductions, in 1 iterations. Remains : 2063/6876 places, 4794/9571 transitions.
Normalized transition count is 4397 out of 4794 initially.
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-14 01:50:59] [INFO ] Computed 613 place invariants in 78 ms
Incomplete random walk after 1000000 steps, including 20085 resets, run finished after 19657 ms. (steps per millisecond=50 ) properties (out of 5) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4450 ms. (steps per millisecond=224 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4448 ms. (steps per millisecond=224 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 3878 resets, run finished after 4445 ms. (steps per millisecond=224 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4465 ms. (steps per millisecond=223 ) properties (out of 4) seen :1
[2023-03-14 01:51:36] [INFO ] Flow matrix only has 4397 transitions (discarded 397 similar events)
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-14 01:51:36] [INFO ] Computed 613 place invariants in 67 ms
[2023-03-14 01:51:36] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-14 01:51:37] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 114 ms returned sat
[2023-03-14 01:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:51:38] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2023-03-14 01:51:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:51:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-14 01:51:38] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-14 01:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:51:40] [INFO ] [Nat]Absence check using state equation in 1307 ms returned sat
[2023-03-14 01:51:40] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:51:42] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1980 ms returned sat
[2023-03-14 01:51:43] [INFO ] Deduced a trap composed of 482 places in 1538 ms of which 6 ms to minimize.
[2023-03-14 01:51:45] [INFO ] Deduced a trap composed of 211 places in 1712 ms of which 3 ms to minimize.
[2023-03-14 01:51:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3709 ms
[2023-03-14 01:51:46] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 386 ms.
[2023-03-14 01:51:47] [INFO ] Added : 22 causal constraints over 5 iterations in 2097 ms. Result :sat
[2023-03-14 01:51:48] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2023-03-14 01:51:48] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 42 ms returned unsat
[2023-03-14 01:51:48] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-14 01:51:48] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-14 01:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:51:49] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2023-03-14 01:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:51:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-14 01:51:50] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2023-03-14 01:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:51:51] [INFO ] [Nat]Absence check using state equation in 1267 ms returned sat
[2023-03-14 01:51:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 01:51:55] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4176 ms returned sat
[2023-03-14 01:51:57] [INFO ] Deduced a trap composed of 407 places in 1550 ms of which 3 ms to minimize.
[2023-03-14 01:51:59] [INFO ] Deduced a trap composed of 253 places in 1710 ms of which 2 ms to minimize.
[2023-03-14 01:51:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3646 ms
[2023-03-14 01:52:00] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 901 ms.
[2023-03-14 01:52:01] [INFO ] Added : 22 causal constraints over 5 iterations in 2185 ms. Result :sat
[2023-03-14 01:52:01] [INFO ] [Real]Absence check using 33 positive place invariants in 43 ms returned sat
[2023-03-14 01:52:02] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-14 01:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:03] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2023-03-14 01:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:52:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-14 01:52:03] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-14 01:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:05] [INFO ] [Nat]Absence check using state equation in 1316 ms returned sat
[2023-03-14 01:52:06] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1273 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0] Max seen :[0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 2063 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2063/2063 places, 4794/4794 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2063 transition count 4793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2062 transition count 4793
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2062 transition count 4791
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2060 transition count 4791
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 2058 transition count 4789
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2058 transition count 4789
Applied a total of 10 rules in 396 ms. Remains 2058 /2063 variables (removed 5) and now considering 4789/4794 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 2058/2063 places, 4789/4794 transitions.
Normalized transition count is 4392 out of 4789 initially.
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-14 01:52:07] [INFO ] Computed 613 place invariants in 69 ms
Incomplete random walk after 1000000 steps, including 20075 resets, run finished after 18932 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4399 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4394 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
[2023-03-14 01:52:34] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-14 01:52:34] [INFO ] Computed 613 place invariants in 68 ms
[2023-03-14 01:52:35] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-14 01:52:35] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 98 ms returned sat
[2023-03-14 01:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:36] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2023-03-14 01:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:52:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-14 01:52:37] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-14 01:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:38] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2023-03-14 01:52:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:52:40] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2143 ms returned sat
[2023-03-14 01:52:42] [INFO ] Deduced a trap composed of 293 places in 1551 ms of which 2 ms to minimize.
[2023-03-14 01:52:44] [INFO ] Deduced a trap composed of 181 places in 1672 ms of which 2 ms to minimize.
[2023-03-14 01:52:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3665 ms
[2023-03-14 01:52:44] [INFO ] Computed and/alt/rep : 1678/4431/1678 causal constraints (skipped 2697 transitions) in 277 ms.
[2023-03-14 01:52:46] [INFO ] Added : 22 causal constraints over 5 iterations in 1846 ms. Result :sat
[2023-03-14 01:52:46] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-14 01:52:46] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2023-03-14 01:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:47] [INFO ] [Real]Absence check using state equation in 1289 ms returned sat
[2023-03-14 01:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:52:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-14 01:52:48] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2023-03-14 01:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:52:49] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2023-03-14 01:52:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 01:52:55] [INFO ] [Nat]Added 2722 Read/Feed constraints in 6117 ms returned sat
[2023-03-14 01:52:57] [INFO ] Deduced a trap composed of 249 places in 1735 ms of which 2 ms to minimize.
[2023-03-14 01:52:59] [INFO ] Deduced a trap composed of 276 places in 1584 ms of which 2 ms to minimize.
[2023-03-14 01:53:01] [INFO ] Deduced a trap composed of 339 places in 1558 ms of which 3 ms to minimize.
[2023-03-14 01:53:03] [INFO ] Deduced a trap composed of 316 places in 1749 ms of which 4 ms to minimize.
[2023-03-14 01:53:05] [INFO ] Deduced a trap composed of 282 places in 1733 ms of which 3 ms to minimize.
[2023-03-14 01:53:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9993 ms
[2023-03-14 01:53:05] [INFO ] Computed and/alt/rep : 1678/4431/1678 causal constraints (skipped 2697 transitions) in 268 ms.
[2023-03-14 01:53:07] [INFO ] Added : 22 causal constraints over 5 iterations in 2138 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2058 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 150 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2058/2058 places, 4789/4789 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 145 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
[2023-03-14 01:53:08] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-14 01:53:08] [INFO ] Computed 613 place invariants in 67 ms
[2023-03-14 01:53:13] [INFO ] Implicit Places using invariants in 4829 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 326, 327, 329, 331, 335, 341, 349, 359, 370, 380, 381, 382, 383, 384, 385, 386, 387, 388, 396, 402, 406, 408, 410, 412, 431, 437, 439, 440, 441, 442, 443, 444, 445, 446, 447, 449, 451, 453, 457, 463, 471, 480, 488, 489, 490, 491, 492, 493, 494, 495, 496, 502, 506, 508, 510, 512, 514, 533, 539, 541, 542, 543, 544, 545, 546, 547, 548, 549, 551, 553, 555, 557, 561, 567, 574, 580, 581, 582, 583, 584, 585, 586, 587, 588, 592, 594, 596, 598, 600, 602, 621, 627, 629, 630, 631, 632, 633, 634, 635, 636, 637, 639, 641, 643, 645, 647, 651, 656, 660, 661, 662, 663, 664, 665, 666, 667, 668, 670, 672, 674, 676, 678, 680, 699, 705, 707, 708, 709, 710, 711, 712, 713, 714, 715, 717, 719, 721, 723, 725, 727, 730, 732, 733, 734, 735, 736, 737, 738, 739, 740, 742, 744, 746, 748, 750, 752, 771, 777, 779, 780, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 810, 811, 813, 815, 817, 819, 821, 823, 842, 844, 847, 849, 850, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 869, 871, 873, 874, 875, 876, 877, 878, 879, 880, 881, 883, 885, 887, 889, 891, 893, 912, 918, 920, 921, 922, 923, 924, 925, 926, 927, 928, 930, 932, 934, 936, 938, 940, 942, 944, 945, 946, 947, 948, 949, 950, 951, 952, 954, 956, 958, 960, 962, 964, 983, 989, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1026, 1028, 1030, 1032, 1034, 1036, 1055, 1061, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1073, 1075, 1077, 1079, 1081, 1083, 1087, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1104, 1106, 1108, 1110, 1112, 1114, 1133, 1139, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1151, 1153, 1155, 1157, 1159, 1163, 1169, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1190, 1194, 1196, 1198, 1200, 1202, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1288, 1294, 1298, 1301, 1303, 1305, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1344, 1346, 1350, 1356, 1364, 1374, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1403, 1411, 1417, 1421, 1423, 1425, 1444, 1450, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1462, 1464, 1468, 1474, 1482, 1492, 1504, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1537, 1547, 1555, 1561, 1565, 1567, 1586, 1588, 1591, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1603, 1607, 1613, 1621, 1631, 1643, 1657, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1694, 1706, 1716, 1724, 1730, 1734, 1753]
Discarding 564 places :
Implicit Place search using SMT only with invariants took 4845 ms to find 564 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1494/2058 places, 4789/4789 transitions.
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 256 place count 1238 transition count 4533
Iterating global reduction 0 with 256 rules applied. Total rules applied 512 place count 1238 transition count 4533
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 768 place count 982 transition count 4277
Iterating global reduction 0 with 256 rules applied. Total rules applied 1024 place count 982 transition count 4277
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1027 place count 982 transition count 4274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1030 place count 979 transition count 4274
Applied a total of 1030 rules in 306 ms. Remains 979 /1494 variables (removed 515) and now considering 4274/4789 (removed 515) transitions.
[2023-03-14 01:53:13] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:53:13] [INFO ] Computed 49 place invariants in 29 ms
[2023-03-14 01:53:14] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2023-03-14 01:53:14] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:53:14] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-14 01:53:15] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:53:38] [INFO ] Implicit Places using invariants and state equation in 23351 ms returned []
Implicit Place search using SMT with State Equation took 24475 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 979/2058 places, 4274/4789 transitions.
Finished structural reductions, in 2 iterations. Remains : 979/2058 places, 4274/4789 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:53:38] [INFO ] Computed 49 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 21025 resets, run finished after 18624 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3015 resets, run finished after 3337 ms. (steps per millisecond=299 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3013 resets, run finished after 3370 ms. (steps per millisecond=296 ) properties (out of 2) seen :0
[2023-03-14 01:54:03] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:54:03] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-14 01:54:03] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:54:03] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:54:04] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-14 01:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:54:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:54:04] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:54:05] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2023-03-14 01:54:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:54:07] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1607 ms returned sat
[2023-03-14 01:54:07] [INFO ] Deduced a trap composed of 205 places in 443 ms of which 1 ms to minimize.
[2023-03-14 01:54:08] [INFO ] Deduced a trap composed of 100 places in 541 ms of which 1 ms to minimize.
[2023-03-14 01:54:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1268 ms
[2023-03-14 01:54:08] [INFO ] Computed and/alt/rep : 1340/1931/1340 causal constraints (skipped 2475 transitions) in 224 ms.
[2023-03-14 01:54:09] [INFO ] Added : 17 causal constraints over 4 iterations in 972 ms. Result :sat
[2023-03-14 01:54:09] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:54:09] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-14 01:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:54:10] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2023-03-14 01:54:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:54:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:54:10] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-14 01:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:54:11] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2023-03-14 01:54:13] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2148 ms returned sat
[2023-03-14 01:54:13] [INFO ] Deduced a trap composed of 276 places in 443 ms of which 1 ms to minimize.
[2023-03-14 01:54:14] [INFO ] Deduced a trap composed of 82 places in 526 ms of which 1 ms to minimize.
[2023-03-14 01:54:15] [INFO ] Deduced a trap composed of 97 places in 529 ms of which 1 ms to minimize.
[2023-03-14 01:54:16] [INFO ] Deduced a trap composed of 91 places in 531 ms of which 1 ms to minimize.
[2023-03-14 01:54:17] [INFO ] Deduced a trap composed of 91 places in 522 ms of which 0 ms to minimize.
[2023-03-14 01:54:17] [INFO ] Deduced a trap composed of 121 places in 515 ms of which 1 ms to minimize.
[2023-03-14 01:54:18] [INFO ] Deduced a trap composed of 129 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:54:19] [INFO ] Deduced a trap composed of 121 places in 520 ms of which 1 ms to minimize.
[2023-03-14 01:54:20] [INFO ] Deduced a trap composed of 103 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:54:20] [INFO ] Deduced a trap composed of 92 places in 517 ms of which 1 ms to minimize.
[2023-03-14 01:54:21] [INFO ] Deduced a trap composed of 104 places in 518 ms of which 1 ms to minimize.
[2023-03-14 01:54:22] [INFO ] Deduced a trap composed of 97 places in 531 ms of which 1 ms to minimize.
[2023-03-14 01:54:22] [INFO ] Deduced a trap composed of 101 places in 522 ms of which 1 ms to minimize.
[2023-03-14 01:54:23] [INFO ] Deduced a trap composed of 112 places in 517 ms of which 1 ms to minimize.
[2023-03-14 01:54:24] [INFO ] Deduced a trap composed of 108 places in 532 ms of which 1 ms to minimize.
[2023-03-14 01:54:25] [INFO ] Deduced a trap composed of 276 places in 436 ms of which 1 ms to minimize.
[2023-03-14 01:54:25] [INFO ] Deduced a trap composed of 359 places in 517 ms of which 1 ms to minimize.
[2023-03-14 01:54:26] [INFO ] Deduced a trap composed of 82 places in 518 ms of which 1 ms to minimize.
[2023-03-14 01:54:27] [INFO ] Deduced a trap composed of 87 places in 528 ms of which 1 ms to minimize.
[2023-03-14 01:54:27] [INFO ] Deduced a trap composed of 222 places in 447 ms of which 1 ms to minimize.
[2023-03-14 01:54:28] [INFO ] Deduced a trap composed of 97 places in 532 ms of which 1 ms to minimize.
[2023-03-14 01:54:29] [INFO ] Deduced a trap composed of 96 places in 523 ms of which 0 ms to minimize.
[2023-03-14 01:54:30] [INFO ] Deduced a trap composed of 82 places in 530 ms of which 1 ms to minimize.
[2023-03-14 01:54:31] [INFO ] Deduced a trap composed of 97 places in 526 ms of which 0 ms to minimize.
[2023-03-14 01:54:32] [INFO ] Deduced a trap composed of 83 places in 535 ms of which 1 ms to minimize.
[2023-03-14 01:54:32] [INFO ] Deduced a trap composed of 87 places in 547 ms of which 1 ms to minimize.
[2023-03-14 01:54:33] [INFO ] Deduced a trap composed of 85 places in 531 ms of which 0 ms to minimize.
[2023-03-14 01:54:34] [INFO ] Deduced a trap composed of 199 places in 449 ms of which 1 ms to minimize.
[2023-03-14 01:54:34] [INFO ] Deduced a trap composed of 96 places in 534 ms of which 1 ms to minimize.
[2023-03-14 01:54:35] [INFO ] Deduced a trap composed of 94 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:54:36] [INFO ] Deduced a trap composed of 87 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:54:37] [INFO ] Deduced a trap composed of 84 places in 541 ms of which 1 ms to minimize.
[2023-03-14 01:54:37] [INFO ] Deduced a trap composed of 95 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:54:38] [INFO ] Deduced a trap composed of 82 places in 528 ms of which 1 ms to minimize.
[2023-03-14 01:54:39] [INFO ] Deduced a trap composed of 85 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:54:40] [INFO ] Deduced a trap composed of 108 places in 522 ms of which 1 ms to minimize.
[2023-03-14 01:54:42] [INFO ] Deduced a trap composed of 92 places in 521 ms of which 1 ms to minimize.
[2023-03-14 01:54:43] [INFO ] Deduced a trap composed of 101 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:54:43] [INFO ] Deduced a trap composed of 97 places in 531 ms of which 1 ms to minimize.
[2023-03-14 01:54:44] [INFO ] Deduced a trap composed of 88 places in 536 ms of which 0 ms to minimize.
[2023-03-14 01:54:45] [INFO ] Deduced a trap composed of 84 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:54:45] [INFO ] Deduced a trap composed of 95 places in 518 ms of which 1 ms to minimize.
[2023-03-14 01:54:46] [INFO ] Deduced a trap composed of 83 places in 528 ms of which 1 ms to minimize.
[2023-03-14 01:54:47] [INFO ] Deduced a trap composed of 286 places in 461 ms of which 4 ms to minimize.
[2023-03-14 01:54:47] [INFO ] Deduced a trap composed of 99 places in 516 ms of which 1 ms to minimize.
[2023-03-14 01:54:48] [INFO ] Deduced a trap composed of 88 places in 521 ms of which 1 ms to minimize.
[2023-03-14 01:54:49] [INFO ] Deduced a trap composed of 293 places in 530 ms of which 1 ms to minimize.
[2023-03-14 01:54:49] [INFO ] Deduced a trap composed of 103 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:54:50] [INFO ] Deduced a trap composed of 110 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:54:51] [INFO ] Deduced a trap composed of 95 places in 522 ms of which 1 ms to minimize.
[2023-03-14 01:54:51] [INFO ] Deduced a trap composed of 108 places in 518 ms of which 0 ms to minimize.
[2023-03-14 01:54:52] [INFO ] Deduced a trap composed of 91 places in 529 ms of which 1 ms to minimize.
[2023-03-14 01:54:52] [INFO ] Deduced a trap composed of 86 places in 518 ms of which 1 ms to minimize.
[2023-03-14 01:54:53] [INFO ] Deduced a trap composed of 70 places in 530 ms of which 0 ms to minimize.
[2023-03-14 01:54:54] [INFO ] Deduced a trap composed of 110 places in 524 ms of which 3 ms to minimize.
[2023-03-14 01:54:55] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 1 ms to minimize.
[2023-03-14 01:54: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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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, 1] Max seen :[0, 0]
Support contains 2 out of 979 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 114 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 112 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-14 01:54:56] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:54:56] [INFO ] Computed 49 place invariants in 30 ms
[2023-03-14 01:54:57] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2023-03-14 01:54:57] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:54:57] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-14 01:54:58] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:55:20] [INFO ] Implicit Places using invariants and state equation in 23210 ms returned []
Implicit Place search using SMT with State Equation took 24337 ms to find 0 implicit places.
[2023-03-14 01:55:20] [INFO ] Redundant transitions in 302 ms returned []
[2023-03-14 01:55:20] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:55:20] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-14 01:55:22] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4274/4274 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:55:22] [INFO ] Computed 49 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2023-03-14 01:55:22] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:55:22] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-14 01:55:22] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:55:22] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:55:23] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2023-03-14 01:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:55:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:55:23] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-14 01:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:55:24] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2023-03-14 01:55:24] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:55:26] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1607 ms returned sat
[2023-03-14 01:55:26] [INFO ] Deduced a trap composed of 205 places in 445 ms of which 1 ms to minimize.
[2023-03-14 01:55:27] [INFO ] Deduced a trap composed of 100 places in 526 ms of which 0 ms to minimize.
[2023-03-14 01:55:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1260 ms
[2023-03-14 01:55:27] [INFO ] Computed and/alt/rep : 1340/1931/1340 causal constraints (skipped 2475 transitions) in 219 ms.
[2023-03-14 01:55:28] [INFO ] Added : 17 causal constraints over 4 iterations in 974 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 979 transition count 4273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4273
Applied a total of 2 rules in 235 ms. Remains 978 /979 variables (removed 1) and now considering 4273/4274 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 978/979 places, 4273/4274 transitions.
Normalized transition count is 3875 out of 4273 initially.
// Phase 1: matrix 3875 rows 978 cols
[2023-03-14 01:55:28] [INFO ] Computed 49 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 21032 resets, run finished after 18644 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3020 resets, run finished after 3344 ms. (steps per millisecond=299 ) properties (out of 1) seen :0
[2023-03-14 01:55:50] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2023-03-14 01:55:50] [INFO ] Computed 49 place invariants in 32 ms
[2023-03-14 01:55:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-14 01:55:50] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:55:51] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2023-03-14 01:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:55:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:55:51] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:55:52] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2023-03-14 01:55:52] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:55:53] [INFO ] [Nat]Added 2722 Read/Feed constraints in 593 ms returned sat
[2023-03-14 01:55:53] [INFO ] Deduced a trap composed of 145 places in 444 ms of which 0 ms to minimize.
[2023-03-14 01:55:54] [INFO ] Deduced a trap composed of 111 places in 539 ms of which 1 ms to minimize.
[2023-03-14 01:55:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1261 ms
[2023-03-14 01:55:54] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 204 ms.
[2023-03-14 01:55:55] [INFO ] Added : 17 causal constraints over 4 iterations in 941 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 978 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 117 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 111 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2023-03-14 01:55:55] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2023-03-14 01:55:55] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-14 01:55:57] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-14 01:55:57] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2023-03-14 01:55:57] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-14 01:55:57] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:56:18] [INFO ] Implicit Places using invariants and state equation in 21430 ms returned []
Implicit Place search using SMT with State Equation took 22538 ms to find 0 implicit places.
[2023-03-14 01:56:18] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-14 01:56:18] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2023-03-14 01:56:18] [INFO ] Computed 49 place invariants in 31 ms
[2023-03-14 01:56:20] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 978/978 places, 4273/4273 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 in 57886 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:56:20] [INFO ] Computed 49 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
[2023-03-14 01:56:20] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:56:20] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-14 01:56:20] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:56:20] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-14 01:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:56:21] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2023-03-14 01:56:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:56:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:56:21] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:56:22] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2023-03-14 01:56:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:56:24] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2116 ms returned sat
[2023-03-14 01:56:24] [INFO ] Deduced a trap composed of 276 places in 444 ms of which 1 ms to minimize.
[2023-03-14 01:56:25] [INFO ] Deduced a trap composed of 82 places in 519 ms of which 1 ms to minimize.
[2023-03-14 01:56:26] [INFO ] Deduced a trap composed of 97 places in 521 ms of which 1 ms to minimize.
[2023-03-14 01:56:26] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1966 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 111 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4274/4274 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:56:26] [INFO ] Computed 49 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 21030 resets, run finished after 18646 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3020 resets, run finished after 3333 ms. (steps per millisecond=300 ) properties (out of 1) seen :0
[2023-03-14 01:56:48] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:56:48] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-14 01:56:48] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:56:48] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-14 01:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 01:56:49] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2023-03-14 01:56:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 01:56:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-14 01:56:49] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-14 01:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 01:56:50] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2023-03-14 01:56:50] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:56:52] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2125 ms returned sat
[2023-03-14 01:56:53] [INFO ] Deduced a trap composed of 276 places in 443 ms of which 0 ms to minimize.
[2023-03-14 01:56:53] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 1 ms to minimize.
[2023-03-14 01:56:54] [INFO ] Deduced a trap composed of 97 places in 550 ms of which 1 ms to minimize.
[2023-03-14 01:56:55] [INFO ] Deduced a trap composed of 91 places in 526 ms of which 1 ms to minimize.
[2023-03-14 01:56:56] [INFO ] Deduced a trap composed of 91 places in 534 ms of which 1 ms to minimize.
[2023-03-14 01:56:57] [INFO ] Deduced a trap composed of 121 places in 514 ms of which 1 ms to minimize.
[2023-03-14 01:56:58] [INFO ] Deduced a trap composed of 129 places in 519 ms of which 1 ms to minimize.
[2023-03-14 01:56:58] [INFO ] Deduced a trap composed of 121 places in 526 ms of which 1 ms to minimize.
[2023-03-14 01:56:59] [INFO ] Deduced a trap composed of 103 places in 543 ms of which 1 ms to minimize.
[2023-03-14 01:57:00] [INFO ] Deduced a trap composed of 92 places in 522 ms of which 1 ms to minimize.
[2023-03-14 01:57:00] [INFO ] Deduced a trap composed of 104 places in 514 ms of which 1 ms to minimize.
[2023-03-14 01:57:01] [INFO ] Deduced a trap composed of 97 places in 524 ms of which 0 ms to minimize.
[2023-03-14 01:57:02] [INFO ] Deduced a trap composed of 101 places in 509 ms of which 1 ms to minimize.
[2023-03-14 01:57:02] [INFO ] Deduced a trap composed of 112 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:57:04] [INFO ] Deduced a trap composed of 108 places in 537 ms of which 1 ms to minimize.
[2023-03-14 01:57:04] [INFO ] Deduced a trap composed of 276 places in 439 ms of which 1 ms to minimize.
[2023-03-14 01:57:05] [INFO ] Deduced a trap composed of 359 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:57:06] [INFO ] Deduced a trap composed of 82 places in 519 ms of which 0 ms to minimize.
[2023-03-14 01:57:06] [INFO ] Deduced a trap composed of 87 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:57:07] [INFO ] Deduced a trap composed of 222 places in 443 ms of which 1 ms to minimize.
[2023-03-14 01:57:08] [INFO ] Deduced a trap composed of 97 places in 531 ms of which 1 ms to minimize.
[2023-03-14 01:57:09] [INFO ] Deduced a trap composed of 96 places in 510 ms of which 1 ms to minimize.
[2023-03-14 01:57:09] [INFO ] Deduced a trap composed of 82 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:57:10] [INFO ] Deduced a trap composed of 97 places in 523 ms of which 1 ms to minimize.
[2023-03-14 01:57:11] [INFO ] Deduced a trap composed of 83 places in 526 ms of which 1 ms to minimize.
[2023-03-14 01:57:12] [INFO ] Deduced a trap composed of 87 places in 520 ms of which 1 ms to minimize.
[2023-03-14 01:57:12] [INFO ] Deduced a trap composed of 85 places in 536 ms of which 1 ms to minimize.
[2023-03-14 01:57:13] [INFO ] Deduced a trap composed of 199 places in 444 ms of which 1 ms to minimize.
[2023-03-14 01:57:14] [INFO ] Deduced a trap composed of 96 places in 527 ms of which 1 ms to minimize.
[2023-03-14 01:57:14] [INFO ] Deduced a trap composed of 94 places in 536 ms of which 0 ms to minimize.
[2023-03-14 01:57:16] [INFO ] Deduced a trap composed of 87 places in 529 ms of which 0 ms to minimize.
[2023-03-14 01:57:16] [INFO ] Deduced a trap composed of 84 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:57:17] [INFO ] Deduced a trap composed of 95 places in 522 ms of which 1 ms to minimize.
[2023-03-14 01:57:17] [INFO ] Deduced a trap composed of 82 places in 529 ms of which 0 ms to minimize.
[2023-03-14 01:57:18] [INFO ] Deduced a trap composed of 85 places in 525 ms of which 0 ms to minimize.
[2023-03-14 01:57:20] [INFO ] Deduced a trap composed of 108 places in 528 ms of which 1 ms to minimize.
[2023-03-14 01:57:21] [INFO ] Deduced a trap composed of 92 places in 526 ms of which 1 ms to minimize.
[2023-03-14 01:57:22] [INFO ] Deduced a trap composed of 101 places in 518 ms of which 0 ms to minimize.
[2023-03-14 01:57:23] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:57:23] [INFO ] Deduced a trap composed of 88 places in 524 ms of which 1 ms to minimize.
[2023-03-14 01:57:24] [INFO ] Deduced a trap composed of 84 places in 527 ms of which 0 ms to minimize.
[2023-03-14 01:57:25] [INFO ] Deduced a trap composed of 95 places in 521 ms of which 0 ms to minimize.
[2023-03-14 01:57:25] [INFO ] Deduced a trap composed of 83 places in 520 ms of which 1 ms to minimize.
[2023-03-14 01:57:26] [INFO ] Deduced a trap composed of 286 places in 443 ms of which 0 ms to minimize.
[2023-03-14 01:57:27] [INFO ] Deduced a trap composed of 99 places in 519 ms of which 1 ms to minimize.
[2023-03-14 01:57:27] [INFO ] Deduced a trap composed of 88 places in 529 ms of which 1 ms to minimize.
[2023-03-14 01:57:28] [INFO ] Deduced a trap composed of 293 places in 518 ms of which 1 ms to minimize.
[2023-03-14 01:57:29] [INFO ] Deduced a trap composed of 103 places in 510 ms of which 1 ms to minimize.
[2023-03-14 01:57:29] [INFO ] Deduced a trap composed of 110 places in 511 ms of which 1 ms to minimize.
[2023-03-14 01:57:30] [INFO ] Deduced a trap composed of 95 places in 525 ms of which 1 ms to minimize.
[2023-03-14 01:57:31] [INFO ] Deduced a trap composed of 108 places in 530 ms of which 0 ms to minimize.
[2023-03-14 01:57:31] [INFO ] Deduced a trap composed of 91 places in 528 ms of which 1 ms to minimize.
[2023-03-14 01:57:32] [INFO ] Deduced a trap composed of 86 places in 531 ms of which 1 ms to minimize.
[2023-03-14 01:57:32] [INFO ] Deduced a trap composed of 70 places in 533 ms of which 1 ms to minimize.
[2023-03-14 01:57:33] [INFO ] Deduced a trap composed of 110 places in 514 ms of which 1 ms to minimize.
[2023-03-14 01:57:35] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 1 ms to minimize.
[2023-03-14 01:57:35] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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 979 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 123 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 110 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-14 01:57:35] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:57:35] [INFO ] Computed 49 place invariants in 28 ms
[2023-03-14 01:57:36] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2023-03-14 01:57:36] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:57:36] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-14 01:57:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-14 01:57:58] [INFO ] Implicit Places using invariants and state equation in 22130 ms returned []
Implicit Place search using SMT with State Equation took 23255 ms to find 0 implicit places.
[2023-03-14 01:57:58] [INFO ] Redundant transitions in 212 ms returned []
[2023-03-14 01:57:58] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-14 01:57:58] [INFO ] Computed 49 place invariants in 30 ms
[2023-03-14 01:58:00] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4274/4274 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 100192 ms.
[2023-03-14 01:58:00] [INFO ] Flatten gal took : 355 ms
[2023-03-14 01:58:00] [INFO ] Applying decomposition
[2023-03-14 01:58:01] [INFO ] Flatten gal took : 187 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7140497160555461928.txt' '-o' '/tmp/graph7140497160555461928.bin' '-w' '/tmp/graph7140497160555461928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7140497160555461928.bin' '-l' '-1' '-v' '-w' '/tmp/graph7140497160555461928.weights' '-q' '0' '-e' '0.001'
[2023-03-14 01:58:01] [INFO ] Decomposing Gal with order
[2023-03-14 01:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 01:58:02] [INFO ] Removed a total of 8242 redundant transitions.
[2023-03-14 01:58:02] [INFO ] Flatten gal took : 927 ms
[2023-03-14 01:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2409 labels/synchronizations in 272 ms.
[2023-03-14 01:58:03] [INFO ] Time to serialize gal into /tmp/UpperBounds17820852302435873671.gal : 100 ms
[2023-03-14 01:58:03] [INFO ] Time to serialize properties into /tmp/UpperBounds11536710537993677741.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17820852302435873671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11536710537993677741.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds11536710537993677741.prop.
Detected timeout of ITS tools.
[2023-03-14 02:20:57] [INFO ] Flatten gal took : 4842 ms
[2023-03-14 02:20:57] [INFO ] Time to serialize gal into /tmp/UpperBounds14105325834912940858.gal : 92 ms
[2023-03-14 02:20:57] [INFO ] Time to serialize properties into /tmp/UpperBounds7688392595413710890.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14105325834912940858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7688392595413710890.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds7688392595413710890.prop.
Detected timeout of ITS tools.
[2023-03-14 02:43:45] [INFO ] Flatten gal took : 752 ms
[2023-03-14 02:43:49] [INFO ] Input system was already deterministic with 4274 transitions.
[2023-03-14 02:43:49] [INFO ] Transformed 979 places.
[2023-03-14 02:43:49] [INFO ] Transformed 4274 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2023-03-14 02:43:50] [INFO ] Time to serialize gal into /tmp/UpperBounds15486748999736063602.gal : 14 ms
[2023-03-14 02:43:50] [INFO ] Time to serialize properties into /tmp/UpperBounds1674274870024131807.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15486748999736063602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1674274870024131807.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1674274870024131807.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S16C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r255-tall-167856440400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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