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.r313-tall-167873966100427.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 smartxred
Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891582816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:46:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:46:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:46:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 474 ms
[2023-03-15 14:46:24] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 17 ms.
[2023-03-15 14:46:24] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 219 ms.
[2023-03-15 14:46:24] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:46:25] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:46:25] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:46:25] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 25 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 926 ms. (steps per millisecond=10 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-15 14:46:26] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 14:46:26] [INFO ] Computed 92 place invariants in 113 ms
[2023-03-15 14:46:28] [INFO ] [Real]Absence check using 85 positive place invariants in 30 ms returned sat
[2023-03-15 14:46:28] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:46:29] [INFO ] After 853ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-15 14:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:46:29] [INFO ] After 192ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:8
[2023-03-15 14:46:29] [INFO ] After 452ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-15 14:46:29] [INFO ] After 1998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2023-03-15 14:46:29] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2023-03-15 14:46:29] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:46:35] [INFO ] After 5537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 14:46:37] [INFO ] After 1651ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-15 14:46:39] [INFO ] Deduced a trap composed of 337 places in 483 ms of which 1 ms to minimize.
[2023-03-15 14:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2023-03-15 14:46:49] [INFO ] After 13973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1800 ms.
[2023-03-15 14:46:51] [INFO ] After 21742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 1028 ms.
Support contains 85 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1872
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1869
Applied a total of 152 rules in 252 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
[2023-03-15 14:46:52] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2023-03-15 14:46:52] [INFO ] Computed 82 place invariants in 55 ms
[2023-03-15 14:46:53] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 583/664 places, 1254/1940 transitions.
Applied a total of 0 rules in 46 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 583/664 places, 1254/1940 transitions.
Incomplete random walk after 1000000 steps, including 65181 resets, run finished after 6956 ms. (steps per millisecond=143 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8902 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:47:02] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 14:47:02] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 14:47:02] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:47:02] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 14:47:02] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:02] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 14:47:02] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 14:47:02] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:02] [INFO ] After 217ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 2 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 2 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 1 ms to minimize.
[2023-03-15 14:47:04] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 1 ms to minimize.
[2023-03-15 14:47:04] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 8 ms to minimize.
[2023-03-15 14:47:04] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 1 ms to minimize.
[2023-03-15 14:47:05] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:47:05] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-15 14:47:05] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-15 14:47:06] [INFO ] Deduced a trap composed of 244 places in 278 ms of which 1 ms to minimize.
[2023-03-15 14:47:06] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:47:06] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:47:07] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-15 14:47:07] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 2 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 5 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 2 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 0 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 4 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 2 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Deduced a trap composed of 252 places in 267 ms of which 0 ms to minimize.
[2023-03-15 14:47:36] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 2 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 238 places in 239 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 244 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 244 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 64418 ms
[2023-03-15 14:48:07] [INFO ] After 64684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:48:07] [INFO ] After 65104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 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 583 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 580 transition count 1251
Applied a total of 6 rules in 75 ms. Remains 580 /583 variables (removed 3) and now considering 1251/1254 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 580/583 places, 1251/1254 transitions.
Incomplete random walk after 1000000 steps, including 72841 resets, run finished after 9340 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8804 resets, run finished after 1774 ms. (steps per millisecond=563 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5286306 steps, run timeout after 33001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 5286306 steps, saw 910559 distinct states, run finished after 33005 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:48:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-15 14:48:51] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 14:48:51] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 14:48:51] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:48:51] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2023-03-15 14:48:51] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:48:52] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:48:52] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:48:55] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:48:55] [INFO ] Deduced a trap composed of 240 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:48:55] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 218 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:48:58] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:48:58] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:48:58] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 243 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-15 14:49:01] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:49:01] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:49:03] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:49:03] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:03] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:04] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:49:04] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:49:04] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:49:06] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:49:06] [INFO ] Deduced a trap composed of 240 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:49:07] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:07] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:49:07] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:49:08] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:49:08] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:49:16] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:49:25] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 32757 ms
[2023-03-15 14:49:25] [INFO ] After 32903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:49:25] [INFO ] After 33793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 14:49:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:49:25] [INFO ] Invariant cache hit.
[2023-03-15 14:49:26] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-15 14:49:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:49:26] [INFO ] Invariant cache hit.
[2023-03-15 14:49:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:49:29] [INFO ] Implicit Places using invariants and state equation in 2995 ms returned []
Implicit Place search using SMT with State Equation took 3514 ms to find 0 implicit places.
[2023-03-15 14:49:29] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-15 14:49:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:49:29] [INFO ] Invariant cache hit.
[2023-03-15 14:49:29] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4101 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7287 resets, run finished after 1024 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:49:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:49:30] [INFO ] Invariant cache hit.
[2023-03-15 14:49:30] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 14:49:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:49:31] [INFO ] After 296ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:49:31] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:49:31] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:49:31] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:49:31] [INFO ] [Nat]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-15 14:49:31] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:49:31] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:49:31] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:49:32] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:49:32] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:49:32] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-15 14:49:32] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:33] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-15 14:49:33] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:49:33] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-15 14:49:34] [INFO ] Deduced a trap composed of 241 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:49:34] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:49:34] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:49:35] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:49:35] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:49:35] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:49:36] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:49:36] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-15 14:49:36] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:49:36] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:49:37] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-15 14:49:37] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:49:38] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:49:38] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:49:38] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 220 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23624 ms
[2023-03-15 14:49:55] [INFO ] After 23847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:49:55] [INFO ] After 24267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72604 resets, run finished after 9336 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8933 resets, run finished after 1766 ms. (steps per millisecond=566 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5291900 steps, run timeout after 33001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 5291900 steps, saw 911584 distinct states, run finished after 33001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:50:39] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:50:39] [INFO ] Invariant cache hit.
[2023-03-15 14:50:39] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-15 14:50:39] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:50:39] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:39] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:50:39] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:50:40] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:40] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 241 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 1 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 2 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:50:48] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:50:48] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:50:48] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 1 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 2 ms to minimize.
[2023-03-15 14:50:53] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:50:53] [INFO ] Deduced a trap composed of 220 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23394 ms
[2023-03-15 14:51:03] [INFO ] After 23642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:51:03] [INFO ] After 24116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 14:51:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:51:04] [INFO ] Invariant cache hit.
[2023-03-15 14:51:04] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-15 14:51:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:51:04] [INFO ] Invariant cache hit.
[2023-03-15 14:51:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:07] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 3300 ms to find 0 implicit places.
[2023-03-15 14:51:07] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 14:51:07] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:51:07] [INFO ] Invariant cache hit.
[2023-03-15 14:51:07] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3880 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7217 resets, run finished after 941 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:08] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:51:08] [INFO ] Invariant cache hit.
[2023-03-15 14:51:08] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 14:51:08] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:51:09] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:09] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:51:09] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:09] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:09] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 14:51:09] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 14:51:09] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:09] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:51:11] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:51:11] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:51:11] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 241 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 0 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 0 ms to minimize.
[2023-03-15 14:51:15] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 1 ms to minimize.
[2023-03-15 14:51:15] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-15 14:51:15] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 0 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:18] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:51:18] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:51:18] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:51:19] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:51:19] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:51:19] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:51:22] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 220 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:51:24] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:51:24] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:33] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23651 ms
[2023-03-15 14:51:33] [INFO ] After 23796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:51:33] [INFO ] After 24230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 737 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470752 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470752 steps, saw 76147 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:36] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:51:36] [INFO ] Invariant cache hit.
[2023-03-15 14:51:36] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:51:36] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:51:36] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:36] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 14:51:36] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:51:37] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:37] [INFO ] After 135ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:37] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:51:37] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 2 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:51:46] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-15 14:51:46] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:51:48] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-15 14:52:00] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2023-03-15 14:52:00] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:52:00] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:52:01] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:52:01] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24395 ms
[2023-03-15 14:52:01] [INFO ] After 24533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:52:01] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 31 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 14:52:01] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:52:01] [INFO ] Invariant cache hit.
[2023-03-15 14:52:02] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 713 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 475270 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475270 steps, saw 76872 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:52:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:52:05] [INFO ] Invariant cache hit.
[2023-03-15 14:52:05] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:52:05] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:52:05] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:52:05] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 14:52:06] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:06] [INFO ] After 125ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:06] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:52:06] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:52:07] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:52:07] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:52:07] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:52:15] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:52:15] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:52:16] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:52:16] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:52:17] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:52:18] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 222 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:52:29] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:52:29] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:52:30] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:52:30] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:52:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:52:30] [INFO ] After 25171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 21 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 14:52:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:52:30] [INFO ] Invariant cache hit.
[2023-03-15 14:52:31] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-15 14:52:31] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:52:31] [INFO ] Invariant cache hit.
[2023-03-15 14:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:33] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2023-03-15 14:52:33] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 14:52:33] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 14:52:33] [INFO ] Invariant cache hit.
[2023-03-15 14:52:33] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2967 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 119 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-15 14:52:33] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-15 14:52:33] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 14:52:33] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:52:33] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:34] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:52:34] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:52:35] [INFO ] After 937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 238 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 238 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 0 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 0 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 226 places in 214 ms of which 0 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 224 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 226 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 228 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 0 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 238 places in 231 ms of which 0 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 0 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 226 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 1 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 244 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 230 places in 208 ms of which 0 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 226 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 1 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 1 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 232 places in 217 ms of which 0 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:52:55] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:52:55] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:52:55] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:52:55] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:52:56] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:52:56] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:52:56] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:52:56] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:52:57] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:52:57] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:52:57] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:52:57] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:52:59] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:52:59] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:52:59] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 0 ms to minimize.
[2023-03-15 14:53:00] [INFO ] Deduced a trap composed of 226 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:53:00] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:53:02] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:53:03] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:53:04] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 1 ms to minimize.
[2023-03-15 14:53:05] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:53:05] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:53:08] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:53:09] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 1 ms to minimize.
[2023-03-15 14:53:09] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 0 ms to minimize.
[2023-03-15 14:53:09] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2023-03-15 14:53:09] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:53:10] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:53:10] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:53:10] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:53:10] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:53:11] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:53:13] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2023-03-15 14:53:13] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:53:14] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:53:14] [INFO ] Deduced a trap composed of 228 places in 214 ms of which 1 ms to minimize.
[2023-03-15 14:53:14] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:53:14] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:53:15] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:53:15] [INFO ] Deduced a trap composed of 232 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:53:15] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:53:16] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:53:25] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 50818 ms
[2023-03-15 14:53:26] [INFO ] After 52187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:53:26] [INFO ] After 52301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 90 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:53:26] [INFO ] Invariant cache hit.
[2023-03-15 14:53:26] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-15 14:53:26] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:53:26] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:53:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 14:53:26] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 14:53:26] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:53:27] [INFO ] Deduced a trap composed of 222 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:53:27] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:53:27] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 0 ms to minimize.
[2023-03-15 14:53:27] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 1 ms to minimize.
[2023-03-15 14:53:28] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:53:28] [INFO ] Deduced a trap composed of 220 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:53:28] [INFO ] Deduced a trap composed of 232 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:53:29] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:53:29] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:53:29] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 0 ms to minimize.
[2023-03-15 14:53:30] [INFO ] Deduced a trap composed of 222 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:53:30] [INFO ] Deduced a trap composed of 222 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:53:30] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 6 ms to minimize.
[2023-03-15 14:53:30] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 1 ms to minimize.
[2023-03-15 14:53:31] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:53:31] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:53:31] [INFO ] Deduced a trap composed of 218 places in 228 ms of which 0 ms to minimize.
[2023-03-15 14:53:31] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 220 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 220 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 220 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:53:33] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 0 ms to minimize.
[2023-03-15 14:53:33] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:53:33] [INFO ] Deduced a trap composed of 226 places in 212 ms of which 0 ms to minimize.
[2023-03-15 14:53:33] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:53:34] [INFO ] Deduced a trap composed of 232 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:53:34] [INFO ] Deduced a trap composed of 220 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:53:34] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 0 ms to minimize.
[2023-03-15 14:53:34] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 1 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 235 places in 214 ms of which 1 ms to minimize.
[2023-03-15 14:53:36] [INFO ] Deduced a trap composed of 223 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:53:36] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 1 ms to minimize.
[2023-03-15 14:53:36] [INFO ] Deduced a trap composed of 214 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:53:37] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:53:37] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:57:11] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 224606 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:57:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:57:11] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 647334 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J30
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 48 places, 38 transitions, 140 arcs.
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P12)>=1)))
(potential((tk(P3)>=1) & (tk(P6)>=1) & (tk(P7)>=1)))
(potential((tk(P3)>=1) & (tk(P10)>=1) & (tk(P8)>=1)))
(potential((tk(P3)>=1) & (tk(P11)>=1) & (tk(P9)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P13)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P14)>=1)))
(potential((tk(P16)>=1) & (tk(P46)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P33)>=1) & (tk(P28)>=1)))
(potential((tk(P15)>=1) & (tk(P29)>=1)))
(potential((tk(P15)>=1) & (tk(P30)>=1)))
(potential((tk(P15)>=1) & (tk(P31)>=1)))
(potential((tk(P15)>=1) & (tk(P32)>=1)))
(potential((tk(P26)>=1) & (tk(P34)>=1) & (tk(P35)>=1) & (tk(P37)>=1)))
(potential((tk(P37)>=1) & (tk(P38)>=1) & (tk(P25)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P39)>=1) & (tk(P45)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P27)>=1) & (tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P41)>=1)))
FORMULA QuasiLiveness FALSE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678892233072

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

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="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S10J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;