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.r320-tall-167873970600442.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PolyORBNT-COL-S10J80, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-167873970600442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 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 95K 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 1678873642401

Running Version 202205111006
[2023-03-15 09:47:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:47:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:47:23] [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 09:47:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:47:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 619 ms
[2023-03-15 09:47:24] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 22 ms.
[2023-03-15 09:47:24] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 191 ms.
[2023-03-15 09:47:24] [INFO ] Unfolded 38 HLPN properties in 6 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:47:24] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 09:47:24] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 09:47:24] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 31 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1306 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-15 09:47:26] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 09:47:27] [INFO ] Computed 192 place invariants in 395 ms
[2023-03-15 09:47:31] [INFO ] [Real]Absence check using 185 positive place invariants in 79 ms returned sat
[2023-03-15 09:47:31] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2023-03-15 09:47:34] [INFO ] After 2100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:23
[2023-03-15 09:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:47:34] [INFO ] After 333ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-15 09:47:35] [INFO ] After 743ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:23
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-15 09:47:35] [INFO ] After 5547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-15 09:47:36] [INFO ] [Nat]Absence check using 185 positive place invariants in 82 ms returned sat
[2023-03-15 09:47:36] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 48 ms returned sat
[2023-03-15 09:48:00] [INFO ] After 23040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-15 09:48:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:48:00] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:23
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 1413 out of 1614 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1604 transition count 3388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 1602 transition count 3388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 1602 transition count 3387
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1601 transition count 3387
Applied a total of 16 rules in 280 ms. Remains 1601 /1614 variables (removed 13) and now considering 3387/3390 (removed 3) transitions.
[2023-03-15 09:48:01] [INFO ] Flow matrix only has 3378 transitions (discarded 9 similar events)
// Phase 1: matrix 3378 rows 1601 cols
[2023-03-15 09:48:01] [INFO ] Computed 182 place invariants in 127 ms
[2023-03-15 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 2694 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 SAFETY mode, iteration 1 : 1601/1614 places, 2772/3390 transitions.
Applied a total of 0 rules in 71 ms. Remains 1601 /1601 variables (removed 0) and now considering 2772/2772 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1601/1614 places, 2772/3390 transitions.
Incomplete random walk after 1000000 steps, including 66653 resets, run finished after 9027 ms. (steps per millisecond=110 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 1000001 steps, including 9230 resets, run finished after 2091 ms. (steps per millisecond=478 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:48:15] [INFO ] Flow matrix only has 2763 transitions (discarded 9 similar events)
// Phase 1: matrix 2763 rows 1601 cols
[2023-03-15 09:48:15] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-15 09:48:15] [INFO ] [Real]Absence check using 176 positive place invariants in 61 ms returned sat
[2023-03-15 09:48:15] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2023-03-15 09:48:15] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:48:15] [INFO ] [Nat]Absence check using 176 positive place invariants in 69 ms returned sat
[2023-03-15 09:48:15] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2023-03-15 09:48:17] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:48:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:48:17] [INFO ] After 414ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:48:18] [INFO ] Deduced a trap composed of 734 places in 1058 ms of which 3 ms to minimize.
[2023-03-15 09:48:19] [INFO ] Deduced a trap composed of 748 places in 903 ms of which 3 ms to minimize.
[2023-03-15 09:48:20] [INFO ] Deduced a trap composed of 752 places in 823 ms of which 2 ms to minimize.
[2023-03-15 09:48:21] [INFO ] Deduced a trap composed of 744 places in 889 ms of which 2 ms to minimize.
[2023-03-15 09:48:22] [INFO ] Deduced a trap composed of 742 places in 768 ms of which 2 ms to minimize.
[2023-03-15 09:48:23] [INFO ] Deduced a trap composed of 740 places in 750 ms of which 1 ms to minimize.
[2023-03-15 09:48:24] [INFO ] Deduced a trap composed of 754 places in 752 ms of which 1 ms to minimize.
[2023-03-15 09:48:25] [INFO ] Deduced a trap composed of 762 places in 762 ms of which 1 ms to minimize.
[2023-03-15 09:48:26] [INFO ] Deduced a trap composed of 748 places in 725 ms of which 1 ms to minimize.
[2023-03-15 09:48:27] [INFO ] Deduced a trap composed of 738 places in 766 ms of which 2 ms to minimize.
[2023-03-15 09:48:28] [INFO ] Deduced a trap composed of 748 places in 727 ms of which 1 ms to minimize.
[2023-03-15 09:48:29] [INFO ] Deduced a trap composed of 748 places in 749 ms of which 2 ms to minimize.
[2023-03-15 09:48:30] [INFO ] Deduced a trap composed of 742 places in 737 ms of which 2 ms to minimize.
[2023-03-15 09:48:31] [INFO ] Deduced a trap composed of 760 places in 820 ms of which 1 ms to minimize.
[2023-03-15 09:48:32] [INFO ] Deduced a trap composed of 750 places in 772 ms of which 1 ms to minimize.
[2023-03-15 09:48:33] [INFO ] Deduced a trap composed of 734 places in 763 ms of which 1 ms to minimize.
[2023-03-15 09:48:34] [INFO ] Deduced a trap composed of 752 places in 789 ms of which 1 ms to minimize.
[2023-03-15 09:48:35] [INFO ] Deduced a trap composed of 744 places in 749 ms of which 1 ms to minimize.
[2023-03-15 09:48:36] [INFO ] Deduced a trap composed of 746 places in 792 ms of which 2 ms to minimize.
[2023-03-15 09:48:37] [INFO ] Deduced a trap composed of 746 places in 725 ms of which 2 ms to minimize.
[2023-03-15 09:48:39] [INFO ] Deduced a trap composed of 746 places in 823 ms of which 1 ms to minimize.
[2023-03-15 09:48:40] [INFO ] Deduced a trap composed of 746 places in 788 ms of which 2 ms to minimize.
[2023-03-15 09:48:40] [INFO ] Deduced a trap composed of 752 places in 815 ms of which 2 ms to minimize.
[2023-03-15 09:48:42] [INFO ] Deduced a trap composed of 756 places in 783 ms of which 1 ms to minimize.
[2023-03-15 09:48:46] [INFO ] Deduced a trap composed of 732 places in 765 ms of which 1 ms to minimize.
[2023-03-15 09:48:47] [INFO ] Deduced a trap composed of 748 places in 820 ms of which 1 ms to minimize.
[2023-03-15 09:48:48] [INFO ] Deduced a trap composed of 740 places in 754 ms of which 1 ms to minimize.
[2023-03-15 09:48:49] [INFO ] Deduced a trap composed of 744 places in 706 ms of which 2 ms to minimize.
[2023-03-15 09:48:50] [INFO ] Deduced a trap composed of 760 places in 742 ms of which 1 ms to minimize.
[2023-03-15 09:48:51] [INFO ] Deduced a trap composed of 736 places in 736 ms of which 2 ms to minimize.
[2023-03-15 09:48:51] [INFO ] Deduced a trap composed of 744 places in 762 ms of which 1 ms to minimize.
[2023-03-15 09:49:01] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 43581 ms
[2023-03-15 09:49:01] [INFO ] After 44286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:49:01] [INFO ] After 45625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 1601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1601/1601 places, 2772/2772 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1601 transition count 2688
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1517 transition count 2688
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1517 transition count 2604
Deduced a syphon composed of 84 places in 9 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1432 transition count 2603
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1432 transition count 2603
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 342 place count 1430 transition count 2601
Applied a total of 342 rules in 745 ms. Remains 1430 /1601 variables (removed 171) and now considering 2601/2772 (removed 171) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1601 places, 2601/2772 transitions.
Incomplete random walk after 1000000 steps, including 72732 resets, run finished after 10906 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6387 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3001448 steps, run timeout after 36001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 3001448 steps, saw 497734 distinct states, run finished after 36003 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:49:51] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:49:51] [INFO ] Computed 182 place invariants in 54 ms
[2023-03-15 09:49:51] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 09:49:51] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 09:49:51] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:49:51] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 09:49:51] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 09:49:56] [INFO ] After 4815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:49:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:49:56] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:49:57] [INFO ] Deduced a trap composed of 574 places in 640 ms of which 1 ms to minimize.
[2023-03-15 09:49:57] [INFO ] Deduced a trap composed of 576 places in 606 ms of which 2 ms to minimize.
[2023-03-15 09:49:58] [INFO ] Deduced a trap composed of 568 places in 611 ms of which 5 ms to minimize.
[2023-03-15 09:49:59] [INFO ] Deduced a trap composed of 578 places in 630 ms of which 1 ms to minimize.
[2023-03-15 09:50:00] [INFO ] Deduced a trap composed of 588 places in 607 ms of which 1 ms to minimize.
[2023-03-15 09:50:00] [INFO ] Deduced a trap composed of 572 places in 597 ms of which 1 ms to minimize.
[2023-03-15 09:50:01] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:50:02] [INFO ] Deduced a trap composed of 570 places in 615 ms of which 1 ms to minimize.
[2023-03-15 09:50:02] [INFO ] Deduced a trap composed of 576 places in 594 ms of which 1 ms to minimize.
[2023-03-15 09:50:03] [INFO ] Deduced a trap composed of 568 places in 669 ms of which 1 ms to minimize.
[2023-03-15 09:50:04] [INFO ] Deduced a trap composed of 570 places in 635 ms of which 1 ms to minimize.
[2023-03-15 09:50:05] [INFO ] Deduced a trap composed of 588 places in 653 ms of which 1 ms to minimize.
[2023-03-15 09:50:06] [INFO ] Deduced a trap composed of 574 places in 601 ms of which 1 ms to minimize.
[2023-03-15 09:50:06] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 09:50:07] [INFO ] Deduced a trap composed of 564 places in 606 ms of which 1 ms to minimize.
[2023-03-15 09:50:08] [INFO ] Deduced a trap composed of 568 places in 642 ms of which 1 ms to minimize.
[2023-03-15 09:50:09] [INFO ] Deduced a trap composed of 578 places in 603 ms of which 2 ms to minimize.
[2023-03-15 09:50:10] [INFO ] Deduced a trap composed of 560 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:50:10] [INFO ] Deduced a trap composed of 580 places in 607 ms of which 1 ms to minimize.
[2023-03-15 09:50:11] [INFO ] Deduced a trap composed of 570 places in 644 ms of which 2 ms to minimize.
[2023-03-15 09:50:12] [INFO ] Deduced a trap composed of 564 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:50:13] [INFO ] Deduced a trap composed of 572 places in 616 ms of which 1 ms to minimize.
[2023-03-15 09:50:15] [INFO ] Deduced a trap composed of 574 places in 616 ms of which 1 ms to minimize.
[2023-03-15 09:50:16] [INFO ] Deduced a trap composed of 572 places in 627 ms of which 8 ms to minimize.
[2023-03-15 09:50:17] [INFO ] Deduced a trap composed of 570 places in 623 ms of which 1 ms to minimize.
[2023-03-15 09:50:17] [INFO ] Deduced a trap composed of 562 places in 642 ms of which 1 ms to minimize.
[2023-03-15 09:50:18] [INFO ] Deduced a trap composed of 574 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:50:20] [INFO ] Deduced a trap composed of 566 places in 619 ms of which 1 ms to minimize.
[2023-03-15 09:50:24] [INFO ] Deduced a trap composed of 574 places in 625 ms of which 1 ms to minimize.
[2023-03-15 09:50:26] [INFO ] Deduced a trap composed of 584 places in 600 ms of which 1 ms to minimize.
[2023-03-15 09:50:27] [INFO ] Deduced a trap composed of 574 places in 648 ms of which 1 ms to minimize.
[2023-03-15 09:50:28] [INFO ] Deduced a trap composed of 564 places in 656 ms of which 2 ms to minimize.
[2023-03-15 09:50:29] [INFO ] Deduced a trap composed of 584 places in 612 ms of which 1 ms to minimize.
[2023-03-15 09:50:29] [INFO ] Deduced a trap composed of 564 places in 631 ms of which 4 ms to minimize.
[2023-03-15 09:50:30] [INFO ] Deduced a trap composed of 574 places in 621 ms of which 2 ms to minimize.
[2023-03-15 09:50:31] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 8 ms to minimize.
[2023-03-15 09:50:32] [INFO ] Deduced a trap composed of 580 places in 599 ms of which 1 ms to minimize.
[2023-03-15 09:50:33] [INFO ] Deduced a trap composed of 570 places in 609 ms of which 1 ms to minimize.
[2023-03-15 09:50:41] [INFO ] Deduced a trap composed of 570 places in 662 ms of which 1 ms to minimize.
[2023-03-15 09:50:45] [INFO ] Deduced a trap composed of 570 places in 637 ms of which 2 ms to minimize.
[2023-03-15 09:50:46] [INFO ] Deduced a trap composed of 568 places in 638 ms of which 1 ms to minimize.
[2023-03-15 09:50:52] [INFO ] Deduced a trap composed of 562 places in 650 ms of which 1 ms to minimize.
[2023-03-15 09:50:57] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 1 ms to minimize.
[2023-03-15 09:51:06] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 70193 ms
[2023-03-15 09:51:07] [INFO ] After 71154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:51:07] [INFO ] After 76226ms 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 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 76 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 75 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 09:51:07] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:51:07] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-15 09:51:09] [INFO ] Implicit Places using invariants in 1459 ms returned []
[2023-03-15 09:51:09] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:51:09] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 09:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:51:18] [INFO ] Implicit Places using invariants and state equation in 9198 ms returned []
Implicit Place search using SMT with State Equation took 10660 ms to find 0 implicit places.
[2023-03-15 09:51:18] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-15 09:51:18] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:51:18] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-15 09:51:20] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7255 resets, run finished after 1251 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:51:21] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:51:21] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-15 09:51:21] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-15 09:51:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 09:51:21] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:51:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-15 09:51:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 09:51:26] [INFO ] After 4778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:51:26] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:51:27] [INFO ] Deduced a trap composed of 574 places in 655 ms of which 2 ms to minimize.
[2023-03-15 09:51:28] [INFO ] Deduced a trap composed of 576 places in 656 ms of which 1 ms to minimize.
[2023-03-15 09:51:29] [INFO ] Deduced a trap composed of 568 places in 646 ms of which 1 ms to minimize.
[2023-03-15 09:51:29] [INFO ] Deduced a trap composed of 578 places in 631 ms of which 2 ms to minimize.
[2023-03-15 09:51:30] [INFO ] Deduced a trap composed of 588 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:51:31] [INFO ] Deduced a trap composed of 572 places in 622 ms of which 1 ms to minimize.
[2023-03-15 09:51:32] [INFO ] Deduced a trap composed of 568 places in 647 ms of which 2 ms to minimize.
[2023-03-15 09:51:32] [INFO ] Deduced a trap composed of 570 places in 632 ms of which 2 ms to minimize.
[2023-03-15 09:51:33] [INFO ] Deduced a trap composed of 576 places in 652 ms of which 2 ms to minimize.
[2023-03-15 09:51:34] [INFO ] Deduced a trap composed of 568 places in 637 ms of which 1 ms to minimize.
[2023-03-15 09:51:35] [INFO ] Deduced a trap composed of 570 places in 619 ms of which 1 ms to minimize.
[2023-03-15 09:51:35] [INFO ] Deduced a trap composed of 588 places in 612 ms of which 2 ms to minimize.
[2023-03-15 09:51:36] [INFO ] Deduced a trap composed of 574 places in 645 ms of which 1 ms to minimize.
[2023-03-15 09:51:37] [INFO ] Deduced a trap composed of 570 places in 640 ms of which 2 ms to minimize.
[2023-03-15 09:51:38] [INFO ] Deduced a trap composed of 564 places in 651 ms of which 2 ms to minimize.
[2023-03-15 09:51:39] [INFO ] Deduced a trap composed of 568 places in 644 ms of which 1 ms to minimize.
[2023-03-15 09:51:40] [INFO ] Deduced a trap composed of 578 places in 620 ms of which 2 ms to minimize.
[2023-03-15 09:51:40] [INFO ] Deduced a trap composed of 560 places in 596 ms of which 1 ms to minimize.
[2023-03-15 09:51:41] [INFO ] Deduced a trap composed of 580 places in 644 ms of which 1 ms to minimize.
[2023-03-15 09:51:42] [INFO ] Deduced a trap composed of 570 places in 610 ms of which 1 ms to minimize.
[2023-03-15 09:51:43] [INFO ] Deduced a trap composed of 564 places in 602 ms of which 1 ms to minimize.
[2023-03-15 09:51:44] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 2 ms to minimize.
[2023-03-15 09:51:46] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 1 ms to minimize.
[2023-03-15 09:51:47] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:51:47] [INFO ] Deduced a trap composed of 570 places in 606 ms of which 1 ms to minimize.
[2023-03-15 09:51:48] [INFO ] Deduced a trap composed of 562 places in 602 ms of which 1 ms to minimize.
[2023-03-15 09:51:49] [INFO ] Deduced a trap composed of 574 places in 606 ms of which 1 ms to minimize.
[2023-03-15 09:51:50] [INFO ] Deduced a trap composed of 566 places in 652 ms of which 1 ms to minimize.
[2023-03-15 09:51:55] [INFO ] Deduced a trap composed of 574 places in 625 ms of which 2 ms to minimize.
[2023-03-15 09:51:57] [INFO ] Deduced a trap composed of 584 places in 661 ms of which 2 ms to minimize.
[2023-03-15 09:51:58] [INFO ] Deduced a trap composed of 574 places in 658 ms of which 2 ms to minimize.
[2023-03-15 09:51:59] [INFO ] Deduced a trap composed of 564 places in 664 ms of which 2 ms to minimize.
[2023-03-15 09:52:00] [INFO ] Deduced a trap composed of 584 places in 665 ms of which 1 ms to minimize.
[2023-03-15 09:52:00] [INFO ] Deduced a trap composed of 564 places in 654 ms of which 1 ms to minimize.
[2023-03-15 09:52:01] [INFO ] Deduced a trap composed of 574 places in 635 ms of which 1 ms to minimize.
[2023-03-15 09:52:02] [INFO ] Deduced a trap composed of 570 places in 644 ms of which 1 ms to minimize.
[2023-03-15 09:52:04] [INFO ] Deduced a trap composed of 580 places in 641 ms of which 1 ms to minimize.
[2023-03-15 09:52:04] [INFO ] Deduced a trap composed of 570 places in 643 ms of which 1 ms to minimize.
[2023-03-15 09:52:13] [INFO ] Deduced a trap composed of 570 places in 641 ms of which 2 ms to minimize.
[2023-03-15 09:52:16] [INFO ] Deduced a trap composed of 570 places in 661 ms of which 1 ms to minimize.
[2023-03-15 09:52:17] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:52:23] [INFO ] Deduced a trap composed of 562 places in 636 ms of which 1 ms to minimize.
[2023-03-15 09:52:29] [INFO ] Deduced a trap composed of 566 places in 629 ms of which 1 ms to minimize.
[2023-03-15 09:52:38] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 71300 ms
[2023-03-15 09:52:38] [INFO ] After 72081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:52:38] [INFO ] After 77142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72673 resets, run finished after 11302 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6543 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3250286 steps, run timeout after 39001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 3250286 steps, saw 540030 distinct states, run finished after 39003 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:53:31] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:53:31] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 09:53:31] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 09:53:31] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 09:53:31] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:53:31] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 09:53:31] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 09:53:36] [INFO ] After 4950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:53:36] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:37] [INFO ] Deduced a trap composed of 574 places in 623 ms of which 1 ms to minimize.
[2023-03-15 09:53:38] [INFO ] Deduced a trap composed of 576 places in 622 ms of which 2 ms to minimize.
[2023-03-15 09:53:39] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:53:39] [INFO ] Deduced a trap composed of 578 places in 619 ms of which 1 ms to minimize.
[2023-03-15 09:53:40] [INFO ] Deduced a trap composed of 588 places in 606 ms of which 2 ms to minimize.
[2023-03-15 09:53:41] [INFO ] Deduced a trap composed of 572 places in 602 ms of which 2 ms to minimize.
[2023-03-15 09:53:41] [INFO ] Deduced a trap composed of 568 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:53:42] [INFO ] Deduced a trap composed of 570 places in 651 ms of which 1 ms to minimize.
[2023-03-15 09:53:43] [INFO ] Deduced a trap composed of 576 places in 657 ms of which 2 ms to minimize.
[2023-03-15 09:53:44] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:53:45] [INFO ] Deduced a trap composed of 570 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:53:45] [INFO ] Deduced a trap composed of 588 places in 607 ms of which 2 ms to minimize.
[2023-03-15 09:53:46] [INFO ] Deduced a trap composed of 574 places in 638 ms of which 2 ms to minimize.
[2023-03-15 09:53:47] [INFO ] Deduced a trap composed of 570 places in 649 ms of which 1 ms to minimize.
[2023-03-15 09:53:48] [INFO ] Deduced a trap composed of 564 places in 628 ms of which 1 ms to minimize.
[2023-03-15 09:53:49] [INFO ] Deduced a trap composed of 568 places in 632 ms of which 1 ms to minimize.
[2023-03-15 09:53:49] [INFO ] Deduced a trap composed of 578 places in 615 ms of which 1 ms to minimize.
[2023-03-15 09:53:50] [INFO ] Deduced a trap composed of 560 places in 608 ms of which 1 ms to minimize.
[2023-03-15 09:53:51] [INFO ] Deduced a trap composed of 580 places in 604 ms of which 1 ms to minimize.
[2023-03-15 09:53:52] [INFO ] Deduced a trap composed of 570 places in 588 ms of which 1 ms to minimize.
[2023-03-15 09:53:52] [INFO ] Deduced a trap composed of 564 places in 608 ms of which 1 ms to minimize.
[2023-03-15 09:53:53] [INFO ] Deduced a trap composed of 572 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:53:55] [INFO ] Deduced a trap composed of 574 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:53:56] [INFO ] Deduced a trap composed of 572 places in 628 ms of which 1 ms to minimize.
[2023-03-15 09:53:57] [INFO ] Deduced a trap composed of 570 places in 655 ms of which 1 ms to minimize.
[2023-03-15 09:53:58] [INFO ] Deduced a trap composed of 562 places in 624 ms of which 2 ms to minimize.
[2023-03-15 09:53:59] [INFO ] Deduced a trap composed of 574 places in 653 ms of which 2 ms to minimize.
[2023-03-15 09:54:00] [INFO ] Deduced a trap composed of 566 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:54:04] [INFO ] Deduced a trap composed of 574 places in 612 ms of which 1 ms to minimize.
[2023-03-15 09:54:07] [INFO ] Deduced a trap composed of 584 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:54:08] [INFO ] Deduced a trap composed of 574 places in 600 ms of which 1 ms to minimize.
[2023-03-15 09:54:08] [INFO ] Deduced a trap composed of 564 places in 599 ms of which 1 ms to minimize.
[2023-03-15 09:54:09] [INFO ] Deduced a trap composed of 584 places in 610 ms of which 1 ms to minimize.
[2023-03-15 09:54:10] [INFO ] Deduced a trap composed of 564 places in 609 ms of which 1 ms to minimize.
[2023-03-15 09:54:11] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:54:12] [INFO ] Deduced a trap composed of 570 places in 597 ms of which 1 ms to minimize.
[2023-03-15 09:54:13] [INFO ] Deduced a trap composed of 580 places in 674 ms of which 1 ms to minimize.
[2023-03-15 09:54:14] [INFO ] Deduced a trap composed of 570 places in 639 ms of which 1 ms to minimize.
[2023-03-15 09:54:22] [INFO ] Deduced a trap composed of 570 places in 621 ms of which 1 ms to minimize.
[2023-03-15 09:54:26] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 2 ms to minimize.
[2023-03-15 09:54:27] [INFO ] Deduced a trap composed of 568 places in 608 ms of which 1 ms to minimize.
[2023-03-15 09:54:33] [INFO ] Deduced a trap composed of 562 places in 639 ms of which 1 ms to minimize.
[2023-03-15 09:54:38] [INFO ] Deduced a trap composed of 566 places in 643 ms of which 2 ms to minimize.
[2023-03-15 09:54:47] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 70886 ms
[2023-03-15 09:54:48] [INFO ] After 71646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:54:48] [INFO ] After 76862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 70 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 71 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 09:54:48] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:54:48] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 09:54:50] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2023-03-15 09:54:50] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:54:50] [INFO ] Computed 182 place invariants in 54 ms
[2023-03-15 09:54:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:55:01] [INFO ] Implicit Places using invariants and state equation in 11117 ms returned []
Implicit Place search using SMT with State Equation took 12557 ms to find 0 implicit places.
[2023-03-15 09:55:01] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-15 09:55:01] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:55:01] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-15 09:55:02] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7304 resets, run finished after 1157 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:55:03] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:55:04] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-15 09:55:04] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 09:55:04] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 09:55:04] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:55:04] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 09:55:04] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 09:55:09] [INFO ] After 4815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:55:09] [INFO ] After 132ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:55:10] [INFO ] Deduced a trap composed of 574 places in 598 ms of which 1 ms to minimize.
[2023-03-15 09:55:10] [INFO ] Deduced a trap composed of 576 places in 626 ms of which 1 ms to minimize.
[2023-03-15 09:55:11] [INFO ] Deduced a trap composed of 568 places in 633 ms of which 2 ms to minimize.
[2023-03-15 09:55:12] [INFO ] Deduced a trap composed of 578 places in 616 ms of which 2 ms to minimize.
[2023-03-15 09:55:13] [INFO ] Deduced a trap composed of 588 places in 629 ms of which 1 ms to minimize.
[2023-03-15 09:55:13] [INFO ] Deduced a trap composed of 572 places in 618 ms of which 2 ms to minimize.
[2023-03-15 09:55:14] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:55:15] [INFO ] Deduced a trap composed of 570 places in 608 ms of which 1 ms to minimize.
[2023-03-15 09:55:15] [INFO ] Deduced a trap composed of 576 places in 615 ms of which 1 ms to minimize.
[2023-03-15 09:55:16] [INFO ] Deduced a trap composed of 568 places in 607 ms of which 1 ms to minimize.
[2023-03-15 09:55:17] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 1 ms to minimize.
[2023-03-15 09:55:18] [INFO ] Deduced a trap composed of 588 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:55:18] [INFO ] Deduced a trap composed of 574 places in 613 ms of which 2 ms to minimize.
[2023-03-15 09:55:19] [INFO ] Deduced a trap composed of 570 places in 612 ms of which 1 ms to minimize.
[2023-03-15 09:55:20] [INFO ] Deduced a trap composed of 564 places in 680 ms of which 1 ms to minimize.
[2023-03-15 09:55:21] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 1 ms to minimize.
[2023-03-15 09:55:22] [INFO ] Deduced a trap composed of 578 places in 626 ms of which 1 ms to minimize.
[2023-03-15 09:55:23] [INFO ] Deduced a trap composed of 560 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:55:23] [INFO ] Deduced a trap composed of 580 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:55:24] [INFO ] Deduced a trap composed of 570 places in 665 ms of which 1 ms to minimize.
[2023-03-15 09:55:25] [INFO ] Deduced a trap composed of 564 places in 642 ms of which 2 ms to minimize.
[2023-03-15 09:55:26] [INFO ] Deduced a trap composed of 572 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:55:28] [INFO ] Deduced a trap composed of 574 places in 620 ms of which 1 ms to minimize.
[2023-03-15 09:55:29] [INFO ] Deduced a trap composed of 572 places in 595 ms of which 1 ms to minimize.
[2023-03-15 09:55:29] [INFO ] Deduced a trap composed of 570 places in 640 ms of which 1 ms to minimize.
[2023-03-15 09:55:30] [INFO ] Deduced a trap composed of 562 places in 629 ms of which 2 ms to minimize.
[2023-03-15 09:55:31] [INFO ] Deduced a trap composed of 574 places in 627 ms of which 1 ms to minimize.
[2023-03-15 09:55:32] [INFO ] Deduced a trap composed of 566 places in 626 ms of which 1 ms to minimize.
[2023-03-15 09:55:37] [INFO ] Deduced a trap composed of 574 places in 641 ms of which 1 ms to minimize.
[2023-03-15 09:55:39] [INFO ] Deduced a trap composed of 584 places in 627 ms of which 1 ms to minimize.
[2023-03-15 09:55:40] [INFO ] Deduced a trap composed of 574 places in 635 ms of which 2 ms to minimize.
[2023-03-15 09:55:41] [INFO ] Deduced a trap composed of 564 places in 585 ms of which 1 ms to minimize.
[2023-03-15 09:55:42] [INFO ] Deduced a trap composed of 584 places in 636 ms of which 2 ms to minimize.
[2023-03-15 09:55:42] [INFO ] Deduced a trap composed of 564 places in 592 ms of which 1 ms to minimize.
[2023-03-15 09:55:43] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:55:44] [INFO ] Deduced a trap composed of 570 places in 623 ms of which 1 ms to minimize.
[2023-03-15 09:55:45] [INFO ] Deduced a trap composed of 580 places in 645 ms of which 2 ms to minimize.
[2023-03-15 09:55:46] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 2 ms to minimize.
[2023-03-15 09:55:54] [INFO ] Deduced a trap composed of 570 places in 641 ms of which 1 ms to minimize.
[2023-03-15 09:55:58] [INFO ] Deduced a trap composed of 570 places in 612 ms of which 1 ms to minimize.
[2023-03-15 09:55:59] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2023-03-15 09:56:05] [INFO ] Deduced a trap composed of 562 places in 615 ms of which 2 ms to minimize.
[2023-03-15 09:56:11] [INFO ] Deduced a trap composed of 566 places in 619 ms of which 1 ms to minimize.
[2023-03-15 09:56:20] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 70619 ms
[2023-03-15 09:56:20] [INFO ] After 71539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:56:20] [INFO ] After 76622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 725 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250172 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250172 steps, saw 41519 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:56:24] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:56:24] [INFO ] Computed 182 place invariants in 51 ms
[2023-03-15 09:56:24] [INFO ] [Real]Absence check using 175 positive place invariants in 59 ms returned sat
[2023-03-15 09:56:24] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 09:56:24] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:56:24] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 09:56:24] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 09:56:29] [INFO ] After 4821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:56:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:56:29] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:56:30] [INFO ] Deduced a trap composed of 574 places in 636 ms of which 1 ms to minimize.
[2023-03-15 09:56:31] [INFO ] Deduced a trap composed of 566 places in 629 ms of which 1 ms to minimize.
[2023-03-15 09:56:31] [INFO ] Deduced a trap composed of 568 places in 610 ms of which 1 ms to minimize.
[2023-03-15 09:56:32] [INFO ] Deduced a trap composed of 578 places in 640 ms of which 1 ms to minimize.
[2023-03-15 09:56:33] [INFO ] Deduced a trap composed of 570 places in 639 ms of which 1 ms to minimize.
[2023-03-15 09:56:34] [INFO ] Deduced a trap composed of 572 places in 638 ms of which 1 ms to minimize.
[2023-03-15 09:56:35] [INFO ] Deduced a trap composed of 574 places in 649 ms of which 1 ms to minimize.
[2023-03-15 09:56:35] [INFO ] Deduced a trap composed of 580 places in 655 ms of which 2 ms to minimize.
[2023-03-15 09:56:36] [INFO ] Deduced a trap composed of 582 places in 647 ms of which 1 ms to minimize.
[2023-03-15 09:56:37] [INFO ] Deduced a trap composed of 588 places in 650 ms of which 1 ms to minimize.
[2023-03-15 09:56:38] [INFO ] Deduced a trap composed of 568 places in 646 ms of which 1 ms to minimize.
[2023-03-15 09:56:39] [INFO ] Deduced a trap composed of 558 places in 635 ms of which 1 ms to minimize.
[2023-03-15 09:56:40] [INFO ] Deduced a trap composed of 568 places in 647 ms of which 1 ms to minimize.
[2023-03-15 09:56:40] [INFO ] Deduced a trap composed of 582 places in 647 ms of which 1 ms to minimize.
[2023-03-15 09:56:42] [INFO ] Deduced a trap composed of 562 places in 639 ms of which 2 ms to minimize.
[2023-03-15 09:56:43] [INFO ] Deduced a trap composed of 560 places in 634 ms of which 1 ms to minimize.
[2023-03-15 09:56:43] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 1 ms to minimize.
[2023-03-15 09:56:44] [INFO ] Deduced a trap composed of 570 places in 632 ms of which 1 ms to minimize.
[2023-03-15 09:56:45] [INFO ] Deduced a trap composed of 572 places in 643 ms of which 1 ms to minimize.
[2023-03-15 09:56:46] [INFO ] Deduced a trap composed of 582 places in 633 ms of which 1 ms to minimize.
[2023-03-15 09:56:46] [INFO ] Deduced a trap composed of 572 places in 632 ms of which 2 ms to minimize.
[2023-03-15 09:56:47] [INFO ] Deduced a trap composed of 586 places in 645 ms of which 1 ms to minimize.
[2023-03-15 09:56:48] [INFO ] Deduced a trap composed of 570 places in 611 ms of which 1 ms to minimize.
[2023-03-15 09:56:48] [INFO ] Deduced a trap composed of 576 places in 639 ms of which 2 ms to minimize.
[2023-03-15 09:56:49] [INFO ] Deduced a trap composed of 584 places in 612 ms of which 1 ms to minimize.
[2023-03-15 09:56:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:56:49] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 73 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 09:56:49] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:56:49] [INFO ] Computed 182 place invariants in 54 ms
[2023-03-15 09:56:51] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 732 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250707 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250707 steps, saw 41587 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:56:54] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:56:54] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-15 09:56:54] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 09:56:54] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 09:56:54] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:56:54] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 09:56:55] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 09:57:00] [INFO ] After 4952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:57:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:57:00] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:57:00] [INFO ] Deduced a trap composed of 574 places in 648 ms of which 1 ms to minimize.
[2023-03-15 09:57:01] [INFO ] Deduced a trap composed of 566 places in 616 ms of which 1 ms to minimize.
[2023-03-15 09:57:02] [INFO ] Deduced a trap composed of 568 places in 608 ms of which 3 ms to minimize.
[2023-03-15 09:57:02] [INFO ] Deduced a trap composed of 578 places in 625 ms of which 2 ms to minimize.
[2023-03-15 09:57:03] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 2 ms to minimize.
[2023-03-15 09:57:04] [INFO ] Deduced a trap composed of 572 places in 632 ms of which 1 ms to minimize.
[2023-03-15 09:57:05] [INFO ] Deduced a trap composed of 574 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:57:06] [INFO ] Deduced a trap composed of 580 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:57:06] [INFO ] Deduced a trap composed of 582 places in 646 ms of which 2 ms to minimize.
[2023-03-15 09:57:07] [INFO ] Deduced a trap composed of 588 places in 640 ms of which 1 ms to minimize.
[2023-03-15 09:57:08] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:57:09] [INFO ] Deduced a trap composed of 558 places in 627 ms of which 1 ms to minimize.
[2023-03-15 09:57:10] [INFO ] Deduced a trap composed of 568 places in 627 ms of which 1 ms to minimize.
[2023-03-15 09:57:11] [INFO ] Deduced a trap composed of 582 places in 631 ms of which 1 ms to minimize.
[2023-03-15 09:57:12] [INFO ] Deduced a trap composed of 562 places in 623 ms of which 1 ms to minimize.
[2023-03-15 09:57:13] [INFO ] Deduced a trap composed of 560 places in 621 ms of which 1 ms to minimize.
[2023-03-15 09:57:13] [INFO ] Deduced a trap composed of 570 places in 650 ms of which 1 ms to minimize.
[2023-03-15 09:57:14] [INFO ] Deduced a trap composed of 570 places in 622 ms of which 1 ms to minimize.
[2023-03-15 09:57:15] [INFO ] Deduced a trap composed of 572 places in 618 ms of which 2 ms to minimize.
[2023-03-15 09:57:16] [INFO ] Deduced a trap composed of 582 places in 636 ms of which 2 ms to minimize.
[2023-03-15 09:57:16] [INFO ] Deduced a trap composed of 572 places in 660 ms of which 1 ms to minimize.
[2023-03-15 09:57:17] [INFO ] Deduced a trap composed of 586 places in 650 ms of which 1 ms to minimize.
[2023-03-15 09:57:18] [INFO ] Deduced a trap composed of 570 places in 648 ms of which 1 ms to minimize.
[2023-03-15 09:57:19] [INFO ] Deduced a trap composed of 576 places in 661 ms of which 1 ms to minimize.
[2023-03-15 09:57:20] [INFO ] Deduced a trap composed of 584 places in 689 ms of which 1 ms to minimize.
[2023-03-15 09:57:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:57:20] [INFO ] After 25290ms 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 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 72 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 69 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 09:57:20] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:57:20] [INFO ] Computed 182 place invariants in 59 ms
[2023-03-15 09:57:21] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2023-03-15 09:57:21] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:57:21] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-15 09:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:57:31] [INFO ] Implicit Places using invariants and state equation in 9826 ms returned []
Implicit Place search using SMT with State Equation took 11307 ms to find 0 implicit places.
[2023-03-15 09:57:31] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-15 09:57:31] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 09:57:31] [INFO ] Computed 182 place invariants in 57 ms
[2023-03-15 09:57:33] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 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 1430 transition count 2592
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 1430 transition count 2591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 315 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2580 rows 1418 cols
[2023-03-15 09:57:33] [INFO ] Computed 182 place invariants in 51 ms
[2023-03-15 09:57:33] [INFO ] [Real]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 09:57:33] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 09:57:33] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:57:34] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 09:57:34] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-15 09:57:34] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:57:35] [INFO ] Deduced a trap composed of 566 places in 591 ms of which 1 ms to minimize.
[2023-03-15 09:57:36] [INFO ] Deduced a trap composed of 576 places in 585 ms of which 4 ms to minimize.
[2023-03-15 09:57:36] [INFO ] Deduced a trap composed of 566 places in 584 ms of which 1 ms to minimize.
[2023-03-15 09:57:37] [INFO ] Deduced a trap composed of 572 places in 583 ms of which 1 ms to minimize.
[2023-03-15 09:57:38] [INFO ] Deduced a trap composed of 566 places in 621 ms of which 1 ms to minimize.
[2023-03-15 09:57:38] [INFO ] Deduced a trap composed of 560 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:57:39] [INFO ] Deduced a trap composed of 572 places in 566 ms of which 1 ms to minimize.
[2023-03-15 09:57:40] [INFO ] Deduced a trap composed of 574 places in 568 ms of which 1 ms to minimize.
[2023-03-15 09:57:41] [INFO ] Deduced a trap composed of 564 places in 603 ms of which 2 ms to minimize.
[2023-03-15 09:57:41] [INFO ] Deduced a trap composed of 566 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:57:42] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 1 ms to minimize.
[2023-03-15 09:57:43] [INFO ] Deduced a trap composed of 586 places in 648 ms of which 1 ms to minimize.
[2023-03-15 09:57:44] [INFO ] Deduced a trap composed of 572 places in 649 ms of which 1 ms to minimize.
[2023-03-15 09:57:44] [INFO ] Deduced a trap composed of 576 places in 613 ms of which 2 ms to minimize.
[2023-03-15 09:57:45] [INFO ] Deduced a trap composed of 568 places in 634 ms of which 1 ms to minimize.
[2023-03-15 09:57:46] [INFO ] Deduced a trap composed of 558 places in 667 ms of which 1 ms to minimize.
[2023-03-15 09:57:47] [INFO ] Deduced a trap composed of 560 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:57:47] [INFO ] Deduced a trap composed of 558 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:57:48] [INFO ] Deduced a trap composed of 556 places in 609 ms of which 1 ms to minimize.
[2023-03-15 09:57:50] [INFO ] Deduced a trap composed of 564 places in 589 ms of which 1 ms to minimize.
[2023-03-15 09:57:51] [INFO ] Deduced a trap composed of 582 places in 574 ms of which 1 ms to minimize.
[2023-03-15 09:57:51] [INFO ] Deduced a trap composed of 568 places in 588 ms of which 1 ms to minimize.
[2023-03-15 09:57:52] [INFO ] Deduced a trap composed of 580 places in 565 ms of which 1 ms to minimize.
[2023-03-15 09:57:53] [INFO ] Deduced a trap composed of 576 places in 565 ms of which 1 ms to minimize.
[2023-03-15 09:57:54] [INFO ] Deduced a trap composed of 556 places in 591 ms of which 1 ms to minimize.
[2023-03-15 09:57:54] [INFO ] Deduced a trap composed of 558 places in 592 ms of which 1 ms to minimize.
[2023-03-15 09:57:55] [INFO ] Deduced a trap composed of 568 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:57:56] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 1 ms to minimize.
[2023-03-15 09:57:56] [INFO ] Deduced a trap composed of 574 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:57:57] [INFO ] Deduced a trap composed of 562 places in 621 ms of which 1 ms to minimize.
[2023-03-15 09:57:58] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 1 ms to minimize.
[2023-03-15 09:57:59] [INFO ] Deduced a trap composed of 574 places in 611 ms of which 1 ms to minimize.
[2023-03-15 09:57:59] [INFO ] Deduced a trap composed of 572 places in 611 ms of which 2 ms to minimize.
[2023-03-15 09:58:00] [INFO ] Deduced a trap composed of 574 places in 602 ms of which 1 ms to minimize.
[2023-03-15 09:58:01] [INFO ] Deduced a trap composed of 558 places in 565 ms of which 1 ms to minimize.
[2023-03-15 09:58:02] [INFO ] Deduced a trap composed of 568 places in 562 ms of which 1 ms to minimize.
[2023-03-15 09:58:02] [INFO ] Deduced a trap composed of 564 places in 566 ms of which 1 ms to minimize.
[2023-03-15 09:58:03] [INFO ] Deduced a trap composed of 564 places in 563 ms of which 1 ms to minimize.
[2023-03-15 09:58:03] [INFO ] Deduced a trap composed of 570 places in 573 ms of which 1 ms to minimize.
[2023-03-15 09:58:04] [INFO ] Deduced a trap composed of 570 places in 615 ms of which 1 ms to minimize.
[2023-03-15 09:58:05] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:58:06] [INFO ] Deduced a trap composed of 562 places in 575 ms of which 1 ms to minimize.
[2023-03-15 09:58:06] [INFO ] Deduced a trap composed of 570 places in 563 ms of which 1 ms to minimize.
[2023-03-15 09:58:07] [INFO ] Deduced a trap composed of 566 places in 606 ms of which 2 ms to minimize.
[2023-03-15 09:58:08] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:58:09] [INFO ] Deduced a trap composed of 590 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:58:09] [INFO ] Deduced a trap composed of 584 places in 590 ms of which 1 ms to minimize.
[2023-03-15 09:58:10] [INFO ] Deduced a trap composed of 582 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:58:11] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:58:19] [INFO ] Deduced a trap composed of 576 places in 589 ms of which 1 ms to minimize.
[2023-03-15 09:58:20] [INFO ] Deduced a trap composed of 568 places in 583 ms of which 1 ms to minimize.
[2023-03-15 09:58:24] [INFO ] Deduced a trap composed of 554 places in 567 ms of which 1 ms to minimize.
[2023-03-15 09:58:24] [INFO ] Deduced a trap composed of 574 places in 591 ms of which 1 ms to minimize.
[2023-03-15 09:58:25] [INFO ] Deduced a trap composed of 574 places in 567 ms of which 1 ms to minimize.
[2023-03-15 09:58:26] [INFO ] Deduced a trap composed of 574 places in 631 ms of which 1 ms to minimize.
[2023-03-15 09:58:27] [INFO ] Deduced a trap composed of 582 places in 587 ms of which 1 ms to minimize.
[2023-03-15 09:58:27] [INFO ] Deduced a trap composed of 574 places in 595 ms of which 1 ms to minimize.
[2023-03-15 09:58:28] [INFO ] Deduced a trap composed of 560 places in 655 ms of which 1 ms to minimize.
[2023-03-15 09:58:29] [INFO ] Deduced a trap composed of 574 places in 625 ms of which 1 ms to minimize.
[2023-03-15 09:58:30] [INFO ] Deduced a trap composed of 586 places in 630 ms of which 1 ms to minimize.
[2023-03-15 09:58:30] [INFO ] Deduced a trap composed of 562 places in 624 ms of which 1 ms to minimize.
[2023-03-15 09:58:31] [INFO ] Deduced a trap composed of 556 places in 634 ms of which 1 ms to minimize.
[2023-03-15 09:58:32] [INFO ] Deduced a trap composed of 560 places in 626 ms of which 1 ms to minimize.
[2023-03-15 09:58:33] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 1 ms to minimize.
[2023-03-15 09:58:33] [INFO ] Deduced a trap composed of 568 places in 646 ms of which 1 ms to minimize.
[2023-03-15 09:58:34] [INFO ] Deduced a trap composed of 568 places in 645 ms of which 1 ms to minimize.
[2023-03-15 09:58:35] [INFO ] Deduced a trap composed of 566 places in 630 ms of which 1 ms to minimize.
[2023-03-15 09:58:35] [INFO ] Deduced a trap composed of 564 places in 641 ms of which 2 ms to minimize.
[2023-03-15 09:58:36] [INFO ] Deduced a trap composed of 566 places in 641 ms of which 1 ms to minimize.
[2023-03-15 09:58:37] [INFO ] Deduced a trap composed of 562 places in 629 ms of which 1 ms to minimize.
[2023-03-15 09:58:38] [INFO ] Deduced a trap composed of 568 places in 647 ms of which 1 ms to minimize.
[2023-03-15 09:58:38] [INFO ] Deduced a trap composed of 558 places in 658 ms of which 1 ms to minimize.
[2023-03-15 09:58:39] [INFO ] Deduced a trap composed of 554 places in 639 ms of which 1 ms to minimize.
[2023-03-15 09:58:40] [INFO ] Deduced a trap composed of 572 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:58:40] [INFO ] Deduced a trap composed of 576 places in 627 ms of which 1 ms to minimize.
[2023-03-15 09:58:41] [INFO ] Deduced a trap composed of 570 places in 652 ms of which 2 ms to minimize.
[2023-03-15 09:58:42] [INFO ] Deduced a trap composed of 558 places in 616 ms of which 1 ms to minimize.
[2023-03-15 09:58:44] [INFO ] Deduced a trap composed of 572 places in 631 ms of which 1 ms to minimize.
[2023-03-15 09:58:45] [INFO ] Deduced a trap composed of 576 places in 623 ms of which 1 ms to minimize.
[2023-03-15 09:58:46] [INFO ] Deduced a trap composed of 572 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:58:46] [INFO ] Deduced a trap composed of 566 places in 589 ms of which 1 ms to minimize.
[2023-03-15 09:58:47] [INFO ] Deduced a trap composed of 568 places in 578 ms of which 1 ms to minimize.
[2023-03-15 09:58:48] [INFO ] Deduced a trap composed of 560 places in 601 ms of which 1 ms to minimize.
[2023-03-15 09:58:48] [INFO ] Deduced a trap composed of 568 places in 621 ms of which 2 ms to minimize.
[2023-03-15 09:58:49] [INFO ] Deduced a trap composed of 576 places in 626 ms of which 1 ms to minimize.
[2023-03-15 09:58:50] [INFO ] Deduced a trap composed of 570 places in 635 ms of which 1 ms to minimize.
[2023-03-15 09:58:51] [INFO ] Deduced a trap composed of 570 places in 588 ms of which 1 ms to minimize.
[2023-03-15 09:58:52] [INFO ] Deduced a trap composed of 562 places in 587 ms of which 1 ms to minimize.
[2023-03-15 09:58:52] [INFO ] Deduced a trap composed of 568 places in 598 ms of which 1 ms to minimize.
[2023-03-15 09:58:53] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 1 ms to minimize.
[2023-03-15 09:58:54] [INFO ] Deduced a trap composed of 564 places in 583 ms of which 1 ms to minimize.
[2023-03-15 09:58:54] [INFO ] Deduced a trap composed of 576 places in 604 ms of which 1 ms to minimize.
[2023-03-15 09:58:55] [INFO ] Deduced a trap composed of 578 places in 577 ms of which 1 ms to minimize.
[2023-03-15 09:58:56] [INFO ] Deduced a trap composed of 572 places in 584 ms of which 1 ms to minimize.
[2023-03-15 09:58:56] [INFO ] Deduced a trap composed of 556 places in 574 ms of which 1 ms to minimize.
[2023-03-15 09:58:57] [INFO ] Deduced a trap composed of 580 places in 590 ms of which 2 ms to minimize.
[2023-03-15 09:58:58] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 1 ms to minimize.
[2023-03-15 09:58:58] [INFO ] Deduced a trap composed of 562 places in 575 ms of which 1 ms to minimize.
[2023-03-15 09:58:59] [INFO ] Deduced a trap composed of 578 places in 615 ms of which 2 ms to minimize.
[2023-03-15 09:59:00] [INFO ] Deduced a trap composed of 568 places in 631 ms of which 1 ms to minimize.
[2023-03-15 09:59:00] [INFO ] Deduced a trap composed of 562 places in 614 ms of which 1 ms to minimize.
[2023-03-15 09:59:01] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2023-03-15 09:59:02] [INFO ] Deduced a trap composed of 560 places in 579 ms of which 1 ms to minimize.
[2023-03-15 09:59:02] [INFO ] Deduced a trap composed of 562 places in 611 ms of which 1 ms to minimize.
[2023-03-15 09:59:03] [INFO ] Deduced a trap composed of 564 places in 621 ms of which 1 ms to minimize.
[2023-03-15 09:59:04] [INFO ] Deduced a trap composed of 568 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:59:04] [INFO ] Deduced a trap composed of 564 places in 580 ms of which 1 ms to minimize.
[2023-03-15 09:59:05] [INFO ] Deduced a trap composed of 562 places in 591 ms of which 1 ms to minimize.
[2023-03-15 09:59:06] [INFO ] Deduced a trap composed of 554 places in 592 ms of which 1 ms to minimize.
[2023-03-15 09:59:06] [INFO ] Deduced a trap composed of 578 places in 595 ms of which 1 ms to minimize.
[2023-03-15 09:59:07] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 1 ms to minimize.
[2023-03-15 09:59:08] [INFO ] Deduced a trap composed of 568 places in 580 ms of which 1 ms to minimize.
[2023-03-15 09:59:08] [INFO ] Deduced a trap composed of 582 places in 572 ms of which 1 ms to minimize.
[2023-03-15 09:59:09] [INFO ] Deduced a trap composed of 582 places in 589 ms of which 1 ms to minimize.
[2023-03-15 09:59:10] [INFO ] Deduced a trap composed of 564 places in 581 ms of which 2 ms to minimize.
[2023-03-15 09:59:10] [INFO ] Deduced a trap composed of 560 places in 585 ms of which 1 ms to minimize.
[2023-03-15 09:59:11] [INFO ] Deduced a trap composed of 558 places in 635 ms of which 2 ms to minimize.
[2023-03-15 09:59:12] [INFO ] Deduced a trap composed of 568 places in 587 ms of which 1 ms to minimize.
[2023-03-15 09:59:12] [INFO ] Deduced a trap composed of 592 places in 584 ms of which 1 ms to minimize.
[2023-03-15 09:59:13] [INFO ] Deduced a trap composed of 576 places in 583 ms of which 1 ms to minimize.
[2023-03-15 09:59:14] [INFO ] Deduced a trap composed of 562 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:59:14] [INFO ] Deduced a trap composed of 572 places in 579 ms of which 1 ms to minimize.
[2023-03-15 09:59:15] [INFO ] Deduced a trap composed of 576 places in 577 ms of which 1 ms to minimize.
[2023-03-15 09:59:16] [INFO ] Deduced a trap composed of 572 places in 578 ms of which 2 ms to minimize.
[2023-03-15 09:59:16] [INFO ] Deduced a trap composed of 588 places in 605 ms of which 1 ms to minimize.
[2023-03-15 09:59:17] [INFO ] Deduced a trap composed of 586 places in 587 ms of which 1 ms to minimize.
[2023-03-15 09:59:18] [INFO ] Deduced a trap composed of 576 places in 578 ms of which 1 ms to minimize.
[2023-03-15 09:59:18] [INFO ] Deduced a trap composed of 566 places in 582 ms of which 1 ms to minimize.
[2023-03-15 09:59:19] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2023-03-15 09:59:20] [INFO ] Deduced a trap composed of 566 places in 572 ms of which 1 ms to minimize.
[2023-03-15 09:59:21] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:59:21] [INFO ] Deduced a trap composed of 570 places in 613 ms of which 1 ms to minimize.
[2023-03-15 09:59:22] [INFO ] Deduced a trap composed of 574 places in 606 ms of which 1 ms to minimize.
[2023-03-15 09:59:23] [INFO ] Deduced a trap composed of 572 places in 602 ms of which 1 ms to minimize.
[2023-03-15 09:59:23] [INFO ] Deduced a trap composed of 570 places in 682 ms of which 1 ms to minimize.
[2023-03-15 09:59:24] [INFO ] Deduced a trap composed of 578 places in 594 ms of which 1 ms to minimize.
[2023-03-15 09:59:25] [INFO ] Deduced a trap composed of 578 places in 595 ms of which 1 ms to minimize.
[2023-03-15 09:59:26] [INFO ] Deduced a trap composed of 580 places in 618 ms of which 1 ms to minimize.
[2023-03-15 09:59:28] [INFO ] Deduced a trap composed of 574 places in 588 ms of which 1 ms to minimize.
[2023-03-15 10:01:18] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 223992 ms
[2023-03-15 10:01:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:01:18] [INFO ] After 225027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 1430 transition count 2592
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 1430 transition count 2591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 284 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2580 rows 1418 cols
[2023-03-15 10:01:19] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-15 10:01:19] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 10:01:19] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 10:01:19] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:01:19] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 10:01:19] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 10:01:20] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:01:21] [INFO ] Deduced a trap composed of 566 places in 605 ms of which 1 ms to minimize.
[2023-03-15 10:01:22] [INFO ] Deduced a trap composed of 576 places in 611 ms of which 1 ms to minimize.
[2023-03-15 10:01:22] [INFO ] Deduced a trap composed of 566 places in 604 ms of which 1 ms to minimize.
[2023-03-15 10:01:23] [INFO ] Deduced a trap composed of 572 places in 598 ms of which 2 ms to minimize.
[2023-03-15 10:01:24] [INFO ] Deduced a trap composed of 566 places in 605 ms of which 2 ms to minimize.
[2023-03-15 10:01:24] [INFO ] Deduced a trap composed of 560 places in 608 ms of which 1 ms to minimize.
[2023-03-15 10:01:25] [INFO ] Deduced a trap composed of 572 places in 636 ms of which 1 ms to minimize.
[2023-03-15 10:01:26] [INFO ] Deduced a trap composed of 574 places in 604 ms of which 1 ms to minimize.
[2023-03-15 10:01:27] [INFO ] Deduced a trap composed of 564 places in 608 ms of which 1 ms to minimize.
[2023-03-15 10:01:27] [INFO ] Deduced a trap composed of 566 places in 606 ms of which 1 ms to minimize.
[2023-03-15 10:01:28] [INFO ] Deduced a trap composed of 566 places in 654 ms of which 1 ms to minimize.
[2023-03-15 10:01:29] [INFO ] Deduced a trap composed of 586 places in 651 ms of which 1 ms to minimize.
[2023-03-15 10:01:30] [INFO ] Deduced a trap composed of 572 places in 650 ms of which 1 ms to minimize.
[2023-03-15 10:01:31] [INFO ] Deduced a trap composed of 576 places in 672 ms of which 1 ms to minimize.
[2023-03-15 10:01:32] [INFO ] Deduced a trap composed of 568 places in 664 ms of which 1 ms to minimize.
[2023-03-15 10:01:32] [INFO ] Deduced a trap composed of 558 places in 654 ms of which 1 ms to minimize.
[2023-03-15 10:01:33] [INFO ] Deduced a trap composed of 560 places in 650 ms of which 2 ms to minimize.
[2023-03-15 10:01:34] [INFO ] Deduced a trap composed of 558 places in 654 ms of which 2 ms to minimize.
[2023-03-15 10:01:34] [INFO ] Deduced a trap composed of 556 places in 617 ms of which 1 ms to minimize.
[2023-03-15 10:01:36] [INFO ] Deduced a trap composed of 564 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:01:37] [INFO ] Deduced a trap composed of 582 places in 609 ms of which 1 ms to minimize.
[2023-03-15 10:01:38] [INFO ] Deduced a trap composed of 568 places in 581 ms of which 1 ms to minimize.
[2023-03-15 10:01:38] [INFO ] Deduced a trap composed of 580 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:01:39] [INFO ] Deduced a trap composed of 576 places in 586 ms of which 1 ms to minimize.
[2023-03-15 10:01:40] [INFO ] Deduced a trap composed of 556 places in 589 ms of which 1 ms to minimize.
[2023-03-15 10:01:41] [INFO ] Deduced a trap composed of 558 places in 586 ms of which 1 ms to minimize.
[2023-03-15 10:01:41] [INFO ] Deduced a trap composed of 568 places in 589 ms of which 1 ms to minimize.
[2023-03-15 10:01:42] [INFO ] Deduced a trap composed of 572 places in 604 ms of which 1 ms to minimize.
[2023-03-15 10:01:43] [INFO ] Deduced a trap composed of 574 places in 600 ms of which 1 ms to minimize.
[2023-03-15 10:01:44] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 1 ms to minimize.
[2023-03-15 10:01:44] [INFO ] Deduced a trap composed of 570 places in 617 ms of which 2 ms to minimize.
[2023-03-15 10:01:45] [INFO ] Deduced a trap composed of 574 places in 611 ms of which 1 ms to minimize.
[2023-03-15 10:01:46] [INFO ] Deduced a trap composed of 572 places in 658 ms of which 1 ms to minimize.
[2023-03-15 10:01:47] [INFO ] Deduced a trap composed of 574 places in 567 ms of which 1 ms to minimize.
[2023-03-15 10:01:47] [INFO ] Deduced a trap composed of 558 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:01:48] [INFO ] Deduced a trap composed of 568 places in 596 ms of which 1 ms to minimize.
[2023-03-15 10:01:49] [INFO ] Deduced a trap composed of 564 places in 603 ms of which 2 ms to minimize.
[2023-03-15 10:01:49] [INFO ] Deduced a trap composed of 564 places in 609 ms of which 1 ms to minimize.
[2023-03-15 10:01:50] [INFO ] Deduced a trap composed of 570 places in 604 ms of which 1 ms to minimize.
[2023-03-15 10:01:51] [INFO ] Deduced a trap composed of 570 places in 616 ms of which 1 ms to minimize.
[2023-03-15 10:01:51] [INFO ] Deduced a trap composed of 570 places in 606 ms of which 1 ms to minimize.
[2023-03-15 10:01:52] [INFO ] Deduced a trap composed of 562 places in 603 ms of which 2 ms to minimize.
[2023-03-15 10:01:53] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 2 ms to minimize.
[2023-03-15 10:01:54] [INFO ] Deduced a trap composed of 566 places in 607 ms of which 1 ms to minimize.
[2023-03-15 10:01:55] [INFO ] Deduced a trap composed of 570 places in 609 ms of which 1 ms to minimize.
[2023-03-15 10:01:55] [INFO ] Deduced a trap composed of 590 places in 616 ms of which 1 ms to minimize.
[2023-03-15 10:01:56] [INFO ] Deduced a trap composed of 584 places in 605 ms of which 1 ms to minimize.
[2023-03-15 10:01:57] [INFO ] Deduced a trap composed of 582 places in 555 ms of which 1 ms to minimize.
[2023-03-15 10:01:58] [INFO ] Deduced a trap composed of 570 places in 602 ms of which 1 ms to minimize.
[2023-03-15 10:02:06] [INFO ] Deduced a trap composed of 576 places in 602 ms of which 2 ms to minimize.
[2023-03-15 10:02:07] [INFO ] Deduced a trap composed of 568 places in 596 ms of which 1 ms to minimize.
[2023-03-15 10:02:10] [INFO ] Deduced a trap composed of 554 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:02:11] [INFO ] Deduced a trap composed of 574 places in 556 ms of which 2 ms to minimize.
[2023-03-15 10:02:12] [INFO ] Deduced a trap composed of 574 places in 558 ms of which 1 ms to minimize.
[2023-03-15 10:02:12] [INFO ] Deduced a trap composed of 574 places in 608 ms of which 2 ms to minimize.
[2023-03-15 10:02:13] [INFO ] Deduced a trap composed of 582 places in 605 ms of which 1 ms to minimize.
[2023-03-15 10:02:14] [INFO ] Deduced a trap composed of 574 places in 630 ms of which 1 ms to minimize.
[2023-03-15 10:02:15] [INFO ] Deduced a trap composed of 560 places in 653 ms of which 1 ms to minimize.
[2023-03-15 10:02:16] [INFO ] Deduced a trap composed of 574 places in 651 ms of which 1 ms to minimize.
[2023-03-15 10:02:17] [INFO ] Deduced a trap composed of 586 places in 647 ms of which 1 ms to minimize.
[2023-03-15 10:02:17] [INFO ] Deduced a trap composed of 562 places in 643 ms of which 1 ms to minimize.
[2023-03-15 10:02:18] [INFO ] Deduced a trap composed of 556 places in 652 ms of which 1 ms to minimize.
[2023-03-15 10:02:19] [INFO ] Deduced a trap composed of 560 places in 657 ms of which 1 ms to minimize.
[2023-03-15 10:02:20] [INFO ] Deduced a trap composed of 570 places in 657 ms of which 1 ms to minimize.
[2023-03-15 10:02:20] [INFO ] Deduced a trap composed of 568 places in 654 ms of which 1 ms to minimize.
[2023-03-15 10:02:21] [INFO ] Deduced a trap composed of 568 places in 655 ms of which 1 ms to minimize.
[2023-03-15 10:02:22] [INFO ] Deduced a trap composed of 566 places in 656 ms of which 1 ms to minimize.
[2023-03-15 10:02:23] [INFO ] Deduced a trap composed of 564 places in 642 ms of which 1 ms to minimize.
[2023-03-15 10:02:23] [INFO ] Deduced a trap composed of 566 places in 652 ms of which 1 ms to minimize.
[2023-03-15 10:02:24] [INFO ] Deduced a trap composed of 562 places in 665 ms of which 1 ms to minimize.
[2023-03-15 10:02:25] [INFO ] Deduced a trap composed of 568 places in 624 ms of which 1 ms to minimize.
[2023-03-15 10:02:26] [INFO ] Deduced a trap composed of 558 places in 616 ms of which 1 ms to minimize.
[2023-03-15 10:02:26] [INFO ] Deduced a trap composed of 554 places in 629 ms of which 1 ms to minimize.
[2023-03-15 10:02:27] [INFO ] Deduced a trap composed of 572 places in 614 ms of which 1 ms to minimize.
[2023-03-15 10:02:28] [INFO ] Deduced a trap composed of 576 places in 614 ms of which 1 ms to minimize.
[2023-03-15 10:02:28] [INFO ] Deduced a trap composed of 570 places in 626 ms of which 1 ms to minimize.
[2023-03-15 10:02:29] [INFO ] Deduced a trap composed of 558 places in 625 ms of which 1 ms to minimize.
[2023-03-15 10:02:31] [INFO ] Deduced a trap composed of 572 places in 621 ms of which 1 ms to minimize.
[2023-03-15 10:02:32] [INFO ] Deduced a trap composed of 576 places in 574 ms of which 1 ms to minimize.
[2023-03-15 10:02:33] [INFO ] Deduced a trap composed of 572 places in 579 ms of which 2 ms to minimize.
[2023-03-15 10:02:33] [INFO ] Deduced a trap composed of 566 places in 577 ms of which 1 ms to minimize.
[2023-03-15 10:02:34] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 1 ms to minimize.
[2023-03-15 10:02:35] [INFO ] Deduced a trap composed of 560 places in 596 ms of which 1 ms to minimize.
[2023-03-15 10:02:35] [INFO ] Deduced a trap composed of 568 places in 582 ms of which 1 ms to minimize.
[2023-03-15 10:02:36] [INFO ] Deduced a trap composed of 576 places in 598 ms of which 1 ms to minimize.
[2023-03-15 10:02:37] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 10:02:38] [INFO ] Deduced a trap composed of 570 places in 614 ms of which 1 ms to minimize.
[2023-03-15 10:02:38] [INFO ] Deduced a trap composed of 562 places in 595 ms of which 1 ms to minimize.
[2023-03-15 10:02:39] [INFO ] Deduced a trap composed of 568 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:02:40] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 1 ms to minimize.
[2023-03-15 10:02:40] [INFO ] Deduced a trap composed of 564 places in 590 ms of which 1 ms to minimize.
[2023-03-15 10:02:41] [INFO ] Deduced a trap composed of 576 places in 584 ms of which 1 ms to minimize.
[2023-03-15 10:02:42] [INFO ] Deduced a trap composed of 578 places in 594 ms of which 2 ms to minimize.
[2023-03-15 10:02:43] [INFO ] Deduced a trap composed of 572 places in 618 ms of which 1 ms to minimize.
[2023-03-15 10:02:43] [INFO ] Deduced a trap composed of 556 places in 586 ms of which 1 ms to minimize.
[2023-03-15 10:02:44] [INFO ] Deduced a trap composed of 580 places in 589 ms of which 1 ms to minimize.
[2023-03-15 10:02:45] [INFO ] Deduced a trap composed of 566 places in 586 ms of which 2 ms to minimize.
[2023-03-15 10:02:45] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 1 ms to minimize.
[2023-03-15 10:02:46] [INFO ] Deduced a trap composed of 578 places in 584 ms of which 2 ms to minimize.
[2023-03-15 10:02:47] [INFO ] Deduced a trap composed of 568 places in 622 ms of which 1 ms to minimize.
[2023-03-15 10:02:47] [INFO ] Deduced a trap composed of 562 places in 584 ms of which 2 ms to minimize.
[2023-03-15 10:02:48] [INFO ] Deduced a trap composed of 568 places in 575 ms of which 1 ms to minimize.
[2023-03-15 10:02:49] [INFO ] Deduced a trap composed of 560 places in 569 ms of which 1 ms to minimize.
[2023-03-15 10:02:49] [INFO ] Deduced a trap composed of 562 places in 575 ms of which 1 ms to minimize.
[2023-03-15 10:02:50] [INFO ] Deduced a trap composed of 564 places in 600 ms of which 1 ms to minimize.
[2023-03-15 10:02:51] [INFO ] Deduced a trap composed of 568 places in 596 ms of which 1 ms to minimize.
[2023-03-15 10:02:51] [INFO ] Deduced a trap composed of 564 places in 617 ms of which 1 ms to minimize.
[2023-03-15 10:02:52] [INFO ] Deduced a trap composed of 562 places in 584 ms of which 1 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 554 places in 579 ms of which 1 ms to minimize.
[2023-03-15 10:02:53] [INFO ] Deduced a trap composed of 578 places in 604 ms of which 2 ms to minimize.
[2023-03-15 10:02:54] [INFO ] Deduced a trap composed of 562 places in 581 ms of which 1 ms to minimize.
[2023-03-15 10:02:55] [INFO ] Deduced a trap composed of 568 places in 565 ms of which 1 ms to minimize.
[2023-03-15 10:02:55] [INFO ] Deduced a trap composed of 582 places in 576 ms of which 1 ms to minimize.
[2023-03-15 10:02:56] [INFO ] Deduced a trap composed of 582 places in 587 ms of which 1 ms to minimize.
[2023-03-15 10:02:57] [INFO ] Deduced a trap composed of 564 places in 601 ms of which 1 ms to minimize.
[2023-03-15 10:02:57] [INFO ] Deduced a trap composed of 560 places in 577 ms of which 1 ms to minimize.
[2023-03-15 10:02:58] [INFO ] Deduced a trap composed of 558 places in 594 ms of which 1 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 568 places in 585 ms of which 1 ms to minimize.
[2023-03-15 10:02:59] [INFO ] Deduced a trap composed of 592 places in 613 ms of which 16 ms to minimize.
[2023-03-15 10:03:00] [INFO ] Deduced a trap composed of 576 places in 579 ms of which 1 ms to minimize.
[2023-03-15 10:03:01] [INFO ] Deduced a trap composed of 562 places in 573 ms of which 1 ms to minimize.
[2023-03-15 10:03:01] [INFO ] Deduced a trap composed of 572 places in 574 ms of which 1 ms to minimize.
[2023-03-15 10:03:02] [INFO ] Deduced a trap composed of 576 places in 573 ms of which 1 ms to minimize.
[2023-03-15 10:03:03] [INFO ] Deduced a trap composed of 572 places in 591 ms of which 1 ms to minimize.
[2023-03-15 10:03:03] [INFO ] Deduced a trap composed of 588 places in 592 ms of which 1 ms to minimize.
[2023-03-15 10:03:04] [INFO ] Deduced a trap composed of 586 places in 583 ms of which 2 ms to minimize.
[2023-03-15 10:03:05] [INFO ] Deduced a trap composed of 576 places in 580 ms of which 1 ms to minimize.
[2023-03-15 10:03:05] [INFO ] Deduced a trap composed of 566 places in 633 ms of which 1 ms to minimize.
[2023-03-15 10:03:06] [INFO ] Deduced a trap composed of 570 places in 584 ms of which 2 ms to minimize.
[2023-03-15 10:03:07] [INFO ] Deduced a trap composed of 566 places in 583 ms of which 1 ms to minimize.
[2023-03-15 10:03:07] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2023-03-15 10:03:08] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 10:03:09] [INFO ] Deduced a trap composed of 574 places in 575 ms of which 1 ms to minimize.
[2023-03-15 10:03:09] [INFO ] Deduced a trap composed of 572 places in 627 ms of which 1 ms to minimize.
[2023-03-15 10:03:10] [INFO ] Deduced a trap composed of 570 places in 645 ms of which 1 ms to minimize.
[2023-03-15 10:03:11] [INFO ] Deduced a trap composed of 578 places in 584 ms of which 1 ms to minimize.
[2023-03-15 10:03:12] [INFO ] Deduced a trap composed of 578 places in 562 ms of which 2 ms to minimize.
[2023-03-15 10:03:13] [INFO ] Deduced a trap composed of 580 places in 573 ms of which 1 ms to minimize.
[2023-03-15 10:03:15] [INFO ] Deduced a trap composed of 574 places in 578 ms of which 1 ms to minimize.
[2023-03-15 10:05:04] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 223962 ms
[2023-03-15 10:05:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 10:05:04] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:04] [INFO ] Flatten gal took : 326 ms
[2023-03-15 10:05:05] [INFO ] Flatten gal took : 182 ms
[2023-03-15 10:05:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5491344077210842297.gal : 42 ms
[2023-03-15 10:05:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18184314338486191857.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5491344077210842297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18184314338486191857.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability18184314338486191857.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
Detected timeout of ITS tools.
[2023-03-15 10:05:08] [INFO ] Flatten gal took : 174 ms
[2023-03-15 10:05:08] [INFO ] Applying decomposition
[2023-03-15 10:05:08] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1267429880135078426.txt' '-o' '/tmp/graph1267429880135078426.bin' '-w' '/tmp/graph1267429880135078426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1267429880135078426.bin' '-l' '-1' '-v' '-w' '/tmp/graph1267429880135078426.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:05:09] [INFO ] Decomposing Gal with order
[2023-03-15 10:05:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:05:09] [INFO ] Removed a total of 4720 redundant transitions.
[2023-03-15 10:05:10] [INFO ] Flatten gal took : 791 ms
[2023-03-15 10:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 699 labels/synchronizations in 127 ms.
[2023-03-15 10:05:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10380127968905931610.gal : 23 ms
[2023-03-15 10:05:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3374521749925135980.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10380127968905931610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3374521749925135980.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability3374521749925135980.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15641549720889590400
[2023-03-15 10:05:13] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15641549720889590400
Running compilation step : cd /tmp/ltsmin15641549720889590400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15641549720889590400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15641549720889590400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 10:05:15] [INFO ] Flatten gal took : 136 ms
[2023-03-15 10:05:15] [INFO ] Flatten gal took : 137 ms
[2023-03-15 10:05:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13478160365122021006.gal : 15 ms
[2023-03-15 10:05:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17343484437707698644.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13478160365122021006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17343484437707698644.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityFireability17343484437707698644.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 184
Detected timeout of ITS tools.
[2023-03-15 10:05:45] [INFO ] Flatten gal took : 127 ms
[2023-03-15 10:05:45] [INFO ] Applying decomposition
[2023-03-15 10:05:46] [INFO ] Flatten gal took : 128 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4162556146368975130.txt' '-o' '/tmp/graph4162556146368975130.bin' '-w' '/tmp/graph4162556146368975130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4162556146368975130.bin' '-l' '-1' '-v' '-w' '/tmp/graph4162556146368975130.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:05:46] [INFO ] Decomposing Gal with order
[2023-03-15 10:05:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:05:46] [INFO ] Removed a total of 4720 redundant transitions.
[2023-03-15 10:05:46] [INFO ] Flatten gal took : 302 ms
[2023-03-15 10:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 705 labels/synchronizations in 83 ms.
[2023-03-15 10:05:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17117748972366922148.gal : 25 ms
[2023-03-15 10:05:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9062658487761569420.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17117748972366922148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9062658487761569420.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability9062658487761569420.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4711834702768448299
[2023-03-15 10:06:17] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4711834702768448299
Running compilation step : cd /tmp/ltsmin4711834702768448299;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4711834702768448299;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4711834702768448299;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 6 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 10:06:23] [INFO ] Flatten gal took : 110 ms
[2023-03-15 10:06:23] [INFO ] Flatten gal took : 113 ms
[2023-03-15 10:06:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2355035197226445989.gal : 13 ms
[2023-03-15 10:06:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16642302131357209749.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2355035197226445989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16642302131357209749.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability16642302131357209749.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 184
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :184 after 16085
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16085 after 19377
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :19377 after 22325
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22325 after 28565
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :28565 after 34986
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :34986 after 119617
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :119617 after 188617
Detected timeout of ITS tools.
[2023-03-15 10:11:23] [INFO ] Flatten gal took : 112 ms
[2023-03-15 10:11:23] [INFO ] Applying decomposition
[2023-03-15 10:11:23] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14181795681965915294.txt' '-o' '/tmp/graph14181795681965915294.bin' '-w' '/tmp/graph14181795681965915294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14181795681965915294.bin' '-l' '-1' '-v' '-w' '/tmp/graph14181795681965915294.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:11:24] [INFO ] Decomposing Gal with order
[2023-03-15 10:11:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:11:24] [INFO ] Removed a total of 4720 redundant transitions.
[2023-03-15 10:11:24] [INFO ] Flatten gal took : 309 ms
[2023-03-15 10:11:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 701 labels/synchronizations in 57 ms.
[2023-03-15 10:11:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4779323165043071683.gal : 36 ms
[2023-03-15 10:11:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4321913246257147147.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4779323165043071683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4321913246257147147.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability4321913246257147147.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9173577000058711082
[2023-03-15 10:16:25] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9173577000058711082
Running compilation step : cd /tmp/ltsmin9173577000058711082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 5494 ms.
Running link step : cd /tmp/ltsmin9173577000058711082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9173577000058711082;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBNT-COL-S10J80, 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 r320-tall-167873970600442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;