Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r175-tall-165277024500502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r175-tall-165277024500502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.6K Apr 30 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 04:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 04:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 95K May 10 09:34 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 1652814211615

Running Version 202205111006
[2022-05-17 19:03:32] [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]
[2022-05-17 19:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 19:03:32] [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.
[2022-05-17 19:03:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 19:03:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2022-05-17 19:03:33] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 23 ms.
[2022-05-17 19:03:33] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 178 ms.
[2022-05-17 19:03:33] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 19:03:33] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-17 19:03:33] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-17 19:03:33] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 32 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 1402 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 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 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 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 28 ms. (steps per millisecond=35 ) 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 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 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 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 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 20 ms. (steps per millisecond=50 ) 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 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 97 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 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 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 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 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 27 ms. (steps per millisecond=37 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) 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
Running SMT prover for 25 properties.
[2022-05-17 19:03:36] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2022-05-17 19:03:36] [INFO ] Computed 192 place invariants in 269 ms
[2022-05-17 19:03:39] [INFO ] [Real]Absence check using 185 positive place invariants in 80 ms returned sat
[2022-05-17 19:03:40] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned sat
[2022-05-17 19:03:43] [INFO ] After 1986ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:23
[2022-05-17 19:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:03:43] [INFO ] After 333ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:23
[2022-05-17 19:03:43] [INFO ] After 732ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:23
Attempting to minimize the solution found.
Minimization took 230 ms.
[2022-05-17 19:03:44] [INFO ] After 5156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:23
[2022-05-17 19:03:44] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2022-05-17 19:03:45] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 52 ms returned sat
[2022-05-17 19:04:09] [INFO ] After 23208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-17 19:04:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:04:09] [INFO ] After 25046ms 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 573 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 2 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 240 ms. Remains 1601 /1614 variables (removed 13) and now considering 3387/3390 (removed 3) transitions.
[2022-05-17 19:04:09] [INFO ] Flow matrix only has 3378 transitions (discarded 9 similar events)
// Phase 1: matrix 3378 rows 1601 cols
[2022-05-17 19:04:10] [INFO ] Computed 182 place invariants in 135 ms
[2022-05-17 19:04:12] [INFO ] Dead Transitions using invariants and state equation in 2544 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 61 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 66374 resets, run finished after 9210 ms. (steps per millisecond=108 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 1000001 steps, including 9157 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:04:23] [INFO ] Flow matrix only has 2763 transitions (discarded 9 similar events)
// Phase 1: matrix 2763 rows 1601 cols
[2022-05-17 19:04:23] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-17 19:04:24] [INFO ] [Real]Absence check using 176 positive place invariants in 55 ms returned sat
[2022-05-17 19:04:24] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 33 ms returned sat
[2022-05-17 19:04:24] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:04:24] [INFO ] [Nat]Absence check using 176 positive place invariants in 52 ms returned sat
[2022-05-17 19:04:24] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 31 ms returned sat
[2022-05-17 19:04:25] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:04:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:04:25] [INFO ] After 407ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:04:26] [INFO ] Deduced a trap composed of 734 places in 786 ms of which 2 ms to minimize.
[2022-05-17 19:04:27] [INFO ] Deduced a trap composed of 748 places in 773 ms of which 2 ms to minimize.
[2022-05-17 19:04:28] [INFO ] Deduced a trap composed of 752 places in 748 ms of which 1 ms to minimize.
[2022-05-17 19:04:29] [INFO ] Deduced a trap composed of 744 places in 798 ms of which 2 ms to minimize.
[2022-05-17 19:04:30] [INFO ] Deduced a trap composed of 742 places in 754 ms of which 2 ms to minimize.
[2022-05-17 19:04:31] [INFO ] Deduced a trap composed of 740 places in 717 ms of which 1 ms to minimize.
[2022-05-17 19:04:32] [INFO ] Deduced a trap composed of 754 places in 733 ms of which 2 ms to minimize.
[2022-05-17 19:04:33] [INFO ] Deduced a trap composed of 762 places in 771 ms of which 1 ms to minimize.
[2022-05-17 19:04:34] [INFO ] Deduced a trap composed of 748 places in 718 ms of which 2 ms to minimize.
[2022-05-17 19:04:35] [INFO ] Deduced a trap composed of 738 places in 784 ms of which 1 ms to minimize.
[2022-05-17 19:04:36] [INFO ] Deduced a trap composed of 748 places in 737 ms of which 1 ms to minimize.
[2022-05-17 19:04:37] [INFO ] Deduced a trap composed of 748 places in 758 ms of which 2 ms to minimize.
[2022-05-17 19:04:38] [INFO ] Deduced a trap composed of 742 places in 735 ms of which 2 ms to minimize.
[2022-05-17 19:04:39] [INFO ] Deduced a trap composed of 760 places in 768 ms of which 2 ms to minimize.
[2022-05-17 19:04:40] [INFO ] Deduced a trap composed of 750 places in 733 ms of which 2 ms to minimize.
[2022-05-17 19:04:41] [INFO ] Deduced a trap composed of 734 places in 717 ms of which 1 ms to minimize.
[2022-05-17 19:04:42] [INFO ] Deduced a trap composed of 752 places in 745 ms of which 1 ms to minimize.
[2022-05-17 19:04:43] [INFO ] Deduced a trap composed of 744 places in 733 ms of which 1 ms to minimize.
[2022-05-17 19:04:44] [INFO ] Deduced a trap composed of 746 places in 781 ms of which 1 ms to minimize.
[2022-05-17 19:04:45] [INFO ] Deduced a trap composed of 746 places in 730 ms of which 2 ms to minimize.
[2022-05-17 19:04:46] [INFO ] Deduced a trap composed of 746 places in 772 ms of which 1 ms to minimize.
[2022-05-17 19:04:47] [INFO ] Deduced a trap composed of 746 places in 773 ms of which 2 ms to minimize.
[2022-05-17 19:04:48] [INFO ] Deduced a trap composed of 752 places in 745 ms of which 1 ms to minimize.
[2022-05-17 19:04:50] [INFO ] Deduced a trap composed of 756 places in 731 ms of which 1 ms to minimize.
[2022-05-17 19:04:53] [INFO ] Deduced a trap composed of 732 places in 717 ms of which 1 ms to minimize.
[2022-05-17 19:04:54] [INFO ] Deduced a trap composed of 748 places in 723 ms of which 2 ms to minimize.
[2022-05-17 19:04:55] [INFO ] Deduced a trap composed of 740 places in 752 ms of which 2 ms to minimize.
[2022-05-17 19:04:56] [INFO ] Deduced a trap composed of 744 places in 701 ms of which 2 ms to minimize.
[2022-05-17 19:04:57] [INFO ] Deduced a trap composed of 760 places in 730 ms of which 2 ms to minimize.
[2022-05-17 19:04:58] [INFO ] Deduced a trap composed of 736 places in 736 ms of which 1 ms to minimize.
[2022-05-17 19:04:59] [INFO ] Deduced a trap composed of 744 places in 729 ms of which 1 ms to minimize.
[2022-05-17 19:05:08] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 42295 ms
[2022-05-17 19:05:08] [INFO ] After 43057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:05:08] [INFO ] After 44284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 29 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 1 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 517 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 1000001 steps, including 72684 resets, run finished after 11335 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6560 resets, run finished after 2133 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3159597 steps, run timeout after 39001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 3159597 steps, saw 524616 distinct states, run finished after 39003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:06:01] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:06:01] [INFO ] Computed 182 place invariants in 65 ms
[2022-05-17 19:06:01] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-17 19:06:01] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-17 19:06:01] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:06:02] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2022-05-17 19:06:02] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-17 19:06:07] [INFO ] After 4930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:06:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:06:07] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:06:08] [INFO ] Deduced a trap composed of 576 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 568 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 578 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:06:10] [INFO ] Deduced a trap composed of 588 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 572 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:06:12] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:06:12] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 2 ms to minimize.
[2022-05-17 19:06:13] [INFO ] Deduced a trap composed of 576 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:06:14] [INFO ] Deduced a trap composed of 568 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 570 places in 569 ms of which 1 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 588 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:06:16] [INFO ] Deduced a trap composed of 574 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:06:17] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:06:17] [INFO ] Deduced a trap composed of 564 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:06:18] [INFO ] Deduced a trap composed of 568 places in 609 ms of which 2 ms to minimize.
[2022-05-17 19:06:19] [INFO ] Deduced a trap composed of 578 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 560 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 580 places in 610 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 570 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:06:22] [INFO ] Deduced a trap composed of 564 places in 588 ms of which 2 ms to minimize.
[2022-05-17 19:06:23] [INFO ] Deduced a trap composed of 572 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:06:25] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:06:26] [INFO ] Deduced a trap composed of 572 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:06:26] [INFO ] Deduced a trap composed of 570 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:06:27] [INFO ] Deduced a trap composed of 562 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:06:28] [INFO ] Deduced a trap composed of 574 places in 597 ms of which 3 ms to minimize.
[2022-05-17 19:06:29] [INFO ] Deduced a trap composed of 566 places in 581 ms of which 1 ms to minimize.
[2022-05-17 19:06:33] [INFO ] Deduced a trap composed of 574 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:06:36] [INFO ] Deduced a trap composed of 584 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Deduced a trap composed of 574 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Deduced a trap composed of 564 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:06:38] [INFO ] Deduced a trap composed of 584 places in 579 ms of which 2 ms to minimize.
[2022-05-17 19:06:39] [INFO ] Deduced a trap composed of 564 places in 590 ms of which 3 ms to minimize.
[2022-05-17 19:06:40] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 3 ms to minimize.
[2022-05-17 19:06:40] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 5 ms to minimize.
[2022-05-17 19:06:42] [INFO ] Deduced a trap composed of 580 places in 590 ms of which 2 ms to minimize.
[2022-05-17 19:06:42] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:06:51] [INFO ] Deduced a trap composed of 570 places in 591 ms of which 2 ms to minimize.
[2022-05-17 19:06:54] [INFO ] Deduced a trap composed of 570 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:06:55] [INFO ] Deduced a trap composed of 568 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:07:01] [INFO ] Deduced a trap composed of 562 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:07:06] [INFO ] Deduced a trap composed of 566 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:07:15] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 68737 ms
[2022-05-17 19:07:16] [INFO ] After 69269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:07:16] [INFO ] After 74467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 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 67 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 65 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-17 19:07:16] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:07:16] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-17 19:07:17] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2022-05-17 19:07:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:07:17] [INFO ] Computed 182 place invariants in 55 ms
[2022-05-17 19:07:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:07:27] [INFO ] Implicit Places using invariants and state equation in 9603 ms returned []
Implicit Place search using SMT with State Equation took 11009 ms to find 0 implicit places.
[2022-05-17 19:07:27] [INFO ] Redundant transitions in 146 ms returned []
[2022-05-17 19:07:27] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:07:27] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-17 19:07:29] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7230 resets, run finished after 1291 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:07:30] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:07:30] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-17 19:07:30] [INFO ] [Real]Absence check using 175 positive place invariants in 56 ms returned sat
[2022-05-17 19:07:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-17 19:07:30] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:07:30] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2022-05-17 19:07:30] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-17 19:07:35] [INFO ] After 4767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:07:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:07:35] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:07:36] [INFO ] Deduced a trap composed of 574 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:07:37] [INFO ] Deduced a trap composed of 576 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:07:37] [INFO ] Deduced a trap composed of 568 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:07:38] [INFO ] Deduced a trap composed of 578 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:07:39] [INFO ] Deduced a trap composed of 588 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:07:40] [INFO ] Deduced a trap composed of 572 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:07:40] [INFO ] Deduced a trap composed of 568 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:07:41] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:07:42] [INFO ] Deduced a trap composed of 576 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:07:42] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:07:43] [INFO ] Deduced a trap composed of 570 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:07:44] [INFO ] Deduced a trap composed of 588 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:07:45] [INFO ] Deduced a trap composed of 574 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:07:45] [INFO ] Deduced a trap composed of 570 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:07:46] [INFO ] Deduced a trap composed of 564 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:07:47] [INFO ] Deduced a trap composed of 568 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:07:48] [INFO ] Deduced a trap composed of 578 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:07:48] [INFO ] Deduced a trap composed of 560 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:07:49] [INFO ] Deduced a trap composed of 580 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:07:50] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:07:51] [INFO ] Deduced a trap composed of 564 places in 608 ms of which 1 ms to minimize.
[2022-05-17 19:07:52] [INFO ] Deduced a trap composed of 572 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:07:54] [INFO ] Deduced a trap composed of 574 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:07:54] [INFO ] Deduced a trap composed of 572 places in 596 ms of which 2 ms to minimize.
[2022-05-17 19:07:55] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:07:56] [INFO ] Deduced a trap composed of 562 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:07:57] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:07:58] [INFO ] Deduced a trap composed of 566 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:08:02] [INFO ] Deduced a trap composed of 574 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:08:05] [INFO ] Deduced a trap composed of 584 places in 577 ms of which 2 ms to minimize.
[2022-05-17 19:08:05] [INFO ] Deduced a trap composed of 574 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:08:06] [INFO ] Deduced a trap composed of 564 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:08:07] [INFO ] Deduced a trap composed of 584 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:08:08] [INFO ] Deduced a trap composed of 564 places in 578 ms of which 1 ms to minimize.
[2022-05-17 19:08:08] [INFO ] Deduced a trap composed of 574 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:08:09] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:08:11] [INFO ] Deduced a trap composed of 580 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:08:11] [INFO ] Deduced a trap composed of 570 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:08:19] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:08:23] [INFO ] Deduced a trap composed of 570 places in 576 ms of which 1 ms to minimize.
[2022-05-17 19:08:23] [INFO ] Deduced a trap composed of 568 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 562 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:08:35] [INFO ] Deduced a trap composed of 566 places in 584 ms of which 2 ms to minimize.
[2022-05-17 19:08:44] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 68543 ms
[2022-05-17 19:08:45] [INFO ] After 69321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:08:45] [INFO ] After 74357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72677 resets, run finished after 12151 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6408 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3375502 steps, run timeout after 42001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 3375502 steps, saw 561362 distinct states, run finished after 42001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:09:41] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:09:41] [INFO ] Computed 182 place invariants in 61 ms
[2022-05-17 19:09:41] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-17 19:09:41] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2022-05-17 19:09:41] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:09:41] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2022-05-17 19:09:41] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-17 19:09:46] [INFO ] After 4951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:09:46] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:47] [INFO ] Deduced a trap composed of 574 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:09:48] [INFO ] Deduced a trap composed of 576 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:09:49] [INFO ] Deduced a trap composed of 568 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:09:49] [INFO ] Deduced a trap composed of 578 places in 605 ms of which 1 ms to minimize.
[2022-05-17 19:09:50] [INFO ] Deduced a trap composed of 588 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 572 places in 604 ms of which 2 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 568 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:09:52] [INFO ] Deduced a trap composed of 570 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 576 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 568 places in 605 ms of which 1 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:09:55] [INFO ] Deduced a trap composed of 588 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 574 places in 594 ms of which 2 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 564 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:09:58] [INFO ] Deduced a trap composed of 568 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:09:59] [INFO ] Deduced a trap composed of 578 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 560 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 580 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:10:01] [INFO ] Deduced a trap composed of 570 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 564 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:10:03] [INFO ] Deduced a trap composed of 572 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 572 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:10:06] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:10:07] [INFO ] Deduced a trap composed of 562 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:10:08] [INFO ] Deduced a trap composed of 574 places in 599 ms of which 2 ms to minimize.
[2022-05-17 19:10:09] [INFO ] Deduced a trap composed of 566 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:10:13] [INFO ] Deduced a trap composed of 574 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:10:16] [INFO ] Deduced a trap composed of 584 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:10:17] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:10:17] [INFO ] Deduced a trap composed of 564 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:10:18] [INFO ] Deduced a trap composed of 584 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:10:19] [INFO ] Deduced a trap composed of 564 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:10:20] [INFO ] Deduced a trap composed of 574 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:10:20] [INFO ] Deduced a trap composed of 570 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 580 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:10:31] [INFO ] Deduced a trap composed of 570 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:10:34] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:10:35] [INFO ] Deduced a trap composed of 568 places in 579 ms of which 1 ms to minimize.
[2022-05-17 19:10:41] [INFO ] Deduced a trap composed of 562 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:10:46] [INFO ] Deduced a trap composed of 566 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:10:55] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 68809 ms
[2022-05-17 19:10:56] [INFO ] After 69538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:10:56] [INFO ] After 74742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 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 66 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 66 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-17 19:10:56] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:10:56] [INFO ] Computed 182 place invariants in 67 ms
[2022-05-17 19:10:57] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2022-05-17 19:10:57] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:10:58] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-17 19:10:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:11:06] [INFO ] Implicit Places using invariants and state equation in 8458 ms returned []
Implicit Place search using SMT with State Equation took 9867 ms to find 0 implicit places.
[2022-05-17 19:11:06] [INFO ] Redundant transitions in 131 ms returned []
[2022-05-17 19:11:06] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:11:06] [INFO ] Computed 182 place invariants in 71 ms
[2022-05-17 19:11:07] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7223 resets, run finished after 1230 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:11:09] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:11:09] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-17 19:11:09] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-17 19:11:09] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-17 19:11:09] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:11:09] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-17 19:11:09] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-17 19:11:14] [INFO ] After 4783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:11:14] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:15] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:11:15] [INFO ] Deduced a trap composed of 576 places in 578 ms of which 2 ms to minimize.
[2022-05-17 19:11:16] [INFO ] Deduced a trap composed of 568 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:11:17] [INFO ] Deduced a trap composed of 578 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:11:18] [INFO ] Deduced a trap composed of 588 places in 579 ms of which 1 ms to minimize.
[2022-05-17 19:11:18] [INFO ] Deduced a trap composed of 572 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:11:19] [INFO ] Deduced a trap composed of 568 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:11:20] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:11:20] [INFO ] Deduced a trap composed of 576 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:11:21] [INFO ] Deduced a trap composed of 568 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:11:22] [INFO ] Deduced a trap composed of 570 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 588 places in 590 ms of which 2 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 574 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:11:24] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 564 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 568 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 578 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 560 places in 609 ms of which 1 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 580 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:11:29] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 564 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 572 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:11:32] [INFO ] Deduced a trap composed of 574 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:11:33] [INFO ] Deduced a trap composed of 572 places in 589 ms of which 2 ms to minimize.
[2022-05-17 19:11:34] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:11:35] [INFO ] Deduced a trap composed of 562 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:11:36] [INFO ] Deduced a trap composed of 574 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 566 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:11:41] [INFO ] Deduced a trap composed of 574 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:11:43] [INFO ] Deduced a trap composed of 584 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:11:44] [INFO ] Deduced a trap composed of 574 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:11:45] [INFO ] Deduced a trap composed of 564 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:11:46] [INFO ] Deduced a trap composed of 584 places in 579 ms of which 2 ms to minimize.
[2022-05-17 19:11:46] [INFO ] Deduced a trap composed of 564 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:11:47] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:11:48] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:11:49] [INFO ] Deduced a trap composed of 580 places in 605 ms of which 1 ms to minimize.
[2022-05-17 19:11:50] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:11:58] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:12:01] [INFO ] Deduced a trap composed of 570 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:12:02] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2022-05-17 19:12:09] [INFO ] Deduced a trap composed of 562 places in 592 ms of which 2 ms to minimize.
[2022-05-17 19:12:14] [INFO ] Deduced a trap composed of 566 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:12:23] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 68746 ms
[2022-05-17 19:12:24] [INFO ] After 69922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:12:24] [INFO ] After 74966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 727 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239166 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239166 steps, saw 39828 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:12:27] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:12:27] [INFO ] Computed 182 place invariants in 58 ms
[2022-05-17 19:12:27] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-17 19:12:27] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-17 19:12:27] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:12:28] [INFO ] [Nat]Absence check using 175 positive place invariants in 39 ms returned sat
[2022-05-17 19:12:28] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-17 19:12:32] [INFO ] After 4645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:12:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:12:32] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:12:33] [INFO ] Deduced a trap composed of 574 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:12:34] [INFO ] Deduced a trap composed of 566 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:12:34] [INFO ] Deduced a trap composed of 568 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:12:35] [INFO ] Deduced a trap composed of 578 places in 596 ms of which 1 ms to minimize.
[2022-05-17 19:12:36] [INFO ] Deduced a trap composed of 570 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:12:37] [INFO ] Deduced a trap composed of 572 places in 580 ms of which 1 ms to minimize.
[2022-05-17 19:12:37] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:12:38] [INFO ] Deduced a trap composed of 580 places in 581 ms of which 1 ms to minimize.
[2022-05-17 19:12:39] [INFO ] Deduced a trap composed of 582 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:12:39] [INFO ] Deduced a trap composed of 588 places in 587 ms of which 2 ms to minimize.
[2022-05-17 19:12:40] [INFO ] Deduced a trap composed of 568 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:12:41] [INFO ] Deduced a trap composed of 558 places in 588 ms of which 2 ms to minimize.
[2022-05-17 19:12:42] [INFO ] Deduced a trap composed of 568 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:12:43] [INFO ] Deduced a trap composed of 582 places in 591 ms of which 2 ms to minimize.
[2022-05-17 19:12:44] [INFO ] Deduced a trap composed of 562 places in 573 ms of which 1 ms to minimize.
[2022-05-17 19:12:45] [INFO ] Deduced a trap composed of 560 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:12:46] [INFO ] Deduced a trap composed of 570 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:12:46] [INFO ] Deduced a trap composed of 570 places in 616 ms of which 1 ms to minimize.
[2022-05-17 19:12:47] [INFO ] Deduced a trap composed of 572 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:12:48] [INFO ] Deduced a trap composed of 582 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:12:48] [INFO ] Deduced a trap composed of 572 places in 572 ms of which 1 ms to minimize.
[2022-05-17 19:12:49] [INFO ] Deduced a trap composed of 586 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:12:50] [INFO ] Deduced a trap composed of 570 places in 619 ms of which 1 ms to minimize.
[2022-05-17 19:12:50] [INFO ] Deduced a trap composed of 576 places in 605 ms of which 2 ms to minimize.
[2022-05-17 19:12:51] [INFO ] Deduced a trap composed of 584 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:12:52] [INFO ] Deduced a trap composed of 580 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:12:53] [INFO ] Deduced a trap composed of 572 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:12:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:12:53] [INFO ] After 25315ms 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 72 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-17 19:12:53] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:12:53] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-17 19:12:54] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 729 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238962 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238962 steps, saw 39802 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:12:57] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:12:57] [INFO ] Computed 182 place invariants in 59 ms
[2022-05-17 19:12:58] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2022-05-17 19:12:58] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-17 19:12:58] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:12:58] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2022-05-17 19:12:58] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-17 19:13:03] [INFO ] After 4765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:13:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:13:03] [INFO ] After 80ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:13:03] [INFO ] Deduced a trap composed of 574 places in 599 ms of which 2 ms to minimize.
[2022-05-17 19:13:04] [INFO ] Deduced a trap composed of 566 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:13:05] [INFO ] Deduced a trap composed of 568 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:13:06] [INFO ] Deduced a trap composed of 578 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:13:06] [INFO ] Deduced a trap composed of 570 places in 583 ms of which 1 ms to minimize.
[2022-05-17 19:13:07] [INFO ] Deduced a trap composed of 572 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:13:08] [INFO ] Deduced a trap composed of 574 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:13:08] [INFO ] Deduced a trap composed of 580 places in 586 ms of which 1 ms to minimize.
[2022-05-17 19:13:09] [INFO ] Deduced a trap composed of 582 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:13:10] [INFO ] Deduced a trap composed of 588 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:13:11] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:13:12] [INFO ] Deduced a trap composed of 558 places in 599 ms of which 2 ms to minimize.
[2022-05-17 19:13:13] [INFO ] Deduced a trap composed of 568 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:13:13] [INFO ] Deduced a trap composed of 582 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:13:14] [INFO ] Deduced a trap composed of 562 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:13:15] [INFO ] Deduced a trap composed of 560 places in 598 ms of which 2 ms to minimize.
[2022-05-17 19:13:16] [INFO ] Deduced a trap composed of 570 places in 586 ms of which 2 ms to minimize.
[2022-05-17 19:13:17] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 2 ms to minimize.
[2022-05-17 19:13:17] [INFO ] Deduced a trap composed of 572 places in 593 ms of which 1 ms to minimize.
[2022-05-17 19:13:18] [INFO ] Deduced a trap composed of 582 places in 577 ms of which 1 ms to minimize.
[2022-05-17 19:13:19] [INFO ] Deduced a trap composed of 572 places in 591 ms of which 1 ms to minimize.
[2022-05-17 19:13:19] [INFO ] Deduced a trap composed of 586 places in 587 ms of which 1 ms to minimize.
[2022-05-17 19:13:20] [INFO ] Deduced a trap composed of 570 places in 584 ms of which 1 ms to minimize.
[2022-05-17 19:13:21] [INFO ] Deduced a trap composed of 576 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:13:22] [INFO ] Deduced a trap composed of 584 places in 626 ms of which 4 ms to minimize.
[2022-05-17 19:13:23] [INFO ] Deduced a trap composed of 580 places in 638 ms of which 1 ms to minimize.
[2022-05-17 19:13:23] [INFO ] Deduced a trap composed of 572 places in 619 ms of which 2 ms to minimize.
[2022-05-17 19:13:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:13:23] [INFO ] After 25633ms 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 75 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 64 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-17 19:13:23] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:13:24] [INFO ] Computed 182 place invariants in 63 ms
[2022-05-17 19:13:25] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2022-05-17 19:13:25] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:13:25] [INFO ] Computed 182 place invariants in 57 ms
[2022-05-17 19:13:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:13:33] [INFO ] Implicit Places using invariants and state equation in 7988 ms returned []
Implicit Place search using SMT with State Equation took 9431 ms to find 0 implicit places.
[2022-05-17 19:13:33] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-17 19:13:33] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-17 19:13:33] [INFO ] Computed 182 place invariants in 60 ms
[2022-05-17 19:13:34] [INFO ] Dead Transitions using invariants and state equation in 1419 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 0 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 287 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
[2022-05-17 19:13:35] [INFO ] Computed 182 place invariants in 54 ms
[2022-05-17 19:13:35] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2022-05-17 19:13:35] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-17 19:13:35] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:13:35] [INFO ] [Nat]Absence check using 175 positive place invariants in 47 ms returned sat
[2022-05-17 19:13:35] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-17 19:13:36] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:13:37] [INFO ] Deduced a trap composed of 566 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:13:37] [INFO ] Deduced a trap composed of 576 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:13:38] [INFO ] Deduced a trap composed of 566 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:13:39] [INFO ] Deduced a trap composed of 572 places in 556 ms of which 1 ms to minimize.
[2022-05-17 19:13:39] [INFO ] Deduced a trap composed of 566 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:13:40] [INFO ] Deduced a trap composed of 560 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:13:40] [INFO ] Deduced a trap composed of 572 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:13:41] [INFO ] Deduced a trap composed of 574 places in 552 ms of which 1 ms to minimize.
[2022-05-17 19:13:42] [INFO ] Deduced a trap composed of 564 places in 567 ms of which 1 ms to minimize.
[2022-05-17 19:13:43] [INFO ] Deduced a trap composed of 566 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:13:44] [INFO ] Deduced a trap composed of 566 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:13:44] [INFO ] Deduced a trap composed of 586 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:13:45] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 2 ms to minimize.
[2022-05-17 19:13:46] [INFO ] Deduced a trap composed of 576 places in 609 ms of which 1 ms to minimize.
[2022-05-17 19:13:46] [INFO ] Deduced a trap composed of 568 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:13:47] [INFO ] Deduced a trap composed of 558 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:13:48] [INFO ] Deduced a trap composed of 560 places in 610 ms of which 2 ms to minimize.
[2022-05-17 19:13:49] [INFO ] Deduced a trap composed of 558 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:13:49] [INFO ] Deduced a trap composed of 556 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:13:51] [INFO ] Deduced a trap composed of 564 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:13:52] [INFO ] Deduced a trap composed of 582 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:13:52] [INFO ] Deduced a trap composed of 568 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:13:53] [INFO ] Deduced a trap composed of 580 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:13:54] [INFO ] Deduced a trap composed of 576 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:13:54] [INFO ] Deduced a trap composed of 556 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:13:55] [INFO ] Deduced a trap composed of 558 places in 550 ms of which 1 ms to minimize.
[2022-05-17 19:13:56] [INFO ] Deduced a trap composed of 568 places in 566 ms of which 1 ms to minimize.
[2022-05-17 19:13:56] [INFO ] Deduced a trap composed of 572 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:13:57] [INFO ] Deduced a trap composed of 574 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:13:58] [INFO ] Deduced a trap composed of 562 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:13:58] [INFO ] Deduced a trap composed of 570 places in 561 ms of which 2 ms to minimize.
[2022-05-17 19:13:59] [INFO ] Deduced a trap composed of 574 places in 572 ms of which 1 ms to minimize.
[2022-05-17 19:14:00] [INFO ] Deduced a trap composed of 572 places in 616 ms of which 1 ms to minimize.
[2022-05-17 19:14:01] [INFO ] Deduced a trap composed of 574 places in 543 ms of which 1 ms to minimize.
[2022-05-17 19:14:01] [INFO ] Deduced a trap composed of 558 places in 556 ms of which 1 ms to minimize.
[2022-05-17 19:14:02] [INFO ] Deduced a trap composed of 568 places in 569 ms of which 1 ms to minimize.
[2022-05-17 19:14:02] [INFO ] Deduced a trap composed of 564 places in 574 ms of which 2 ms to minimize.
[2022-05-17 19:14:03] [INFO ] Deduced a trap composed of 564 places in 572 ms of which 1 ms to minimize.
[2022-05-17 19:14:04] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:14:04] [INFO ] Deduced a trap composed of 570 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:14:05] [INFO ] Deduced a trap composed of 570 places in 553 ms of which 2 ms to minimize.
[2022-05-17 19:14:06] [INFO ] Deduced a trap composed of 562 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:14:07] [INFO ] Deduced a trap composed of 570 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:14:07] [INFO ] Deduced a trap composed of 566 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:14:08] [INFO ] Deduced a trap composed of 570 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:14:09] [INFO ] Deduced a trap composed of 590 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:14:09] [INFO ] Deduced a trap composed of 584 places in 573 ms of which 1 ms to minimize.
[2022-05-17 19:14:10] [INFO ] Deduced a trap composed of 582 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:14:11] [INFO ] Deduced a trap composed of 570 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:14:19] [INFO ] Deduced a trap composed of 576 places in 567 ms of which 1 ms to minimize.
[2022-05-17 19:14:19] [INFO ] Deduced a trap composed of 568 places in 560 ms of which 1 ms to minimize.
[2022-05-17 19:14:23] [INFO ] Deduced a trap composed of 554 places in 577 ms of which 1 ms to minimize.
[2022-05-17 19:14:24] [INFO ] Deduced a trap composed of 574 places in 566 ms of which 5 ms to minimize.
[2022-05-17 19:14:25] [INFO ] Deduced a trap composed of 574 places in 578 ms of which 1 ms to minimize.
[2022-05-17 19:14:25] [INFO ] Deduced a trap composed of 574 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:14:26] [INFO ] Deduced a trap composed of 582 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:14:27] [INFO ] Deduced a trap composed of 574 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:14:28] [INFO ] Deduced a trap composed of 560 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:14:28] [INFO ] Deduced a trap composed of 574 places in 592 ms of which 2 ms to minimize.
[2022-05-17 19:14:29] [INFO ] Deduced a trap composed of 586 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:14:30] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:14:30] [INFO ] Deduced a trap composed of 556 places in 592 ms of which 2 ms to minimize.
[2022-05-17 19:14:31] [INFO ] Deduced a trap composed of 560 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:14:32] [INFO ] Deduced a trap composed of 570 places in 597 ms of which 1 ms to minimize.
[2022-05-17 19:14:33] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 2 ms to minimize.
[2022-05-17 19:14:33] [INFO ] Deduced a trap composed of 568 places in 610 ms of which 2 ms to minimize.
[2022-05-17 19:14:34] [INFO ] Deduced a trap composed of 566 places in 607 ms of which 2 ms to minimize.
[2022-05-17 19:14:35] [INFO ] Deduced a trap composed of 564 places in 607 ms of which 2 ms to minimize.
[2022-05-17 19:14:35] [INFO ] Deduced a trap composed of 566 places in 581 ms of which 2 ms to minimize.
[2022-05-17 19:14:36] [INFO ] Deduced a trap composed of 562 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:14:37] [INFO ] Deduced a trap composed of 568 places in 611 ms of which 1 ms to minimize.
[2022-05-17 19:14:37] [INFO ] Deduced a trap composed of 558 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:14:38] [INFO ] Deduced a trap composed of 554 places in 611 ms of which 1 ms to minimize.
[2022-05-17 19:14:39] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:14:39] [INFO ] Deduced a trap composed of 576 places in 605 ms of which 1 ms to minimize.
[2022-05-17 19:14:40] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2022-05-17 19:14:41] [INFO ] Deduced a trap composed of 558 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:14:43] [INFO ] Deduced a trap composed of 572 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:14:44] [INFO ] Deduced a trap composed of 576 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:14:44] [INFO ] Deduced a trap composed of 572 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:14:45] [INFO ] Deduced a trap composed of 566 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:14:46] [INFO ] Deduced a trap composed of 568 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:14:46] [INFO ] Deduced a trap composed of 560 places in 554 ms of which 2 ms to minimize.
[2022-05-17 19:14:47] [INFO ] Deduced a trap composed of 568 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:14:48] [INFO ] Deduced a trap composed of 576 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:14:48] [INFO ] Deduced a trap composed of 570 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:14:49] [INFO ] Deduced a trap composed of 570 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:14:50] [INFO ] Deduced a trap composed of 562 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:14:50] [INFO ] Deduced a trap composed of 568 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:14:51] [INFO ] Deduced a trap composed of 568 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:14:52] [INFO ] Deduced a trap composed of 564 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:14:52] [INFO ] Deduced a trap composed of 576 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:14:53] [INFO ] Deduced a trap composed of 578 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:14:54] [INFO ] Deduced a trap composed of 572 places in 529 ms of which 1 ms to minimize.
[2022-05-17 19:14:54] [INFO ] Deduced a trap composed of 556 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:14:55] [INFO ] Deduced a trap composed of 580 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:14:55] [INFO ] Deduced a trap composed of 566 places in 550 ms of which 1 ms to minimize.
[2022-05-17 19:14:56] [INFO ] Deduced a trap composed of 562 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:14:57] [INFO ] Deduced a trap composed of 578 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:14:57] [INFO ] Deduced a trap composed of 568 places in 598 ms of which 2 ms to minimize.
[2022-05-17 19:14:58] [INFO ] Deduced a trap composed of 562 places in 566 ms of which 1 ms to minimize.
[2022-05-17 19:14:59] [INFO ] Deduced a trap composed of 568 places in 560 ms of which 1 ms to minimize.
[2022-05-17 19:14:59] [INFO ] Deduced a trap composed of 560 places in 567 ms of which 1 ms to minimize.
[2022-05-17 19:15:00] [INFO ] Deduced a trap composed of 562 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:15:01] [INFO ] Deduced a trap composed of 564 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:15:01] [INFO ] Deduced a trap composed of 568 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:15:02] [INFO ] Deduced a trap composed of 564 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:15:03] [INFO ] Deduced a trap composed of 562 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:15:03] [INFO ] Deduced a trap composed of 554 places in 559 ms of which 2 ms to minimize.
[2022-05-17 19:15:04] [INFO ] Deduced a trap composed of 578 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:15:04] [INFO ] Deduced a trap composed of 562 places in 540 ms of which 1 ms to minimize.
[2022-05-17 19:15:05] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:15:06] [INFO ] Deduced a trap composed of 582 places in 542 ms of which 1 ms to minimize.
[2022-05-17 19:15:06] [INFO ] Deduced a trap composed of 582 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:15:07] [INFO ] Deduced a trap composed of 564 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:15:08] [INFO ] Deduced a trap composed of 560 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:15:08] [INFO ] Deduced a trap composed of 558 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:15:09] [INFO ] Deduced a trap composed of 568 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:15:10] [INFO ] Deduced a trap composed of 592 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:15:10] [INFO ] Deduced a trap composed of 576 places in 560 ms of which 1 ms to minimize.
[2022-05-17 19:15:11] [INFO ] Deduced a trap composed of 562 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:15:11] [INFO ] Deduced a trap composed of 572 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:15:12] [INFO ] Deduced a trap composed of 576 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:15:13] [INFO ] Deduced a trap composed of 572 places in 550 ms of which 2 ms to minimize.
[2022-05-17 19:15:13] [INFO ] Deduced a trap composed of 588 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:15:14] [INFO ] Deduced a trap composed of 586 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:15:15] [INFO ] Deduced a trap composed of 576 places in 557 ms of which 1 ms to minimize.
[2022-05-17 19:15:15] [INFO ] Deduced a trap composed of 566 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:15:16] [INFO ] Deduced a trap composed of 570 places in 546 ms of which 2 ms to minimize.
[2022-05-17 19:15:17] [INFO ] Deduced a trap composed of 566 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:15:17] [INFO ] Deduced a trap composed of 570 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:15:18] [INFO ] Deduced a trap composed of 570 places in 560 ms of which 2 ms to minimize.
[2022-05-17 19:15:19] [INFO ] Deduced a trap composed of 574 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:15:19] [INFO ] Deduced a trap composed of 572 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:15:20] [INFO ] Deduced a trap composed of 570 places in 556 ms of which 1 ms to minimize.
[2022-05-17 19:15:21] [INFO ] Deduced a trap composed of 578 places in 565 ms of which 2 ms to minimize.
[2022-05-17 19:15:21] [INFO ] Deduced a trap composed of 578 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:15:22] [INFO ] Deduced a trap composed of 580 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:15:24] [INFO ] Deduced a trap composed of 574 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:17:20] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 224040 ms
[2022-05-17 19:17:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:17:20] [INFO ] After 225031ms 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 0 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 255 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
[2022-05-17 19:17:20] [INFO ] Computed 182 place invariants in 64 ms
[2022-05-17 19:17:21] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2022-05-17 19:17:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-17 19:17:21] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:17:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-17 19:17:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2022-05-17 19:17:22] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:17:22] [INFO ] Deduced a trap composed of 566 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:17:23] [INFO ] Deduced a trap composed of 576 places in 578 ms of which 1 ms to minimize.
[2022-05-17 19:17:24] [INFO ] Deduced a trap composed of 566 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:17:24] [INFO ] Deduced a trap composed of 572 places in 560 ms of which 1 ms to minimize.
[2022-05-17 19:17:25] [INFO ] Deduced a trap composed of 566 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:17:26] [INFO ] Deduced a trap composed of 560 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:17:26] [INFO ] Deduced a trap composed of 572 places in 548 ms of which 1 ms to minimize.
[2022-05-17 19:17:27] [INFO ] Deduced a trap composed of 574 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:17:28] [INFO ] Deduced a trap composed of 564 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:17:28] [INFO ] Deduced a trap composed of 566 places in 552 ms of which 1 ms to minimize.
[2022-05-17 19:17:29] [INFO ] Deduced a trap composed of 566 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:17:30] [INFO ] Deduced a trap composed of 586 places in 600 ms of which 2 ms to minimize.
[2022-05-17 19:17:31] [INFO ] Deduced a trap composed of 572 places in 588 ms of which 1 ms to minimize.
[2022-05-17 19:17:31] [INFO ] Deduced a trap composed of 576 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:17:32] [INFO ] Deduced a trap composed of 568 places in 605 ms of which 1 ms to minimize.
[2022-05-17 19:17:33] [INFO ] Deduced a trap composed of 558 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:17:33] [INFO ] Deduced a trap composed of 560 places in 600 ms of which 1 ms to minimize.
[2022-05-17 19:17:34] [INFO ] Deduced a trap composed of 558 places in 592 ms of which 1 ms to minimize.
[2022-05-17 19:17:35] [INFO ] Deduced a trap composed of 556 places in 618 ms of which 1 ms to minimize.
[2022-05-17 19:17:37] [INFO ] Deduced a trap composed of 564 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:17:37] [INFO ] Deduced a trap composed of 582 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:17:38] [INFO ] Deduced a trap composed of 568 places in 574 ms of which 1 ms to minimize.
[2022-05-17 19:17:39] [INFO ] Deduced a trap composed of 580 places in 581 ms of which 1 ms to minimize.
[2022-05-17 19:17:40] [INFO ] Deduced a trap composed of 576 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:17:40] [INFO ] Deduced a trap composed of 556 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:17:41] [INFO ] Deduced a trap composed of 558 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:17:41] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 2 ms to minimize.
[2022-05-17 19:17:42] [INFO ] Deduced a trap composed of 572 places in 539 ms of which 1 ms to minimize.
[2022-05-17 19:17:43] [INFO ] Deduced a trap composed of 574 places in 545 ms of which 2 ms to minimize.
[2022-05-17 19:17:43] [INFO ] Deduced a trap composed of 562 places in 552 ms of which 1 ms to minimize.
[2022-05-17 19:17:44] [INFO ] Deduced a trap composed of 570 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:17:45] [INFO ] Deduced a trap composed of 574 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:17:46] [INFO ] Deduced a trap composed of 572 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:17:46] [INFO ] Deduced a trap composed of 574 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:17:47] [INFO ] Deduced a trap composed of 558 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:17:48] [INFO ] Deduced a trap composed of 568 places in 556 ms of which 1 ms to minimize.
[2022-05-17 19:17:48] [INFO ] Deduced a trap composed of 564 places in 540 ms of which 1 ms to minimize.
[2022-05-17 19:17:49] [INFO ] Deduced a trap composed of 564 places in 545 ms of which 1 ms to minimize.
[2022-05-17 19:17:49] [INFO ] Deduced a trap composed of 570 places in 546 ms of which 1 ms to minimize.
[2022-05-17 19:17:50] [INFO ] Deduced a trap composed of 570 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:17:51] [INFO ] Deduced a trap composed of 570 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:17:51] [INFO ] Deduced a trap composed of 562 places in 553 ms of which 2 ms to minimize.
[2022-05-17 19:17:52] [INFO ] Deduced a trap composed of 570 places in 550 ms of which 1 ms to minimize.
[2022-05-17 19:17:53] [INFO ] Deduced a trap composed of 566 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:17:54] [INFO ] Deduced a trap composed of 570 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:17:54] [INFO ] Deduced a trap composed of 590 places in 543 ms of which 3 ms to minimize.
[2022-05-17 19:17:55] [INFO ] Deduced a trap composed of 584 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:17:56] [INFO ] Deduced a trap composed of 582 places in 542 ms of which 1 ms to minimize.
[2022-05-17 19:17:56] [INFO ] Deduced a trap composed of 570 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:18:04] [INFO ] Deduced a trap composed of 576 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:18:05] [INFO ] Deduced a trap composed of 568 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:18:09] [INFO ] Deduced a trap composed of 554 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:18:09] [INFO ] Deduced a trap composed of 574 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:18:10] [INFO ] Deduced a trap composed of 574 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:18:11] [INFO ] Deduced a trap composed of 574 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:18:11] [INFO ] Deduced a trap composed of 582 places in 558 ms of which 2 ms to minimize.
[2022-05-17 19:18:12] [INFO ] Deduced a trap composed of 574 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:18:13] [INFO ] Deduced a trap composed of 560 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:18:14] [INFO ] Deduced a trap composed of 574 places in 577 ms of which 1 ms to minimize.
[2022-05-17 19:18:14] [INFO ] Deduced a trap composed of 586 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:18:15] [INFO ] Deduced a trap composed of 562 places in 594 ms of which 1 ms to minimize.
[2022-05-17 19:18:16] [INFO ] Deduced a trap composed of 556 places in 595 ms of which 1 ms to minimize.
[2022-05-17 19:18:16] [INFO ] Deduced a trap composed of 560 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:18:17] [INFO ] Deduced a trap composed of 570 places in 606 ms of which 2 ms to minimize.
[2022-05-17 19:18:18] [INFO ] Deduced a trap composed of 568 places in 603 ms of which 1 ms to minimize.
[2022-05-17 19:18:19] [INFO ] Deduced a trap composed of 568 places in 602 ms of which 2 ms to minimize.
[2022-05-17 19:18:19] [INFO ] Deduced a trap composed of 566 places in 606 ms of which 1 ms to minimize.
[2022-05-17 19:18:20] [INFO ] Deduced a trap composed of 564 places in 606 ms of which 2 ms to minimize.
[2022-05-17 19:18:21] [INFO ] Deduced a trap composed of 566 places in 601 ms of which 1 ms to minimize.
[2022-05-17 19:18:21] [INFO ] Deduced a trap composed of 562 places in 599 ms of which 1 ms to minimize.
[2022-05-17 19:18:22] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:18:23] [INFO ] Deduced a trap composed of 558 places in 613 ms of which 1 ms to minimize.
[2022-05-17 19:18:23] [INFO ] Deduced a trap composed of 554 places in 610 ms of which 1 ms to minimize.
[2022-05-17 19:18:24] [INFO ] Deduced a trap composed of 572 places in 614 ms of which 1 ms to minimize.
[2022-05-17 19:18:25] [INFO ] Deduced a trap composed of 576 places in 612 ms of which 1 ms to minimize.
[2022-05-17 19:18:25] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2022-05-17 19:18:26] [INFO ] Deduced a trap composed of 558 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:18:28] [INFO ] Deduced a trap composed of 572 places in 590 ms of which 1 ms to minimize.
[2022-05-17 19:18:29] [INFO ] Deduced a trap composed of 576 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:18:30] [INFO ] Deduced a trap composed of 572 places in 560 ms of which 1 ms to minimize.
[2022-05-17 19:18:30] [INFO ] Deduced a trap composed of 566 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:18:31] [INFO ] Deduced a trap composed of 568 places in 553 ms of which 1 ms to minimize.
[2022-05-17 19:18:32] [INFO ] Deduced a trap composed of 560 places in 546 ms of which 1 ms to minimize.
[2022-05-17 19:18:32] [INFO ] Deduced a trap composed of 568 places in 551 ms of which 1 ms to minimize.
[2022-05-17 19:18:33] [INFO ] Deduced a trap composed of 576 places in 552 ms of which 1 ms to minimize.
[2022-05-17 19:18:34] [INFO ] Deduced a trap composed of 570 places in 569 ms of which 2 ms to minimize.
[2022-05-17 19:18:34] [INFO ] Deduced a trap composed of 570 places in 566 ms of which 1 ms to minimize.
[2022-05-17 19:18:35] [INFO ] Deduced a trap composed of 562 places in 562 ms of which 2 ms to minimize.
[2022-05-17 19:18:36] [INFO ] Deduced a trap composed of 568 places in 548 ms of which 1 ms to minimize.
[2022-05-17 19:18:36] [INFO ] Deduced a trap composed of 568 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:18:37] [INFO ] Deduced a trap composed of 564 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:18:38] [INFO ] Deduced a trap composed of 576 places in 552 ms of which 1 ms to minimize.
[2022-05-17 19:18:38] [INFO ] Deduced a trap composed of 578 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:18:39] [INFO ] Deduced a trap composed of 572 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:18:40] [INFO ] Deduced a trap composed of 556 places in 567 ms of which 1 ms to minimize.
[2022-05-17 19:18:40] [INFO ] Deduced a trap composed of 580 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:18:41] [INFO ] Deduced a trap composed of 566 places in 562 ms of which 1 ms to minimize.
[2022-05-17 19:18:42] [INFO ] Deduced a trap composed of 562 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:18:42] [INFO ] Deduced a trap composed of 578 places in 549 ms of which 1 ms to minimize.
[2022-05-17 19:18:43] [INFO ] Deduced a trap composed of 568 places in 602 ms of which 1 ms to minimize.
[2022-05-17 19:18:43] [INFO ] Deduced a trap composed of 562 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:18:44] [INFO ] Deduced a trap composed of 568 places in 561 ms of which 2 ms to minimize.
[2022-05-17 19:18:45] [INFO ] Deduced a trap composed of 560 places in 546 ms of which 1 ms to minimize.
[2022-05-17 19:18:45] [INFO ] Deduced a trap composed of 562 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:18:46] [INFO ] Deduced a trap composed of 564 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:18:47] [INFO ] Deduced a trap composed of 568 places in 561 ms of which 1 ms to minimize.
[2022-05-17 19:18:47] [INFO ] Deduced a trap composed of 564 places in 571 ms of which 1 ms to minimize.
[2022-05-17 19:18:48] [INFO ] Deduced a trap composed of 562 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:18:49] [INFO ] Deduced a trap composed of 554 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:18:49] [INFO ] Deduced a trap composed of 578 places in 554 ms of which 2 ms to minimize.
[2022-05-17 19:18:50] [INFO ] Deduced a trap composed of 562 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:18:51] [INFO ] Deduced a trap composed of 568 places in 558 ms of which 1 ms to minimize.
[2022-05-17 19:18:51] [INFO ] Deduced a trap composed of 582 places in 538 ms of which 1 ms to minimize.
[2022-05-17 19:18:52] [INFO ] Deduced a trap composed of 582 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:18:52] [INFO ] Deduced a trap composed of 564 places in 587 ms of which 2 ms to minimize.
[2022-05-17 19:18:53] [INFO ] Deduced a trap composed of 560 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:18:54] [INFO ] Deduced a trap composed of 558 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:18:54] [INFO ] Deduced a trap composed of 568 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:18:55] [INFO ] Deduced a trap composed of 592 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:18:56] [INFO ] Deduced a trap composed of 576 places in 547 ms of which 1 ms to minimize.
[2022-05-17 19:18:56] [INFO ] Deduced a trap composed of 562 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:18:57] [INFO ] Deduced a trap composed of 572 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:18:58] [INFO ] Deduced a trap composed of 576 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:18:58] [INFO ] Deduced a trap composed of 572 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:18:59] [INFO ] Deduced a trap composed of 588 places in 572 ms of which 1 ms to minimize.
[2022-05-17 19:18:59] [INFO ] Deduced a trap composed of 586 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:19:00] [INFO ] Deduced a trap composed of 576 places in 556 ms of which 1 ms to minimize.
[2022-05-17 19:19:01] [INFO ] Deduced a trap composed of 566 places in 563 ms of which 1 ms to minimize.
[2022-05-17 19:19:01] [INFO ] Deduced a trap composed of 570 places in 565 ms of which 1 ms to minimize.
[2022-05-17 19:19:02] [INFO ] Deduced a trap composed of 566 places in 554 ms of which 1 ms to minimize.
[2022-05-17 19:19:03] [INFO ] Deduced a trap composed of 570 places in 574 ms of which 1 ms to minimize.
[2022-05-17 19:19:03] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:19:04] [INFO ] Deduced a trap composed of 574 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:19:05] [INFO ] Deduced a trap composed of 572 places in 570 ms of which 1 ms to minimize.
[2022-05-17 19:19:05] [INFO ] Deduced a trap composed of 570 places in 567 ms of which 1 ms to minimize.
[2022-05-17 19:19:06] [INFO ] Deduced a trap composed of 578 places in 574 ms of which 1 ms to minimize.
[2022-05-17 19:19:07] [INFO ] Deduced a trap composed of 578 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:19:08] [INFO ] Deduced a trap composed of 580 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:19:10] [INFO ] Deduced a trap composed of 574 places in 568 ms of which 1 ms to minimize.
[2022-05-17 19:21:06] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 223996 ms
[2022-05-17 19:21:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:21:06] [INFO ] After 225025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2022-05-17 19:21:06] [INFO ] Flatten gal took : 306 ms
[2022-05-17 19:21:06] [INFO ] Flatten gal took : 179 ms
[2022-05-17 19:21:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11585271607543505391.gal : 37 ms
[2022-05-17 19:21:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17731033361186641865.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/ReachabilityFireability11585271607543505391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17731033361186641865.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/ReachabilityFireability17731033361186641865.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
Detected timeout of ITS tools.
[2022-05-17 19:21:09] [INFO ] Flatten gal took : 145 ms
[2022-05-17 19:21:09] [INFO ] Applying decomposition
[2022-05-17 19:21:10] [INFO ] Flatten gal took : 140 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/graph17331851129681280780.txt' '-o' '/tmp/graph17331851129681280780.bin' '-w' '/tmp/graph17331851129681280780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17331851129681280780.bin' '-l' '-1' '-v' '-w' '/tmp/graph17331851129681280780.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:21:10] [INFO ] Decomposing Gal with order
[2022-05-17 19:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:21:11] [INFO ] Removed a total of 4722 redundant transitions.
[2022-05-17 19:21:11] [INFO ] Flatten gal took : 495 ms
[2022-05-17 19:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 703 labels/synchronizations in 128 ms.
[2022-05-17 19:21:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4576922194272219358.gal : 26 ms
[2022-05-17 19:21:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1987310145089034836.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/ReachabilityFireability4576922194272219358.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1987310145089034836.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/ReachabilityFireability1987310145089034836.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1900461023773312189
[2022-05-17 19:21:14] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1900461023773312189
Running compilation step : cd /tmp/ltsmin1900461023773312189;'/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/ltsmin1900461023773312189;'/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/ltsmin1900461023773312189;'/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)
[2022-05-17 19:21:16] [INFO ] Flatten gal took : 127 ms
[2022-05-17 19:21:16] [INFO ] Flatten gal took : 123 ms
[2022-05-17 19:21:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1867974737383946817.gal : 14 ms
[2022-05-17 19:21:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8470871644437023992.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/ReachabilityFireability1867974737383946817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8470871644437023992.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...319
Loading property file /tmp/ReachabilityFireability8470871644437023992.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.
[2022-05-17 19:21:46] [INFO ] Flatten gal took : 113 ms
[2022-05-17 19:21:46] [INFO ] Applying decomposition
[2022-05-17 19:21:47] [INFO ] Flatten gal took : 113 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/graph14452068698431961187.txt' '-o' '/tmp/graph14452068698431961187.bin' '-w' '/tmp/graph14452068698431961187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14452068698431961187.bin' '-l' '-1' '-v' '-w' '/tmp/graph14452068698431961187.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:21:47] [INFO ] Decomposing Gal with order
[2022-05-17 19:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:21:47] [INFO ] Removed a total of 4720 redundant transitions.
[2022-05-17 19:21:47] [INFO ] Flatten gal took : 379 ms
[2022-05-17 19:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 705 labels/synchronizations in 98 ms.
[2022-05-17 19:21:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15256058129664218880.gal : 20 ms
[2022-05-17 19:21:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14536523904464547857.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/ReachabilityFireability15256058129664218880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14536523904464547857.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...300
Loading property file /tmp/ReachabilityFireability14536523904464547857.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17703458957577797382
[2022-05-17 19:22:18] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17703458957577797382
Running compilation step : cd /tmp/ltsmin17703458957577797382;'/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'
Compilation finished in 5910 ms.
Running link step : cd /tmp/ltsmin17703458957577797382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17703458957577797382;'/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'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 19:22:48] [INFO ] Flatten gal took : 104 ms
[2022-05-17 19:22:48] [INFO ] Flatten gal took : 103 ms
[2022-05-17 19:22:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7824604820645320052.gal : 11 ms
[2022-05-17 19:22:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14150554614693393318.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/ReachabilityFireability7824604820645320052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14150554614693393318.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/ReachabilityFireability14150554614693393318.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.
[2022-05-17 19:27:48] [INFO ] Flatten gal took : 104 ms
[2022-05-17 19:27:48] [INFO ] Applying decomposition
[2022-05-17 19:27:48] [INFO ] Flatten gal took : 106 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/graph10218036464339586508.txt' '-o' '/tmp/graph10218036464339586508.bin' '-w' '/tmp/graph10218036464339586508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10218036464339586508.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218036464339586508.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:27:49] [INFO ] Decomposing Gal with order
[2022-05-17 19:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:27:49] [INFO ] Removed a total of 4722 redundant transitions.
[2022-05-17 19:27:49] [INFO ] Flatten gal took : 265 ms
[2022-05-17 19:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 705 labels/synchronizations in 51 ms.
[2022-05-17 19:27:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2496949933882580017.gal : 20 ms
[2022-05-17 19:27:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability308213595843087990.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2496949933882580017.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability308213595843087990.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...297
Loading property file /tmp/ReachabilityFireability308213595843087990.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/ltsmin11707300089516357596
[2022-05-17 19:32:49] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11707300089516357596
Running compilation step : cd /tmp/ltsmin11707300089516357596;'/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 5496 ms.
Running link step : cd /tmp/ltsmin11707300089516357596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11707300089516357596;'/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="itstools"
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-4028"
echo " Executing tool itstools"
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 r175-tall-165277024500502"
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 ;